|
|
Venues (Conferences, Journals, ...)
|
|
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 |
121 | Ashish 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](Pics/bibsonomy.png) |
ICITS ![In: Information Theoretic Security, Third International Conference, ICITS 2008, Calgary, Canada, August 10-13, 2008, Proceedings, pp. 137-155, 2008, Springer, 978-3-540-85092-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACISP ![In: Information Security and Privacy, 13th Australasian Conference, ACISP 2008, Wollongong, Australia, July 7-9, 2008, Proceedings, pp. 170-186, 2008, Springer, 978-3-540-69971-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Information Theoretic Security, Mobile Adversary |
77 | Robert Spalek |
The Multiplicative Quantum Adversary. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 237-248, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography, 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009. Proceedings, pp. 274-293, 2009, Springer, 978-3-642-00456-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
61 | Gene Tsudik |
Confronting a mobile adversary in unattended sensor networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AsiaCCS ![In: Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, ASIACCS 2008, Tokyo, Japan, March 18-20, 2008, pp. 1, 2008, ACM, 978-1-59593-979-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
61 | Robert Spalek, Mario Szegedy |
All Quantum Adversary Methods Are Equivalent. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pp. 1299-1311, 2005, Springer, 3-540-27580-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
59 | Huawang Qin, Yuewei Dai, Zhiquan Wang |
A secret sharing scheme based on (t, n) threshold and adversary structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Inf. Sec. ![In: Int. J. Inf. Sec. 8(5), pp. 379-385, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 12th International Symposium, DISC '98, Andros, Greece, September 24-26, 1998, Proceedings, pp. 134-148, 1998, Springer, 3-540-65066-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
general adversary, Broadcast, fault detection, Byzantine agreement, multi- party computation |
56 | Amos Beimel, Matthew K. Franklin |
Edge Eavesdropping Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCN ![In: Security and Cryptography for Networks, 5th International Conference, SCN 2006, Maiori, Italy, September 6-8, 2006, Proceedings, pp. 1-17, 2006, Springer, 3-540-38080-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSE (2) ![In: Proceedings of the 12th IEEE International Conference on Computational Science and Engineering, CSE 2009, Vancouver, BC, Canada, August 29-31, 2009, pp. 659-664, 2009, IEEE Computer Society, 978-1-4244-5334-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
55 | Samuel N. Hamilton, Wendy L. Hamilton |
Adversary Modeling and Simulation in Cyber Warfare. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEC ![In: Proceedings of The IFIP TC-11 23rd International Information Security Conference, IFIP 20th World Computer Congress, IFIP SEC 2008, September 7-10, 2008, Milano, Italy, pp. 461-475, 2008, Springer, 978-0-387-09698-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
55 | H. Brendan McMahan, Avrim Blum |
Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 17th Annual Conference on Learning Theory, COLT 2004, Banff, Canada, July 1-4, 2004, Proceedings, pp. 109-123, 2004, Springer, 3-540-22282-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
53 | Hossein Ghodosi, Josef Pieprzyk |
Multi-Party Computation with Omnipresent Adversary. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Public Key Cryptography ![In: Public Key Cryptography - PKC 2009, 12th International Conference on Practice and Theory in Public Key Cryptography, Irvine, CA, USA, March 18-20, 2009. Proceedings, pp. 180-195, 2009, Springer, 978-3-642-00467-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 13th International Symposium, Bratislava, Slovak Republic, September 27-29, 1999, Proceedings, pp. 123-137, 1999, Springer, 3-540-66531-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, pp. 229-230, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 277-287, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
46 | Doran Chakraborty, Peter Stone |
Online Multiagent Learning against Memory Bounded Adversaries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECML/PKDD (1) ![In: Machine Learning and Knowledge Discovery in Databases, European Conference, ECML/PKDD 2008, Antwerp, Belgium, September 15-19, 2008, Proceedings, Part I, pp. 211-226, 2008, Springer, 978-3-540-87478-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
46 | Xinyi Huang 0001, Yi Mu 0001, Willy Susilo, Duncan S. Wong, Wei Wu 0001 |
Certificateless Signature Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACISP ![In: Information Security and Privacy, 12th Australasian Conference, ACISP 2007, Townsville, Australia, July 2-4, 2007, Proceedings, pp. 308-322, 2007, Springer, 978-3-540-73457-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Certificateless cryptology, Signature, Security model, Random oracle |
46 | Enoch Peserico |
The lazy adversary conjecture fails. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, Winnipeg, Manitoba, Canada, August 11-13, 2002, pp. 143-144, 2002, ACM, 1-58113-529-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, PODC 2002, Monterey, California, USA, July 21-24, 2002, pp. 193-202, 2002, ACM, 1-58113-485-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, Denver, CO, USA, July 23-26, 2006, pp. 285-291, 2006, ACM, 1-59593-384-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, pp. 420-429, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SP ![In: 30th IEEE Symposium on Security and Privacy (SP 2009), 17-20 May 2009, Oakland, California, USA, pp. 347-359, 2009, IEEE Computer Society, 978-0-7695-3633-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
42 | Andrew M. Childs, Troy Lee |
Optimal Quantum Adversary Lower Bounds for Ordered Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 869-880, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
42 | Vivek K. Singh 0001, Mohan S. Kankanhalli |
Towards Adversary Aware Surveillance Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICME ![In: Proceedings of the 2007 IEEE International Conference on Multimedia and Expo, ICME 2007, July 2-5, 2007, Beijing, China, pp. 2038-2041, 2007, IEEE Computer Society, 1-4244-1017-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CANS ![In: Cryptology and Network Security, 6th International Conference, CANS 2007, Singapore, December 8-10, 2007, Proceedings, pp. 80-101, 2007, Springer, 978-3-540-76968-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2008, 14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, Australia, December 7-11, 2008. Proceedings, pp. 1-18, 2008, Springer, 978-3-540-89254-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
40 | Yvo Desmedt, Yongge Wang, Mike Burmester |
Revisiting Colored Networks and Privacy Preserving Censorship. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRITIS ![In: Critical Information Infrastructures Security, First International Workshop, CRITIS 2006, Samos, Greece, August 31 - September 1, 2006, Revised Papers, pp. 140-150, 2006, Springer, 3-540-69083-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
40 | Christian Scheideler |
How to spread adversarial nodes?: rotate! ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 704-713, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FASec ![In: Formal Aspects of Security, First International Conference, FASec 2002, London, UK, December 16-18, 2002, Revised Papers, pp. 115-132, 2002, Springer, 3-540-20693-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
40 | Michiel Blom, Sven Oliver Krumke, Willem de Paepe, Leen Stougie |
The Online-TSP against Fair Adversaries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 4th Italian Conference, CIAC 2000, Rome, Italy, March 2000, Proceedings, pp. 137-149, 2000, Springer, 3-540-67159-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
40 | Ran El-Yaniv, Ron Kaniel, Nathan Linial |
Competitive Optimal On-Line Leasing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 25(1), pp. 116-140, 1999. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AsiaCCS ![In: Proceedings of the 2009 ACM Symposium on Information, Computer and Communications Security, ASIACCS 2009, Sydney, Australia, March 10-12, 2009, pp. 171-182, 2009, ACM, 978-1-60558-394-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AsiaCCS ![In: Proceedings of the 2007 ACM Symposium on Information, Computer and Communications Security, ASIACCS 2007, Singapore, March 20-22, 2007, pp. 183-193, 2007, ACM, 1-59593-574-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 526-535, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CANS ![In: Cryptology and Network Security, 7th International Conference, CANS 2008, Hong-Kong, China, December 2-4, 2008. Proceedings, pp. 214-225, 2008, Springer, 978-3-540-89640-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA, pp. 11-20, 2005, ACM, 1-58113-986-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009. Proceedings, pp. 8-21, 2009, Springer, 978-3-642-04354-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
35 | Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann |
The disagreement power of an adversary: extended abstract. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, pp. 288-289, 2009, ACM, 978-1-60558-396-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoNEXT ![In: Proceedings of the 2008 ACM Conference on Emerging Network Experiment and Technology, CoNEXT 2008, Madrid, Spain, December 9-12, 2008, pp. 24, 2008, ACM, 978-1-60558-210-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUC (2) ![In: 2008 IEEE/IPIP International Conference on Embedded and Ubiquitous Computing (EUC 2008), Shanghai, China, December 17-20, 2008, Volume II: Workshops, pp. 257-263, 2008, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
35 | Virgil D. Gligor |
On the evolution of adversary models in security protocols: from the beginning to sensor networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AsiaCCS ![In: Proceedings of the 2007 ACM Symposium on Information, Computer and Communications Security, ASIACCS 2007, Singapore, March 20-22, 2007, pp. 3, 2007, ACM, 1-59593-574-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, pp. 496-498, 2007, Springer, 978-3-540-75141-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
35 | Alexander Russell, Hong Wang 0002 |
How to fool an unbounded adversary with a short key. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(3), pp. 1130-1140, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
35 | Varsha Dani, Thomas P. Hayes |
Robbing the bandit: less regret in online geometric optimization against an adaptive adversary. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 937-943, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
35 | Enoch Peserico |
The Lazy Adversary Conjecture Fails. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 37(3), pp. 397-403, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
35 | Miroslaw Kutylowski, Wojciech Rutkowski |
Adversary Immune Leader Election in ad hoc Radio Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings, pp. 397-408, 2003, Springer, 3-540-20064-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACNS ![In: Applied Cryptography and Network Security, First International Conference, ACNS 2003. Kunming, China, October 16-19, 2003, Proceedings, pp. 1-15, 2003, Springer, 3-540-20208-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
35 | Peter Ruzicka, Juraj Wiedermann |
How Good Is the Adversary Lower Bound? ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1977, 6th Symposium, Tatranska Lomnica, Czechoslovakia, September 5-9, 1977, Proceedings, pp. 465-474, 1977, Springer, 0-387-08353-7. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
|
33 | Maurice Herlihy, Sergio Rajsbaum |
The topology of shared-memory adversaries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, pp. 105-113, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Wirel. Commun. ![In: IEEE Trans. Wirel. Commun. 8(3), pp. 1218-1222, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PRDC ![In: 14th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2008, 15-17 December 2008, Taipei, Taiwan, pp. 64-72, 2008, IEEE Computer Society, 978-0-7695-3448-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Matthew Andrews, Lisa Zhang |
Routing and scheduling in multihop wireless networks with time-varying channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(3), pp. 33, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACISP ![In: Information Security and Privacy, 12th Australasian Conference, ACISP 2007, Townsville, Australia, July 2-4, 2007, Proceedings, pp. 461-473, 2007, Springer, 978-3-540-73457-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Perfectly Secure Communication, Proactive security |
33 | Ari Juels, Dario Catalano, Markus Jakobsson |
Coercion-resistant electronic elections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WPES ![In: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society, WPES 2005, Alexandria, VA, USA, November 7, 2005, pp. 61-70, 2005, ACM, 1-59593-228-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SASN ![In: Proceedings of the 3rd ACM Workshop on Security of ad hoc and Sensor Networks, SASN 2005, Alexandria, VA, USA, November 7, 2005, pp. 22-31, 2005, ACM, 1-59593-227-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 1031-1040, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
33 | Ventzislav Nikov, Svetla Nikova |
On Proactive Secret Sharing Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Selected Areas in Cryptography ![In: Selected Areas in Cryptography, 11th International Workshop, SAC 2004, Waterloo, Canada, August 9-10, 2004, Revised Selected Papers, pp. 308-325, 2004, Springer, 3-540-24327-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Nilesh N. Dalvi, Pedro M. Domingos, Mausam, Sumit K. Sanghai, Deepak Verma |
Adversarial classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, Washington, USA, August 22-25, 2004, pp. 99-108, 2004, ACM, 1-58113-888-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WISA ![In: Information Security Applications, 5th International Workshop, WISA 2004, Jeju Island, Korea, August 23-25, 2004, Revised Selected Papers, pp. 400-410, 2004, Springer, 3-540-24015-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Bogdan S. Chlebus, Mariusz A. Rokicki |
Asynchronous Broadcast in Radio Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity, 11th International Colloquium , SIROCCO 2004, Smolenice Castle, Slovakia, June 21-23, 2004, Proceedings, pp. 57-68, 2004, Springer, 3-540-22230-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 16th International Conference, DISC 2002, Toulouse, France, October 28-30, 2002 Proceedings, pp. 295-310, 2002, Springer, 3-540-00073-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
33 | Stefan Dziembowski, Ueli M. Maurer |
Tight security proofs for the bounded-storage model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 341-350, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CT-RSA ![In: Topics in Cryptology - CT-RSA 2001, The Cryptographer's Track at RSA Conference 2001, San Francisco, CA, USA, April 8-12, 2001, Proceedings, pp. 208-222, 2001, Springer, 3-540-41898-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
33 | Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz |
PAC Learning with Nasty Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 10th International Conference, ALT '99, Tokyo, Japan, December 6-8, 1999, Proceedings, pp. 206-218, 1999, Springer, 3-540-66748-2. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
QEST ![In: Eighth International Conference on Quantitative Evaluation of Systems, QEST 2011, Aachen, Germany, 5-8 September, 2011, pp. 191-200, 2011, IEEE Computer Society, 978-1-4577-0973-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 544-551, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WISEC ![In: Proceedings of the Second ACM Conference on Wireless Network Security, WISEC 2009, Zurich, Switzerland, March 16-19, 2009, pp. 237-244, 2009, ACM, 978-1-60558-460-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CANS ![In: Cryptology and Network Security, 7th International Conference, CANS 2008, Hong-Kong, China, December 2-4, 2008. Proceedings, pp. 162-177, 2008, Springer, 978-3-540-89640-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 18(6), pp. 435-451, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SASN ![In: Proceedings of the 4th ACM Workshop on Security of ad hoc and Sensor Networks, SASN 2006, Alexandria, VA, USA, October 30, 2006, pp. 49-58, 2006, ACM, 1-59593-554-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: Principles of Distributed Systems, 9th International Conference, OPODIS 2005, Pisa, Italy, December 12-14, 2005, Revised Selected Papers, pp. 47-60, 2005, Springer, 3-540-36321-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCN ![In: Security in Communication Networks, Third International Conference, SCN 2002, Amalfi, Italy, September 11-13, 2002. Revised Papers, pp. 14-28, 2002, Springer, 3-540-00420-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, Winnipeg, Manitoba, Canada, August 11-13, 2002, pp. 220-229, 2002, ACM, 1-58113-529-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, PODC 2001, Newport, Rhode Island, USA, August 26-29, 2001, pp. 117-127, 2001, ACM, 1-58113-383-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings, pp. 221-231, 2000, Springer, 3-540-67787-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACISP ![In: Information Security and Privacy, 14th Australasian Conference, ACISP 2009, Brisbane, Australia, July 1-3, 2009, Proceedings, pp. 264-275, 2009, Springer, 978-3-642-02619-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, pp. 304-305, 2009, ACM, 978-1-60558-396-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(2), pp. 749-762, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Marco Benedetti, Arnaud Lallouet, Jérémie Vautard |
Modeling adversary scheduling with QCSP+. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), Fortaleza, Ceara, Brazil, March 16-20, 2008, pp. 151-155, 2008, ACM, 978-1-59593-753-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Gelareh Taban, Virgil D. Gligor |
Efficient Handling of Adversary Attacks in Aggregation Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESORICS ![In: Computer Security - ESORICS 2008, 13th European Symposium on Research in Computer Security, Málaga, Spain, October 6-8, 2008. Proceedings, pp. 66-81, 2008, Springer, 978-3-540-88312-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Yuriy Brun, Nenad Medvidovic |
Fault and adversary tolerance as an emergent property of distributed systems' software architectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EFTS ![In: Proceedings of the 2007 Workshop on Engineering Fault Tolerant Systems, EFTS 2007, Dubrovnik, Croatia, September 4, 2007, pp. 7, 2007, ACM, 978-1-59593-725-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CISS ![In: Proceedings of the 41st Annual Conference on Information Sciences and Systems, CISS 2007, 14-16 March 2007, Johns Hopkins University, Department of Electrical Engineering, Baltimore, MD, USA, pp. 911-916, 2007, IEEE, 1-4244-1037-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Joseph Pamula, Sushil Jajodia, Paul Ammann, Vipin Swarup |
A weakest-adversary security metric for network configuration security analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
QoP ![In: Proceedings of the 2nd ACM Workshop on Quality of Protection, QoP 2006, Alexandria, VA, USA, October 30, 2006, pp. 31-38, 2006, ACM, 1-59593-553-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings, pp. 148-158, 2006, Springer, 3-540-34021-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Ke Chen 0006 |
How to play a coloring game against a color-blind adversary. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, USA, June 5-7, 2006, pp. 44-51, 2006, ACM, 1-59593-340-9. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Security Protocols Workshop ![In: Security Protocols, 13th International Workshop, Cambridge, UK, April 20-22, 2005, Revised Selected Papers, pp. 276-283, 2005, Springer, 978-3-540-77155-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '99, International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May 2-6, 1999, Proceeding, pp. 311-326, 1999, Springer, 3-540-65889-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
28 | Yonatan Aumann, Michael A. Bender |
Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings, pp. 622-633, 1996, Springer, 3-540-61440-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
28 | Noga Alon, Zvi Galil, Moti Yung |
Efficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '95, Third Annual European Symposium, Corfu, Greece, September 25-27, 1995, Proceedings, pp. 523-537, 1995, Springer, 3-540-60313-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
26 | Zbigniew Golebiewski, Marek Klonowski, Michal Koza, Miroslaw Kutylowski |
Towards Fair Leader Election in Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADHOC-NOW ![In: Ad-Hoc, Mobile and Wireless Networks, 8th International Conference, ADHOC-NOW 2009, Murcia, Spain, September 22-25, 2009, Proceedings, pp. 166-179, 2009, Springer, 978-3-642-04382-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
26 | Andrew McGregor 0001, Krzysztof Onak, Rina Panigrahy |
The Oil Searching Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, pp. 504-515, 2009, Springer, 978-3-642-04127-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, pp. 310-311, 2009, ACM, 978-1-60558-396-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
incomplete networks, authentication, agreement, reliable communication |
26 | Alexandra Boldyreva |
Strengthening Security of RSA-OAEP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CT-RSA ![In: Topics in Cryptology - CT-RSA 2009, The Cryptographers' Track at the RSA Conference 2009, San Francisco, CA, USA, April 20-24, 2009. Proceedings, pp. 399-413, 2009, Springer, 978-3-642-00861-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO 2009, 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2009. Proceedings, pp. 408-427, 2009, Springer, 978-3-642-03355-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
26 | Noa Agmon, Sarit Kraus, Gal A. Kaminka |
Uncertainties in adversarial patrol. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS (2) ![In: 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), Budapest, Hungary, May 10-15, 2009, Volume 2, pp. 1267-1268, 2009, IFAAMAS, 978-0-9817381-7-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Wirel. Commun. ![In: IEEE Trans. Wirel. Commun. 7(10), pp. 3769-3779, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PerCom ![In: Sixth Annual IEEE International Conference on Pervasive Computing and Communications (PerCom 2008), 17-21 March 2008, Hong Kong, pp. 185-194, 2008, IEEE Computer Society, 978-0-7695-3113-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT 2008, 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, April 13-17, 2008. Proceedings, pp. 471-488, 2008, Springer, 978-3-540-78966-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Bhavana Kanukurthi, Leonid Reyzin |
An Improved Robust Fuzzy Extractor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCN ![In: Security and Cryptography for Networks, 6th International Conference, SCN 2008, Amalfi, Italy, September 10-12, 2008. Proceedings, pp. 156-171, 2008, Springer, 978-3-540-85854-6. The full citation details ...](Pics/full.jpeg) |
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][ >>] |
|