The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for adversary with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1977-1989 (16) 1990-1992 (19) 1993-1995 (18) 1996-1997 (27) 1998 (23) 1999 (25) 2000 (44) 2001 (56) 2002 (67) 2003 (102) 2004 (121) 2005 (178) 2006 (206) 2007 (220) 2008 (238) 2009 (208) 2010 (50) 2011 (28) 2012 (24) 2013 (37) 2014 (30) 2015 (34) 2016 (42) 2017 (40) 2018 (59) 2019 (61) 2020 (87) 2021 (73) 2022 (77) 2023 (73) 2024 (21)
Publication types (Num. hits)
article(566) incollection(4) inproceedings(1720) phdthesis(13) proceedings(1)
Venues (Conferences, Journals, ...)
CoRR(170) CRYPTO(81) EUROCRYPT(62) PODC(52) TCC(41) STOC(38) IACR Cryptol. ePrint Arch.(37) DISC(31) ASIACRYPT(30) FOCS(28) CCS(25) AsiaCCS(23) SODA(23) ACNS(21) INDOCRYPT(20) ACISP(18) More (+10 of total 682)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1835 occurrences of 870 keywords

Results
Found 2304 publication records. Showing 2304 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
121Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, K. Srinathan, C. Pandu Rangan Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary. Search on Bibsonomy ICITS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
93Arpita Patra, Ashish Choudhary, Madhu Vaidyanathan, C. Pandu Rangan Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary. Search on Bibsonomy ACISP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Information Theoretic Security, Mobile Adversary
77Robert Spalek The Multiplicative Quantum Adversary. Search on Bibsonomy CCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF quantum query lower bounds, quantum adversary method, multiplicative adversary, combinatorial matrices, direct product theorems
66Vassilis Zikas, Sarah Hauser, Ueli M. Maurer Realistic Failures in Secure Multi-party Computation. Search on Bibsonomy TCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
61Gene Tsudik Confronting a mobile adversary in unattended sensor networks. Search on Bibsonomy AsiaCCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
61Robert Spalek, Mario Szegedy All Quantum Adversary Methods Are Equivalent. Search on Bibsonomy ICALP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
59Huawang Qin, Yuewei Dai, Zhiquan Wang A secret sharing scheme based on (t, n) threshold and adversary structure. Search on Bibsonomy Int. J. Inf. Sec. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Adversary structure, Cryptography, Information security, Secret sharing, Threshold
58Matthias Fitzi, Ueli M. Maurer Efficient Byzantine Agreement Secure Against General Adversaries. Search on Bibsonomy DISC The full citation details ... 1998 DBLP  DOI  BibTeX  RDF general adversary, Broadcast, fault detection, Byzantine agreement, multi- party computation
56Amos Beimel, Matthew K. Franklin Edge Eavesdropping Games. Search on Bibsonomy SCN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF graph search games, unconditional security, passive adversary, mobile adversary
55Marek Klonowski, Michal Przykucki, Tomasz Struminski Data Deletion with Time-Aware Adversary Model. Search on Bibsonomy CSE (2) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
55Samuel N. Hamilton, Wendy L. Hamilton Adversary Modeling and Simulation in Cyber Warfare. Search on Bibsonomy SEC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
55H. Brendan McMahan, Avrim Blum Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary. Search on Bibsonomy COLT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
53Hossein Ghodosi, Josef Pieprzyk Multi-Party Computation with Omnipresent Adversary. Search on Bibsonomy Public Key Cryptography The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Omnipresent Adversary, Proactive Secret Sharing, t-resilient Protocols, t-private Protocols, Multi-Party Computation
51Bernd Altmann, Matthias Fitzi, Ueli M. Maurer Byzantine Agreement Secure against General Adversaries in the Dual Failure Model. Search on Bibsonomy DISC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF active adversary, fail-corruption, Broadcast, Byzantine agreement, unconditional security
48Lasse Kliemann Brief announcement: the price of anarchy for distributed network formation in an adversary model. Search on Bibsonomy PODC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF pairwise nash equilibrium, pairwise stability, game theory, nash equilibrium, price of anarchy, network formation
48Yvo Desmedt, Yongge Wang, Mike Burmester A Complete Characterization of Tolerable Adversary Structures for Secure Point-to-Point Transmissions Without Feedback. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
46Doran Chakraborty, Peter Stone Online Multiagent Learning against Memory Bounded Adversaries. Search on Bibsonomy ECML/PKDD (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
46Xinyi Huang 0001, Yi Mu 0001, Willy Susilo, Duncan S. Wong, Wei Wu 0001 Certificateless Signature Revisited. Search on Bibsonomy ACISP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Certificateless cryptology, Signature, Security model, Random oracle
46Enoch Peserico The lazy adversary conjecture fails. Search on Bibsonomy SPAA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF k-server, lazy adversary, memoryless, competitive analysis
44M. V. N. Ashwin Kumar, Pranava R. Goundan, K. Srinathan, C. Pandu Rangan On perfectly secure cmmunication over arbitrary networks. Search on Bibsonomy PODC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF adversary structures, secure communication, information-theoretic security, secure multiparty computation
42Dan Holtby, Bruce M. Kapron, Valerie King Lower bound for scalable Byzantine Agreement. Search on Bibsonomy PODC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF malicious adversary, non-adaptive adversary, scalable, distributed computing, lower bounds, randomized, Byzantine Agreement, probabilistic
42Valerie King, Jared Saia Breaking the O(n2) bit barrier: scalable byzantine agreement with an adaptive adversary. Search on Bibsonomy PODC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF samplers, peer-to-peer, distributed computing, consensus, secret-sharing, byzantine agreement, monte carlo algorithms
42Shuo Chen, Ziqing Mao, Yi-Min Wang, Ming Zhang Pretty-Bad-Proxy: An Overlooked Adversary in Browsers' HTTPS Deployments. Search on Bibsonomy SP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
42Andrew M. Childs, Troy Lee Optimal Quantum Adversary Lower Bounds for Ordered Search. Search on Bibsonomy ICALP (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
42Vivek K. Singh 0001, Mohan S. Kankanhalli Towards Adversary Aware Surveillance Systems. Search on Bibsonomy ICME The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
42Arpita Patra, Bhavani Shankar, Ashish Choudhary, K. Srinathan, C. Pandu Rangan Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary. Search on Bibsonomy CANS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Reliable and Secure Communication, Information Theoretic Security, Directed Networks, Communication Efficiency
40Martin Hirt, Ueli M. Maurer, Vassilis Zikas MPC vs. SFE : Unconditional and Computational Security. Search on Bibsonomy ASIACRYPT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
40Yvo Desmedt, Yongge Wang, Mike Burmester Revisiting Colored Networks and Privacy Preserving Censorship. Search on Bibsonomy CRITIS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
40Christian Scheideler How to spread adversarial nodes?: rotate! Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF join-leave attacks, random mixing, proactive security
40Joseph Y. Halpern, Riccardo Pucella Modeling Adversaries in a Logic for Security Protocol Analysis. Search on Bibsonomy FASec The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
40Michiel Blom, Sven Oliver Krumke, Willem de Paepe, Leen Stougie The Online-TSP against Fair Adversaries. Search on Bibsonomy CIAC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
40Ran El-Yaniv, Ron Kaniel, Nathan Linial Competitive Optimal On-Line Leasing. Search on Bibsonomy Algorithmica The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Lease-or-buy problem, Equipment rental, Ski rental, Competitive analysis, On-line algorithms, Leasing
40Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary. Search on Bibsonomy AsiaCCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF mixed adversary, information theoretic security, error probability
38Dongvu Tonien, Reihaneh Safavi-Naini, Peter R. Wild Combinatorial characterizations of authentication codes in verification oracle model. Search on Bibsonomy AsiaCCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF active adversary model, combinatorial bounds, unconditional security, authentication codes
38Peter Høyer, Troy Lee, Robert Spalek Negative weights make adversaries stronger. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF adversary method, certificate complexity barrier, formula size, quantum query complexity, lower bounds, quantum computing
36Huafei Zhu Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols. Search on Bibsonomy CANS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Black-box constructions, defensible adversary, malicious adversary, oblivious transfer protocols
36Hagit Attiya, David Hay Randomization does not reduce the average delay in parallel packet switches. Search on Bibsonomy SPAA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF oblivious adversary, load balancing, packet switching, randomization, clos networks, queuing delay, inverse multiplexing, adaptive adversary
35Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann The Disagreement Power of an Adversary. Search on Bibsonomy DISC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
35Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann The disagreement power of an adversary: extended abstract. Search on Bibsonomy PODC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF fault-tolerance, failure-detectors, adversaries
35Xin Zhang 0003, Abhishek Jain 0002, Adrian Perrig Packet-dropping adversary identification for data plane security. Search on Bibsonomy CoNEXT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
35Minh-Triet Tran, Trung Thanh Nguyen 0005, Isao Echizen Pool-Based APROB Channel to Provide Resistance against Global Active Adversary under Probabilistic Real-Time Condition. Search on Bibsonomy EUC (2) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
35Virgil D. Gligor On the evolution of adversary models in security protocols: from the beginning to sensor networks. Search on Bibsonomy AsiaCCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
35Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary. Search on Bibsonomy DISC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
35Alexander Russell, Hong Wang 0002 How to fool an unbounded adversary with a short key. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
35Varsha Dani, Thomas P. Hayes Robbing the bandit: less regret in online geometric optimization against an adaptive adversary. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
35Enoch Peserico The Lazy Adversary Conjecture Fails. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
35Miroslaw Kutylowski, Wojciech Rutkowski Adversary Immune Leader Election in ad hoc Radio Networks. Search on Bibsonomy ESA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
35Ventzislav Nikov, Svetla Nikova, Bart Preneel Multi-party Computation from Any Linear Secret Sharing Scheme Unconditionally Secure against Adaptive Adversary: The Zero-Error Case. Search on Bibsonomy ACNS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
35Peter Ruzicka, Juraj Wiedermann How Good Is the Adversary Lower Bound? Search on Bibsonomy MFCS The full citation details ... 1977 DBLP  DOI  BibTeX  RDF
33Maurice Herlihy, Sergio Rajsbaum The topology of shared-memory adversaries. Search on Bibsonomy PODC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF fault-tolerance, shared-memory, set agreement, combinatorial topology
33Shi-Chun Tsai, Wen-Guey Tzeng, Kun-Yi Zhou Key establishment schemes against storage-bounded adversaries in wireless sensor networks. Search on Bibsonomy IEEE Trans. Wirel. Commun. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
33Roberto Baldoni, Marco Platania, Leonardo Querzoni, Sirio Scipioni A Peer-to-Peer Filter-Based Algorithm for Internal Clock Synchronization in Presence of Corrupted Processes. Search on Bibsonomy PRDC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
33Matthew Andrews, Lisa Zhang Routing and scheduling in multihop wireless networks with time-varying channels. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Scheduling, routing, wireless network, stability, time-varying
33Kannan Srinathan, Prasad Raghavendra, C. Pandu Rangan On Proactive Perfectly Secure Message Transmission. Search on Bibsonomy ACISP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Perfectly Secure Communication, Proactive security
33Ari Juels, Dario Catalano, Markus Jakobsson Coercion-resistant electronic elections. Search on Bibsonomy WPES The full citation details ... 2005 DBLP  DOI  BibTeX  RDF electronic voting, mix networks, receipt-freeness, coercion-resistance
33Shouhuai Xu On the security of group communication schemes based on symmetric key cryptosystems. Search on Bibsonomy SASN The full citation details ... 2005 DBLP  DOI  BibTeX  RDF backward-security, security, key management, group communication, broadcast encryption, forward-security
33Matthew Andrews, Lisa Zhang Routing and scheduling in multihop wireless networks with time-varying channels. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  BibTeX  RDF
33Ventzislav Nikov, Svetla Nikova On Proactive Secret Sharing Schemes. Search on Bibsonomy Selected Areas in Cryptography The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
33Nilesh N. Dalvi, Pedro M. Domingos, Mausam, Sumit K. Sanghai, Deepak Verma Adversarial classification. Search on Bibsonomy KDD The full citation details ... 2004 DBLP  DOI  BibTeX  RDF game theory, integer linear programming, naive Bayes, cost-sensitive learning, spam detection
33Marcin Gomulkiewicz, Marek Klonowski, Miroslaw Kutylowski Onions Based on Universal Re-encryption - Anonymous Communication Immune Against Repetitive Attack. Search on Bibsonomy WISA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
33Bogdan S. Chlebus, Mariusz A. Rokicki Asynchronous Broadcast in Radio Networks. Search on Bibsonomy SIROCCO The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
33Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Alexander A. Shvartsman Bounding Work and Communication in Robust Cooperative Computation. Search on Bibsonomy DISC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
33Stefan Dziembowski, Ueli M. Maurer Tight security proofs for the bounded-storage model. Search on Bibsonomy STOC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
33Marc Joye, Jean-Jacques Quisquater, Moti Yung On the Power of Misbehaving Adversaries and Security Analysis of the Original EPOC. Search on Bibsonomy CT-RSA The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
33Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz PAC Learning with Nasty Noise. Search on Bibsonomy ALT The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
33Elizabeth LeMay, Michael D. Ford, Ken Keefe, William H. Sanders, Carol Muehrcke Model-based Security Metrics Using ADversary VIew Security Evaluation (ADVISE). Search on Bibsonomy QEST The full citation details ... 2011 DBLP  DOI  BibTeX  RDF Quantitative Security Metrics, State-based Security Model, Adversary Attack Decisions
33Ben Reichardt Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function. Search on Bibsonomy FOCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF span program, quantum query algorithm, adversary bound, formula evaluation, semi-definite program, quantum walk
31Roberto Di Pietro, Claudio Soriente, Angelo Spognardi, Gene Tsudik Collaborative authentication in unattended WSNs. Search on Bibsonomy WISEC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF wireless sensor networks, authentication, mobile adversary
31Youming Qiao, Christophe Tartary Counting Method for Multi-party Computation over Non-abelian Groups. Search on Bibsonomy CANS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Neighbor-Avoiding Walk, Random Walk, Graph Coloring, Multiparty Computation, Non-Abelian Groups, Passive Adversary
31Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas Performing work in broadcast networks. Search on Bibsonomy Distributed Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Fail-stop failure, Distributed algorithm, Multiple-access channel, Adversary, Independent tasks
31Gergely Ács, Levente Buttyán, István Vajda Modelling adversaries and security objectives for routing protocols in wireless sensor networks. Search on Bibsonomy SASN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF sensor networks, routing protocols, provable security, simulatability, adversary model
31Ling Cheung Randomized Wait-Free Consensus Using an Atomicity Assumption. Search on Bibsonomy OPODIS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Asynchronous Consensus, Wait-Free Termination, Weak Adversary, Randomized Algorithms, Probabilistic Model Checking
31Ueli M. Maurer Secure Multi-party Computation Made Simple. Search on Bibsonomy SCN The full citation details ... 2002 DBLP  DOI  BibTeX  RDF adversary structures, secret-sharing, Secure multi-party computation, verifiable secret-sharing
31Bogdan S. Chlebus, Dariusz R. Kowalski Gossiping to reach consensus. Search on Bibsonomy SPAA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF distributed algorithm, lower bound, consensus, gossiping, processor failures, adaptive adversary
31Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas The do-all problem in broadcast networks. Search on Bibsonomy PODC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF fail-stop failures, distributed algorithm, lower bound, multiple-access channel, adversary, independent tasks
31Eric Bach 0001, Joan Boyar, Tao Jiang 0001, Kim S. Larsen, Guo-Hui Lin Better Bounds on the Accommodating Ratio for the Seat Reservation Problem. Search on Bibsonomy COCOON The full citation details ... 2000 DBLP  DOI  BibTeX  RDF the seat reservation problem, accommodating ratio, adversary argument, on-line algorithms
28Ahto Buldas, Aivo Jürgenson, Margus Niitsoo Efficiency Bounds for Adversary Constructions in Black-Box Reductions. Search on Bibsonomy ACISP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
28Valerie King, Jared Saia Brief announcement: fast scalable Byzantine agreement in the full information model with a nonadaptive adversary. Search on Bibsonomy PODC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF asychrony, communication complexity, gossiping, leader election, byzantine agreement, message complexity, synchrony
28Robert T. König, Barbara M. Terhal The Bounded-Storage Model in the Presence of a Quantum Adversary. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
28Marco Benedetti, Arnaud Lallouet, Jérémie Vautard Modeling adversary scheduling with QCSP+. Search on Bibsonomy SAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
28Gelareh Taban, Virgil D. Gligor Efficient Handling of Adversary Attacks in Aggregation Applications. Search on Bibsonomy ESORICS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
28Yuriy Brun, Nenad Medvidovic Fault and adversary tolerance as an emergent property of distributed systems' software architectures. Search on Bibsonomy EFTS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
28Alvaro A. Cárdenas, George V. Moustakides, John S. Baras Towards Optimal Design of Data Hiding Algorithms Against Nonparametric Adversary Models. Search on Bibsonomy CISS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
28Joseph Pamula, Sushil Jajodia, Paul Ammann, Vipin Swarup A weakest-adversary security metric for network configuration security analysis. Search on Bibsonomy QoP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF network security, vulnerability, security metric, attack graphs, exploit, quantitative measure
28Jedrzej Kabarowski, Miroslaw Kutylowski, Wojciech Rutkowski Adversary Immune Size Approximation of Single-Hop Radio Networks. Search on Bibsonomy TAMC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
28Ke Chen 0006 How to play a coloring game against a color-blind adversary. Search on Bibsonomy SCG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF conflict-free coloring, online algorithm
28Virgil D. Gligor On the Evolution of Adversary Models in Security Protocols (or Know Your Friend and Foe Alike). Search on Bibsonomy Security Protocols Workshop The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
28Ronald Cramer, Ivan Damgård, Stefan Dziembowski, Martin Hirt, Tal Rabin Efficient Multiparty Computations Secure Against an Adaptive Adversary. Search on Bibsonomy EUROCRYPT The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
28Yonatan Aumann, Michael A. Bender Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler. Search on Bibsonomy ICALP The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
28Noga Alon, Zvi Galil, Moti Yung Efficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary. Search on Bibsonomy ESA The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
26Zbigniew Golebiewski, Marek Klonowski, Michal Koza, Miroslaw Kutylowski Towards Fair Leader Election in Wireless Networks. Search on Bibsonomy ADHOC-NOW The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
26Andrew McGregor 0001, Krzysztof Onak, Rina Panigrahy The Oil Searching Problem. Search on Bibsonomy ESA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
26Prasant Gopal, Anuj Gupta 0001, Pranav K. Vasishta, Piyush Bansal, Kannan Srinathan Brief announcement: global consistency can be easier than point-to-point communication. Search on Bibsonomy PODC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF incomplete networks, authentication, agreement, reliable communication
26Alexandra Boldyreva Strengthening Security of RSA-OAEP. Search on Bibsonomy CT-RSA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
26Ivan Damgård, Serge Fehr, Carolin Lunemann, Louis Salvail, Christian Schaffner Improving the Security of Quantum Protocols via Commit-and-Open. Search on Bibsonomy CRYPTO The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
26Noa Agmon, Sarit Kraus, Gal A. Kaminka Uncertainties in adversarial patrol. Search on Bibsonomy AAMAS (2) The full citation details ... 2009 DBLP  BibTeX  RDF adversarial/game domains, formal models of multi-robot plans, multi-robotics
26Ying Jian, Shigang Chen, Zhan Zhang, Liang Zhang A novel scheme for protecting receiver's location privacy in wireless sensor networks. Search on Bibsonomy IEEE Trans. Wirel. Commun. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
26Roberto Di Pietro, Luigi V. Mancini, Claudio Soriente, Angelo Spognardi, Gene Tsudik Catch Me (If You Can): Data Survival in Unattended Sensor Networks. Search on Bibsonomy PerCom The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Data Survival, UWSN, WSN, Sensor Networks
26Ronald Cramer, Yevgeniy Dodis, Serge Fehr, Carles Padró, Daniel Wichs Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors. Search on Bibsonomy EUROCRYPT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
26Bhavana Kanukurthi, Leonid Reyzin An Improved Robust Fuzzy Extractor. Search on Bibsonomy SCN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 2304 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license