Search results for "adversary"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
4	Robert Spalek	The Multiplicative Quantum Adversary.	IEEE Conference on Computational Complexity	2008	DBLP DOI BibTeX RDF	quantum query lower bounds, quantum adversary method, multiplicative adversary, combinatorial matrices, direct product theorems
3	Huawang Qin, Yuewei Dai, Zhiquan Wang	A secret sharing scheme based on (t, n) threshold and adversary structure.	Int. J. Inf. Sec.	2009	DBLP DOI BibTeX RDF	Adversary structure, Cryptography, Information security, Secret sharing, Threshold
3	Hossein Ghodosi, Josef Pieprzyk	Multi-Party Computation with Omnipresent Adversary.	Public Key Cryptography	2009	DBLP DOI BibTeX RDF	Omnipresent Adversary, Proactive Secret Sharing, t-resilient Protocols, t-private Protocols, Multi-Party Computation
3	Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan	Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary.	ASIACCS	2009	DBLP DOI BibTeX RDF	mixed adversary, information theoretic security, error probability
3	Arpita Patra, Ashish Choudhary, Madhu Vaidyanathan, C. Pandu Rangan	Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary.	ACISP	2008	DBLP DOI BibTeX RDF	Information Theoretic Security, Mobile Adversary
3	Dan Holtby, Bruce M. Kapron, Valerie King	Lower bound for scalable Byzantine Agreement.	PODC	2006	DBLP DOI BibTeX RDF	malicious adversary, non-adaptive adversary, scalable, distributed computing, lower bounds, randomized, Byzantine Agreement, probabilistic
3	Amos Beimel, Matthew K. Franklin	Edge Eavesdropping Games.	SCN	2006	DBLP DOI BibTeX RDF	graph search games, unconditional security, passive adversary, mobile adversary
3	Enoch Peserico	The lazy adversary conjecture fails.	SPAA	2002	DBLP DOI BibTeX RDF	k-server, lazy adversary, memoryless, competitive analysis
2	Elizabeth LeMay, Michael D. Ford, Ken Keefe, William H. Sanders, Carol Muehrcke	Model-based Security Metrics Using ADversary VIew Security Evaluation (ADVISE).	QEST	2011	DBLP DOI BibTeX RDF	Quantitative Security Metrics, State-based Security Model, Adversary Attack Decisions
2	Arpita Patra, Ashish Choudhury, C. Pandu Rangan	Brief announcement: perfectly secure message transmissiontolerating mobile mixed adversary with reduced phase complexity.	PODC	2010	DBLP DOI BibTeX RDF	information theoretic security
2	Valerie King, Jared Saia	Breaking the O(n2) bit barrier: scalable byzantine agreement with an adaptive adversary.	PODC	2010	DBLP DOI BibTeX RDF	samplers, peer-to-peer, distributed computing, consensus, secret-sharing, byzantine agreement, monte carlo algorithms
2	Lasse Kliemann	Brief announcement: the price of anarchy for distributed network formation in an adversary model.	PODC	2010	DBLP DOI BibTeX RDF	pairwise nash equilibrium, pairwise stability, game theory, nash equilibrium, price of anarchy, network formation
2	Di Ma, Claudio Soriente, Gene Tsudik	New adversary and new threats: security in unattended sensor networks.	IEEE Network	2009	DBLP DOI BibTeX RDF
2	Shuo Chen, Ziqing Mao, Yi-Min Wang, Ming Zhang	Pretty-Bad-Proxy: An Overlooked Adversary in Browsers' HTTPS Deployments.	IEEE Symposium on Security and Privacy	2009	DBLP DOI BibTeX RDF
2	Marek Klonowski, Michal Przykucki, Tomasz Struminski	Data Deletion with Time-Aware Adversary Model.	CSE	2009	DBLP DOI BibTeX RDF
2	James Aspnes, Keren Censor	Approximate shared-memory counting despite a strong adversary.	SODA	2009	DBLP DOI BibTeX RDF
2	Ahto Buldas, Aivo Jürgenson, Margus Niitsoo	Efficiency Bounds for Adversary Constructions in Black-Box Reductions.	ACISP	2009	DBLP DOI BibTeX RDF
2	Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann	The Disagreement Power of an Adversary.	DISC	2009	DBLP DOI BibTeX RDF
2	Valerie King, Jared Saia	Brief announcement: fast scalable Byzantine agreement in the full information model with a nonadaptive adversary.	PODC	2009	DBLP DOI BibTeX RDF	asychrony, communication complexity, gossiping, leader election, byzantine agreement, message complexity, synchrony
2	Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann	The disagreement power of an adversary: extended abstract.	PODC	2009	DBLP DOI BibTeX RDF	fault-tolerance, failure-detectors, adversaries
2	Ben Reichardt	Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function.	FOCS	2009	DBLP DOI BibTeX RDF	span program, quantum query algorithm, adversary bound, formula evaluation, semi-definite program, quantum walk
2	Roberto Di Pietro, Claudio Soriente, Angelo Spognardi, Gene Tsudik	Collaborative authentication in unattended WSNs.	WISEC	2009	DBLP DOI BibTeX RDF	wireless sensor networks, authentication, mobile adversary
2	Robert T. König, Barbara M. Terhal	The Bounded-Storage Model in the Presence of a Quantum Adversary.	IEEE Transactions on Information Theory	2008	DBLP DOI BibTeX RDF
2	Viktor Yakovlev, Valery I. Korzhik, Guillermo Morales-Luna	Key Distribution Protocols Based on Noisy Channels in Presence of an Active Adversary: Conventional and New Versions With Parameter Optimization.	IEEE Transactions on Information Theory	2008	DBLP DOI BibTeX RDF
2	Samuel N. Hamilton, Wendy L. Hamilton	Adversary Modeling and Simulation in Cyber Warfare.	SEC	2008	DBLP DOI BibTeX RDF
2	Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao	Adversary Lower Bounds for Nonadaptive Quantum Algorithms.	WoLLIC	2008	DBLP DOI BibTeX RDF
2	Andrew M. Childs, Troy Lee	Optimal Quantum Adversary Lower Bounds for Ordered Search.	ICALP	2008	DBLP DOI BibTeX RDF
2	Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, K. Srinathan, C. Pandu Rangan	Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary.	ICITS	2008	DBLP DOI BibTeX RDF
2	Marco Benedetti, Arnaud Lallouet, Jérémie Vautard	Modeling adversary scheduling with QCSP+.	SAC	2008	DBLP DOI BibTeX RDF
2	Xin Zhang 0003, Abhishek Jain 0002, Adrian Perrig	Packet-dropping adversary identification for data plane security.	CoNEXT	2008	DBLP DOI BibTeX RDF
2	Minh-Triet Tran, Thanh-Trung Nguyen, Isao Echizen	Pool-Based APROB Channel to Provide Resistance against Global Active Adversary under Probabilistic Real-Time Condition.	EUC	2008	DBLP DOI BibTeX RDF
2	Gene Tsudik	Confronting a mobile adversary in unattended sensor networks.	ASIACCS	2008	DBLP DOI BibTeX RDF
2	Gelareh Taban, Virgil D. Gligor	Efficient Handling of Adversary Attacks in Aggregation Applications.	ESORICS	2008	DBLP DOI BibTeX RDF
2	Kunal Agrawal, Charles E. Leiserson, Yuxiong He, Wen-Jing Hsu	Adaptive work-stealing with parallelism feedback.	ACM Trans. Comput. Syst.	2008	DBLP DOI BibTeX RDF	instantaneous parallelism, parallelism feedback, trim analysis, parallel computation, randomized algorithm, job scheduling, multiprogramming, processor allocation, multiprocessing, work-stealing, Adaptive scheduling, work, thread scheduling, adversary, span, space sharing, two-level scheduling
2	Xiaoming Sun, Andrew Chi-Chih Yao, Christophe Tartary	Graph Design for Secure Multiparty Computation over Non-Abelian Groups.	ASIACRYPT	2008	DBLP DOI BibTeX RDF	Graph Coloring, Multiparty Computation, Percolation Theory, Non-Abelian Groups, Passive Adversary
2	Youming Qiao, Christophe Tartary	Counting Method for Multi-party Computation over Non-abelian Groups.	CANS	2008	DBLP DOI BibTeX RDF	Neighbor-Avoiding Walk, Random Walk, Graph Coloring, Multiparty Computation, Non-Abelian Groups, Passive Adversary
2	Huafei Zhu	Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols.	CANS	2008	DBLP DOI BibTeX RDF	Black-box constructions, defensible adversary, malicious adversary, oblivious transfer protocols
2	Leevar Williams, Richard Lippmann, Kyle Ingols	GARNET: A Graphical Attack Graph and Reachability Network Evaluation Tool.	VizSEC	2008	DBLP DOI BibTeX RDF	attack path, visualization, network, recommendation, vulnerability, treemap, security metrics, attack graph, exploit, adversary model
2	Dan Holtby, Bruce M. Kapron, Valerie King	Lower bound for scalable Byzantine Agreement.	Distributed Computing	2008	DBLP DOI BibTeX RDF	Scalable distributed protocol, Malicious adversary, Lower bounds, Byzantine Agreement
2	Alvaro A. Cárdenas, George V. Moustakides, John S. Baras	Towards Optimal Design of Data Hiding Algorithms Against Nonparametric Adversary Models.	CISS	2007	DBLP DOI BibTeX RDF
2	Maxim Likhachev, Anthony Stentz	Goal directed navigation with uncertainty in adversary locations.	IROS	2007	DBLP DOI BibTeX RDF
2	Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan	Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary.	DISC	2007	DBLP DOI BibTeX RDF
2	Vivek K. Singh, Mohan S. Kankanhalli	Towards Adversary Aware Surveillance Systems.	ICME	2007	DBLP DOI BibTeX RDF
2	Arpita Patra, Bhavani Shankar, Ashish Choudhary, K. Srinathan, C. Pandu Rangan	Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary.	CANS	2007	DBLP DOI BibTeX RDF	Reliable and Secure Communication, Information Theoretic Security, Directed Networks, Communication Efficiency
2	Lars E. Olson, Michael J. Rosulek, Marianne Winslett	Harvesting credentials in trust negotiation as an honest-but-curious adversary.	WPES	2007	DBLP DOI BibTeX RDF	privacy, protocol, vulnerability, trust negotiation
2	Taisuke Izumi, Koichi Wada	On the Probabilistic Omission Adversary.	SSS	2007	DBLP DOI BibTeX RDF
2	Yuriy Brun, Nenad Medvidovic	Fault and adversary tolerance as an emergent property of distributed systems' software architectures.	EFTS	2007	DBLP DOI BibTeX RDF
2	Virgil D. Gligor	On the evolution of adversary models in security protocols: from the beginning to sensor networks.	ASIACCS	2007	DBLP DOI BibTeX RDF
2	Liang Lu, Reihaneh Safavi-Naini, Jeffrey Horton, Willy Susilo	An Adversary Aware and Intrusion Detection Aware Attack Model Ranking Scheme.	ACNS	2007	DBLP DOI BibTeX RDF
2	Dongvu Tonien, Reihaneh Safavi-Naini, Peter R. Wild	Combinatorial characterizations of authentication codes in verification oracle model.	ASIACCS	2007	DBLP DOI BibTeX RDF	active adversary model, combinatorial bounds, unconditional security, authentication codes
2	Kunal Agrawal, Yuxiong He, Charles E. Leiserson	Adaptive work stealing with parallelism feedback.	PPOPP	2007	DBLP DOI BibTeX RDF	multithreaded languages, parallelism feedback, trim analysis, parallel computation, job scheduling, multiprogramming, processor allocation, work stealing, adaptive scheduling, distributed scheduling, thread scheduling, adversary, space sharing, two-level scheduling
2	Peter Høyer, Troy Lee, Robert Spalek	Negative weights make adversaries stronger.	STOC	2007	DBLP DOI BibTeX RDF	adversary method, certificate complexity barrier, formula size, quantum query complexity, lower bounds, quantum computing
2	Sophie Laplante, Troy Lee, Mario Szegedy	The Quantum Adversary Method and Classical Formula Size Lower Bounds.	Computational Complexity	2006	DBLP DOI BibTeX RDF	68Q30, Subject classification. 68Q17
2	Sarah Gordon	Understanding the Adversary: Virus Writers and Beyond.	IEEE Security & Privacy	2006	DBLP DOI BibTeX RDF
2	Alexander Russell, Hong Wang 0002	How to fool an unbounded adversary with a short key.	IEEE Transactions on Information Theory	2006	DBLP DOI BibTeX RDF
2	Varsha Dani, Thomas P. Hayes	Robbing the bandit: less regret in online geometric optimization against an adaptive adversary.	SODA	2006	DBLP DOI BibTeX RDF
2	Jedrzej Kabarowski, Miroslaw Kutylowski, Wojciech Rutkowski	Adversary Immune Size Approximation of Single-Hop Radio Networks.	TAMC	2006	DBLP DOI BibTeX RDF
2	Ke Chen 0006	How to play a coloring game against a color-blind adversary.	Symposium on Computational Geometry	2006	DBLP DOI BibTeX RDF	conflict-free coloring, online algorithm
2	Joseph Pamula, Sushil Jajodia, Paul Ammann, Vipin Swarup	A weakest-adversary security metric for network configuration security analysis.	QoP	2006	DBLP DOI BibTeX RDF	network security, vulnerability, security metric, attack graphs, exploit, quantitative measure
2	Kunal Agrawal, Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson	Adaptive scheduling with parallelism feedback.	PPOPP	2006	DBLP DOI BibTeX RDF	greedy scheduling, instantaneous parallelism, parallelism feedback, trim analysis, parallel computation, task scheduling, job scheduling, multiprogramming, processor allocation, multiprocessing, critical path, adaptive scheduling, work, adversary, space sharing, data-parallel computing, two-level scheduling
2	Gergely Ács, Levente Buttyán, István Vajda	Modelling adversaries and security objectives for routing protocols in wireless sensor networks.	SASN	2006	DBLP DOI BibTeX RDF	sensor networks, routing protocols, provable security, simulatability, adversary model
2	Payman Mohassel, Matthew K. Franklin	Efficiency Tradeoffs for Malicious Two-Party Computation.	Public Key Cryptography	2006	DBLP DOI BibTeX RDF	Yao’s garbled circuit, malicious adversary, secure two-party computation, secure function evaluation
2	Payman Mohassel, Matthew K. Franklin	Efficient Polynomial Operations in the Shared-Coefficients Setting.	Public Key Cryptography	2006	DBLP DOI BibTeX RDF	polynomial operations, threshold homomorphic encryption, privacy-preserving set operations, secure multi-party computation, passive adversary
2	Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas	Performing work in broadcast networks.	Distributed Computing	2006	DBLP DOI BibTeX RDF	Fail-stop failure, Distributed algorithm, Multiple-access channel, Adversary, Independent tasks
2	Yonatan Aumann, Michael A. Bender	Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler.	Distributed Computing	2005	DBLP DOI BibTeX RDF
2	Robert Spalek, Mario Szegedy	All Quantum Adversary Methods Are Equivalent.	ICALP	2005	DBLP DOI BibTeX RDF
2	Virgil D. Gligor	On the Evolution of Adversary Models in Security Protocols (or Know Your Friend and Foe Alike).	Security Protocols Workshop	2005	DBLP DOI BibTeX RDF
2	Yvo Desmedt, Yongge Wang, Mike Burmester	A Complete Characterization of Tolerable Adversary Structures for Secure Point-to-Point Transmissions Without Feedback.	ISAAC	2005	DBLP DOI BibTeX RDF
2	Sophie Laplante, Troy Lee, Mario Szegedy	The Quantum Adversary Method and Classical Formula Size Lower Bounds.	IEEE Conference on Computational Complexity	2005	DBLP DOI BibTeX RDF
2	Andrei Serjantov, Steven J. Murdoch	Message Splitting Against the Partial Adversary.	Privacy Enhancing Technologies	2005	DBLP DOI BibTeX RDF
2	Hagit Attiya, David Hay	Randomization does not reduce the average delay in parallel packet switches.	SPAA	2005	DBLP DOI BibTeX RDF	oblivious adversary, load balancing, packet switching, randomization, clos networks, queuing delay, inverse multiplexing, adaptive adversary
2	Ling Cheung	Randomized Wait-Free Consensus Using an Atomicity Assumption.	OPODIS	2005	DBLP DOI BibTeX RDF	Asynchronous Consensus, Wait-Free Termination, Weak Adversary, Randomized Algorithms, Probabilistic Model Checking
2	Enoch Peserico	The Lazy Adversary Conjecture Fails.	Theory Comput. Syst.	2004	DBLP DOI BibTeX RDF
2	H. Brendan McMahan, Avrim Blum	Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary.	COLT	2004	DBLP DOI BibTeX RDF
2	Miroslaw Kutylowski, Wojciech Rutkowski	Adversary Immune Leader Election in ad hoc Radio Networks.	ESA	2003	DBLP DOI BibTeX RDF
2	Jae-Ha Lee	Online Deadline Scheduling: Team Adversary and Restart.	WAOA	2003	DBLP DOI BibTeX RDF
2	Ventzislav Nikov, Svetla Nikova, Bart Preneel	Multi-party Computation from Any Linear Secret Sharing Scheme Unconditionally Secure against Adaptive Adversary: The Zero-Error Case.	ACNS	2003	DBLP DOI BibTeX RDF
2	Sviatoslav Braynov, Murtuza Jadliwala	Representation and analysis of coordinated attacks.	FMSE	2003	DBLP DOI BibTeX RDF	attack plan, coordinated attack, model checking, attack graph, adversary modelling
2	Pierre-Alain Fouque, Gwenaëlle Martinet, Guillaume Poupard	Practical Symmetric On-Line Encryption.	FSE	2003	DBLP DOI BibTeX RDF	blockwise adversary, Symmetric encryption, chosen plaintext attacks
2	Gene Itkis	Intrusion-Resilient Signatures: Generic Constructions, or Defeating Strong Adversary with Minimal Assumptions.	SCN	2002	DBLP DOI BibTeX RDF
2	Alexander Russell, Hong Wang 0002	How to Fool an Unbounded Adversary with a Short Key.	EUROCRYPT	2002	DBLP DOI BibTeX RDF
2	M. V. N. Ashwin Kumar, Pranava R. Goundan, K. Srinathan, C. Pandu Rangan	On perfectly secure cmmunication over arbitrary networks.	PODC	2002	DBLP DOI BibTeX RDF	adversary structures, secure communication, information-theoretic security, secure multiparty computation
2	Bogdan S. Chlebus, Dariusz R. Kowalski	Gossiping to reach consensus.	SPAA	2002	DBLP DOI BibTeX RDF	distributed algorithm, lower bound, consensus, gossiping, processor failures, adaptive adversary
2	Ueli M. Maurer	Secure Multi-party Computation Made Simple.	SCN	2002	DBLP DOI BibTeX RDF	adversary structures, secret-sharing, Secure multi-party computation, verifiable secret-sharing
2	Yasutake Takahashi, Takashi Tamura, Minoru Asada	Strategy Learning for a Team in Adversary Environments.	RoboCup	2001	DBLP DOI BibTeX RDF
2	Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas	The do-all problem in broadcast networks.	PODC	2001	DBLP DOI BibTeX RDF	fail-stop failures, distributed algorithm, lower bound, multiple-access channel, adversary, independent tasks
2	Pierre-Alain Fouque, Jacques Stern	One Round Threshold Discrete-Log Key Generation without Private Channels.	Public Key Cryptography	2001	DBLP DOI BibTeX RDF	Threshold DLK Generation, Publicly Verifiable Encryption, Adaptive and Concurrent Adversary
2	Eric Bach, Joan Boyar, Tao Jiang, Kim S. Larsen, Guo-Hui Lin	Better Bounds on the Accommodating Ratio for the Seat Reservation Problem.	COCOON	2000	DBLP DOI BibTeX RDF	the seat reservation problem, accommodating ratio, adversary argument, on-line algorithms
2	Stefan Felsner, Ravi Kant, C. Pandu Rangan, Dorothea Wagner	On the Complexity of Partial Order Properties.	Order	2000	DBLP DOI BibTeX RDF	recognition complexity, adversary, evasiveness
2	Ronald Cramer, Ivan Damgård, Stefan Dziembowski, Martin Hirt, Tal Rabin	Efficient Multiparty Computations Secure Against an Adaptive Adversary.	EUROCRYPT	1999	DBLP DOI BibTeX RDF
2	Bernd Altmann, Matthias Fitzi, Ueli M. Maurer	Byzantine Agreement Secure against General Adversaries in the Dual Failure Model.	DISC	1999	DBLP DOI BibTeX RDF	active adversary, fail-corruption, Broadcast, Byzantine agreement, unconditional security
2	Matthias Fitzi, Ueli M. Maurer	Efficient Byzantine Agreement Secure Against General Adversaries.	DISC	1998	DBLP DOI BibTeX RDF	general adversary, Broadcast, fault detection, Byzantine agreement, multi- party computation
2	Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul M. B. Vitányi	Randomized Naming Using Wait-Free Shared Variables.	Distributed Computing	1998	DBLP DOI BibTeX RDF	Naming problem, Unique process ID, Asynchronous distributed protocols, Wait-free read/write registers, Test-and-set objects, Fault-tolerance, Randomized algorithms, Shared memory, Atomicity, Symmetry breaking, Adaptive adversary
2	Bala Kalyanasundaram, Kirk Pruhs	Minimizing Flow Time Nonclairvoyantly.	FOCS	1997	DBLP DOI BibTeX RDF	flow time minimization, dynamically arriving jobs, unknown execution times, average response/flow time, classic CPU scheduling problem, time sharing operating systems, standard 3-field scheduling notation, nonclairvoyant version, randomized nonclairvoyant algorithm, RMLF, multi level feedback algorithm, deterministic nonclairvoyant algorithm, scheduling, minimisation, competitive ratio, Unix operating system, adaptive adversary
2	Yonatan Aumann, Michael A. Bender	Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler.	ICALP	1996	DBLP DOI BibTeX RDF
2	Noga Alon, Zvi Galil, Moti Yung	Efficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary.	ESA	1995	DBLP DOI BibTeX RDF
2	Peter Ruzicka, Juraj Wiedermann	How Good Is the Adversary Lower Bound?	MFCS	1977	DBLP DOI BibTeX RDF
1	Varsha Dani, Valerie King, Mahnush Movahedi, Jared Saia	Breaking the O(nm) Bit Barrier: Secure Multiparty Computation with a Static Adversary	CoRR	2012	DBLP BibTeX RDF
1	Aleksandrs Belovs	Adversary Lower Bound for Element Distinctness	CoRR	2012	DBLP BibTeX RDF
1	Lasse Kliemann	The Price of Anarchy for Network Formation in an Adversary Model	CoRR	2012	DBLP BibTeX RDF