Tackling adaptive corruptions in multicast encryption protocols

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4392 LNCS, Issue , 2007, Pages 21-40

  Panjwani, Saurabh ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Adaptive corruptions; Encryption; Multicast; Selective decryption

Indexed keywords

NETWORK PROTOCOLS; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

ADAPTIVE CORRUPTIONS; LOGICAL KEY HIERARCHY (LKH) PROTOCOL; QUASI-POLYNOMIAL; SELECTIVE DECRYPTION;

THEOREM PROVING;

EID: 38049040237     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70936-7_2     Document Type: Conference Paper

References (17)

1. Martin Abadi and Philip Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). Journal of Cryptology, 15(2):103-127, 2002.
2. Martin Abadi and Bogdan Warinschi. Security analysis of cryptographically controlled access to xml documents. In Proceedings of the 24th ACM Symposium on Principles of Database Systems (PODS), pages 108-117, Baltimore, Maryland, June 2005. ACM.
3. Donald Beaver and Stuart Haber. Cryptographic protocols provably secure against dynamic adversaries. In Rainer A. Rueppel, editor, Advances in Cryptology -EUROCRYPT'92, volume 658 of Lecture Notes in Computer Science, pages 307-323. Springer-Verlag, May 1992.
4. Mihir Bellare, Anand Desai, Eric Jokipii, and Phillip Rogaway. A concrete security treatment of symmetric encryption. In 38th Annual Symposium on Foundations of Computer Science, pages 394-403. IEEE Computer Society Press, October 1997.
5. Ran Canetti, Uriel Feige, Oded Goldreich, and Moni Naor. Adaptively secure multiparty computation. In 28th Annual ACM Symposium on Theory of Computing, pages 639-648. ACM Press, May 1996.
6. Ran Canetti and Jonathan Herzog. Universally composable symbolic analysis of mutual authentication and key exchange protocols. In Shai Halevi and Tal Rabin, editors, TCC '06: Third Theory of Cryptography Conference, volume 3876 of Lecture Notes in Computer Science, pages 380-403. Springer-Verlag, 2006.
7. Anupam Datta, Ante Derek, John Mitchell, and Bogdan Warinschi. Computationally sound compositional logic for key exchange protocols. In 19th IEEE Computer Security Foundations Workshop (CSFW '06), pages 321-334. IEEE Computer Society, 2006.
8. Cynthia Dwork, Moni Naor, Omer Reingold, and Larry Stockmeyer. Magic functions. Journal of the ACM, 50(6):852-921, 2003.
9. Amos Fiat and Moni Naor. Broadcast encryption. In Douglas R. Stinson, editor, Advances in Cryptology - CRYPTO'93, volume 773 of Lecture Notes in Computer Science, pages 480-491. Springer-Verlag, August 1993.
10. Prateek Gupta and Vitaly Shmatikov. Key confirmation and adaptive corruptions in the protocol security logic. In FCS-ARSPA 2006 (Joint Workshop on Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis), 2006.
11. Daniele Micciancio and Saurabh Panjwani. Adaptive security of symbolic encryption. In J. Kilian, editor, Theory of Cryptography Conference, TCC 2005, volume 3378 of Lecture Notes in Computer Science, pages 169-187, Cambridge, MA, USA, February 2005. Springer-Verlag, Berlin, Germany.
12. Daniele Micciancio and Saurabh Panjwani. Corrupting one vs. corrupting many: The case of broadcast and multicast encryption. In Automata, Languages, and Programming: 33rd International Colloquium, ICALP 2006, Proceedings, Part II, volume 4052 of Lecture Notes in Computer Science. Springer-Verlag, January 2006.
13. Daniele Micciancio and Bogdan Warinschi. Soundness of formal encryption in the presence of active adversaries. In Moni Naor, editor, TCC 2004: 1st Theory of Cryptography Conference, volume 2951 of Lecture Notes in Computer Science, pages 133-151. Springer-Verlag, February 2004.
14. Suvo Mittra. Iolus: A framework for scalable secure multicasting. In Proceedings of ACM SIGCOMM, pages 277-288, Cannes, France, September 14-18, 1997.
15. Dalit Naor, Moni Naor, and Jeffery Lotspiech. Revocation and tracing schemes for stateless receivers. In Joe Kilian, editor, Advances in Cryptology - CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 41-62. Springer-Verlag, August 2001.
16. Jesper Buus Nielsen. Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case. In Moti Yung, editor, Advances in Cryptology - CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 111-126. Springer-Verlag, August 2002.
17. Chung Kei Wong, Mohamed Gouda, and Simon S. Lam. Secure group communications using key graphs. IEEE/ACM Transactions on Networking, 8(1):16-30, February 2000.