Search results for "adversary"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
121	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
93	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
77	Robert Spalek	The Multiplicative Quantum Adversary.	CCC	2008	DBLP DOI BibTeX RDF	quantum query lower bounds, quantum adversary method, multiplicative adversary, combinatorial matrices, direct product theorems
66	Vassilis Zikas, Sarah Hauser, Ueli M. Maurer	Realistic Failures in Secure Multi-party Computation.	TCC	2009	DBLP DOI BibTeX RDF
61	Gene Tsudik	Confronting a mobile adversary in unattended sensor networks.	AsiaCCS	2008	DBLP DOI BibTeX RDF
61	Robert Spalek, Mario Szegedy	All Quantum Adversary Methods Are Equivalent.	ICALP	2005	DBLP DOI BibTeX RDF
59	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
58	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
56	Amos Beimel, Matthew K. Franklin	Edge Eavesdropping Games.	SCN	2006	DBLP DOI BibTeX RDF	graph search games, unconditional security, passive adversary, mobile adversary
55	Marek Klonowski, Michal Przykucki, Tomasz Struminski	Data Deletion with Time-Aware Adversary Model.	CSE (2)	2009	DBLP DOI BibTeX RDF
55	Samuel N. Hamilton, Wendy L. Hamilton	Adversary Modeling and Simulation in Cyber Warfare.	SEC	2008	DBLP DOI BibTeX RDF
55	H. Brendan McMahan, Avrim Blum	Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary.	COLT	2004	DBLP DOI BibTeX RDF
53	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
51	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
48	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
48	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
46	Doran Chakraborty, Peter Stone	Online Multiagent Learning against Memory Bounded Adversaries.	ECML/PKDD (1)	2008	DBLP DOI BibTeX RDF
46	Xinyi Huang 0001, Yi Mu 0001, Willy Susilo, Duncan S. Wong, Wei Wu 0001	Certificateless Signature Revisited.	ACISP	2007	DBLP DOI BibTeX RDF	Certificateless cryptology, Signature, Security model, Random oracle
46	Enoch Peserico	The lazy adversary conjecture fails.	SPAA	2002	DBLP DOI BibTeX RDF	k-server, lazy adversary, memoryless, competitive analysis
44	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
42	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
42	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
42	Shuo Chen, Ziqing Mao, Yi-Min Wang, Ming Zhang	Pretty-Bad-Proxy: An Overlooked Adversary in Browsers' HTTPS Deployments.	SP	2009	DBLP DOI BibTeX RDF
42	Andrew M. Childs, Troy Lee	Optimal Quantum Adversary Lower Bounds for Ordered Search.	ICALP (1)	2008	DBLP DOI BibTeX RDF
42	Vivek K. Singh 0001, Mohan S. Kankanhalli	Towards Adversary Aware Surveillance Systems.	ICME	2007	DBLP DOI BibTeX RDF
42	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
40	Martin Hirt, Ueli M. Maurer, Vassilis Zikas	MPC vs. SFE : Unconditional and Computational Security.	ASIACRYPT	2008	DBLP DOI BibTeX RDF
40	Yvo Desmedt, Yongge Wang, Mike Burmester	Revisiting Colored Networks and Privacy Preserving Censorship.	CRITIS	2006	DBLP DOI BibTeX RDF
40	Christian Scheideler	How to spread adversarial nodes?: rotate!	STOC	2005	DBLP DOI BibTeX RDF	join-leave attacks, random mixing, proactive security
40	Joseph Y. Halpern, Riccardo Pucella	Modeling Adversaries in a Logic for Security Protocol Analysis.	FASec	2002	DBLP DOI BibTeX RDF
40	Michiel Blom, Sven Oliver Krumke, Willem de Paepe, Leen Stougie	The Online-TSP against Fair Adversaries.	CIAC	2000	DBLP DOI BibTeX RDF
40	Ran El-Yaniv, Ron Kaniel, Nathan Linial	Competitive Optimal On-Line Leasing.	Algorithmica	1999	DBLP DOI BibTeX RDF	Lease-or-buy problem, Equipment rental, Ski rental, Competitive analysis, On-line algorithms, Leasing
40	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
38	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
38	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
36	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
36	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
35	Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann	The Disagreement Power of an Adversary.	DISC	2009	DBLP DOI BibTeX RDF
35	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
35	Xin Zhang 0003, Abhishek Jain 0002, Adrian Perrig	Packet-dropping adversary identification for data plane security.	CoNEXT	2008	DBLP DOI BibTeX RDF
35	Minh-Triet Tran, Trung Thanh Nguyen 0005, Isao Echizen	Pool-Based APROB Channel to Provide Resistance against Global Active Adversary under Probabilistic Real-Time Condition.	EUC (2)	2008	DBLP DOI BibTeX RDF
35	Virgil D. Gligor	On the evolution of adversary models in security protocols: from the beginning to sensor networks.	AsiaCCS	2007	DBLP DOI BibTeX RDF
35	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
35	Alexander Russell, Hong Wang 0002	How to fool an unbounded adversary with a short key.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
35	Varsha Dani, Thomas P. Hayes	Robbing the bandit: less regret in online geometric optimization against an adaptive adversary.	SODA	2006	DBLP DOI BibTeX RDF
35	Enoch Peserico	The Lazy Adversary Conjecture Fails.	Theory Comput. Syst.	2004	DBLP DOI BibTeX RDF
35	Miroslaw Kutylowski, Wojciech Rutkowski	Adversary Immune Leader Election in ad hoc Radio Networks.	ESA	2003	DBLP DOI BibTeX RDF
35	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
35	Peter Ruzicka, Juraj Wiedermann	How Good Is the Adversary Lower Bound?	MFCS	1977	DBLP DOI BibTeX RDF
33	Maurice Herlihy, Sergio Rajsbaum	The topology of shared-memory adversaries.	PODC	2010	DBLP DOI BibTeX RDF	fault-tolerance, shared-memory, set agreement, combinatorial topology
33	Shi-Chun Tsai, Wen-Guey Tzeng, Kun-Yi Zhou	Key establishment schemes against storage-bounded adversaries in wireless sensor networks.	IEEE Trans. Wirel. Commun.	2009	DBLP DOI BibTeX RDF
33	Roberto Baldoni, Marco Platania, Leonardo Querzoni, Sirio Scipioni	A Peer-to-Peer Filter-Based Algorithm for Internal Clock Synchronization in Presence of Corrupted Processes.	PRDC	2008	DBLP DOI BibTeX RDF
33	Matthew Andrews, Lisa Zhang	Routing and scheduling in multihop wireless networks with time-varying channels.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	Scheduling, routing, wireless network, stability, time-varying
33	Kannan Srinathan, Prasad Raghavendra, C. Pandu Rangan	On Proactive Perfectly Secure Message Transmission.	ACISP	2007	DBLP DOI BibTeX RDF	Perfectly Secure Communication, Proactive security
33	Ari Juels, Dario Catalano, Markus Jakobsson	Coercion-resistant electronic elections.	WPES	2005	DBLP DOI BibTeX RDF	electronic voting, mix networks, receipt-freeness, coercion-resistance
33	Shouhuai Xu	On the security of group communication schemes based on symmetric key cryptosystems.	SASN	2005	DBLP DOI BibTeX RDF	backward-security, security, key management, group communication, broadcast encryption, forward-security
33	Matthew Andrews, Lisa Zhang	Routing and scheduling in multihop wireless networks with time-varying channels.	SODA	2004	DBLP BibTeX RDF
33	Ventzislav Nikov, Svetla Nikova	On Proactive Secret Sharing Schemes.	Selected Areas in Cryptography	2004	DBLP DOI BibTeX RDF
33	Nilesh N. Dalvi, Pedro M. Domingos, Mausam, Sumit K. Sanghai, Deepak Verma	Adversarial classification.	KDD	2004	DBLP DOI BibTeX RDF	game theory, integer linear programming, naive Bayes, cost-sensitive learning, spam detection
33	Marcin Gomulkiewicz, Marek Klonowski, Miroslaw Kutylowski	Onions Based on Universal Re-encryption - Anonymous Communication Immune Against Repetitive Attack.	WISA	2004	DBLP DOI BibTeX RDF
33	Bogdan S. Chlebus, Mariusz A. Rokicki	Asynchronous Broadcast in Radio Networks.	SIROCCO	2004	DBLP DOI BibTeX RDF
33	Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Alexander A. Shvartsman	Bounding Work and Communication in Robust Cooperative Computation.	DISC	2002	DBLP DOI BibTeX RDF
33	Stefan Dziembowski, Ueli M. Maurer	Tight security proofs for the bounded-storage model.	STOC	2002	DBLP DOI BibTeX RDF
33	Marc Joye, Jean-Jacques Quisquater, Moti Yung	On the Power of Misbehaving Adversaries and Security Analysis of the Original EPOC.	CT-RSA	2001	DBLP DOI BibTeX RDF
33	Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz	PAC Learning with Nasty Noise.	ALT	1999	DBLP DOI BibTeX RDF
33	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
33	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
31	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
31	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
31	Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas	Performing work in broadcast networks.	Distributed Comput.	2006	DBLP DOI BibTeX RDF	Fail-stop failure, Distributed algorithm, Multiple-access channel, Adversary, Independent tasks
31	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
31	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
31	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
31	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
31	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
31	Eric Bach 0001, Joan Boyar, Tao Jiang 0001, 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
28	Ahto Buldas, Aivo Jürgenson, Margus Niitsoo	Efficiency Bounds for Adversary Constructions in Black-Box Reductions.	ACISP	2009	DBLP DOI BibTeX RDF
28	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
28	Robert T. König, Barbara M. Terhal	The Bounded-Storage Model in the Presence of a Quantum Adversary.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
28	Marco Benedetti, Arnaud Lallouet, Jérémie Vautard	Modeling adversary scheduling with QCSP+.	SAC	2008	DBLP DOI BibTeX RDF
28	Gelareh Taban, Virgil D. Gligor	Efficient Handling of Adversary Attacks in Aggregation Applications.	ESORICS	2008	DBLP DOI BibTeX RDF
28	Yuriy Brun, Nenad Medvidovic	Fault and adversary tolerance as an emergent property of distributed systems' software architectures.	EFTS	2007	DBLP DOI BibTeX RDF
28	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
28	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
28	Jedrzej Kabarowski, Miroslaw Kutylowski, Wojciech Rutkowski	Adversary Immune Size Approximation of Single-Hop Radio Networks.	TAMC	2006	DBLP DOI BibTeX RDF
28	Ke Chen 0006	How to play a coloring game against a color-blind adversary.	SCG	2006	DBLP DOI BibTeX RDF	conflict-free coloring, online algorithm
28	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
28	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
28	Yonatan Aumann, Michael A. Bender	Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler.	ICALP	1996	DBLP DOI BibTeX RDF
28	Noga Alon, Zvi Galil, Moti Yung	Efficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary.	ESA	1995	DBLP DOI BibTeX RDF
26	Zbigniew Golebiewski, Marek Klonowski, Michal Koza, Miroslaw Kutylowski	Towards Fair Leader Election in Wireless Networks.	ADHOC-NOW	2009	DBLP DOI BibTeX RDF
26	Andrew McGregor 0001, Krzysztof Onak, Rina Panigrahy	The Oil Searching Problem.	ESA	2009	DBLP DOI BibTeX RDF
26	Prasant Gopal, Anuj Gupta 0001, Pranav K. Vasishta, Piyush Bansal, Kannan Srinathan	Brief announcement: global consistency can be easier than point-to-point communication.	PODC	2009	DBLP DOI BibTeX RDF	incomplete networks, authentication, agreement, reliable communication
26	Alexandra Boldyreva	Strengthening Security of RSA-OAEP.	CT-RSA	2009	DBLP DOI BibTeX RDF
26	Ivan Damgård, Serge Fehr, Carolin Lunemann, Louis Salvail, Christian Schaffner	Improving the Security of Quantum Protocols via Commit-and-Open.	CRYPTO	2009	DBLP DOI BibTeX RDF
26	Noa Agmon, Sarit Kraus, Gal A. Kaminka	Uncertainties in adversarial patrol.	AAMAS (2)	2009	DBLP BibTeX RDF	adversarial/game domains, formal models of multi-robot plans, multi-robotics
26	Ying Jian, Shigang Chen, Zhan Zhang, Liang Zhang	A novel scheme for protecting receiver's location privacy in wireless sensor networks.	IEEE Trans. Wirel. Commun.	2008	DBLP DOI BibTeX RDF
26	Roberto Di Pietro, Luigi V. Mancini, Claudio Soriente, Angelo Spognardi, Gene Tsudik	Catch Me (If You Can): Data Survival in Unattended Sensor Networks.	PerCom	2008	DBLP DOI BibTeX RDF	Data Survival, UWSN, WSN, Sensor Networks
26	Ronald Cramer, Yevgeniy Dodis, Serge Fehr, Carles Padró, Daniel Wichs	Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors.	EUROCRYPT	2008	DBLP DOI BibTeX RDF
26	Bhavana Kanukurthi, Leonid Reyzin	An Improved Robust Fuzzy Extractor.	SCN	2008	DBLP DOI BibTeX RDF