Adaptive security of symbolic encryption

Lecture Notes in Computer Science

Volumn 3378, Issue , 2005, Pages 169-187

  Micciancio, Daniele ^a   Panjwani, Saurabh ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Adaptive adversaries; Formal methods for security protocols; Soundness theorem; Symbolic encryption

Indexed keywords

COMPUTATIONAL METHODS; MULTICASTING; NETWORK PROTOCOLS; PUBLIC KEY CRYPTOGRAPHY; THEOREM PROVING;

COMPUTATIONAL SOUNDNESS THEOREM; CRYPTOGRAPHIC PROTOCOLS; SYMBOLIC EXPRESSIONS;

CODES (SYMBOLS);

EID: 24144482305     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30576-7_10     Document Type: Conference Paper

References (23)

1. M. Abadi and J. Jürjens. Formal eavesdropping and its computational interpretation. In N. Kobayashi and B. Pierce, editors, Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software - TACS 2001, volume 2215 of Lecture Notes in Computer Science, pages 82-94, Sendai, Japan, Oct. 2001. Springer-Verlag.
2. M. Abadi and P. Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). Journal of Cryptology, 15(2): 103-127, 2002.
3. M. Backes and B. Pfitzmann. Symmetric encryption in a simulatable Dolev-Yao style cryptographic library. In Proceedings of the 17th IEEE computer security foundations Workshop, pages 204-218, Pacific Grove, CA, USA, June 2004. IEEE Computer Society.
4. M. Backes, B. Pfitzmann, and M. Waidner. A Composable Cryptographic Library with Nested Operations. In Proceedings of the 10th ACM conference on computer and communications security - CCS 2003, pages 220-230, Washington, DC, USA, Oct. 2003. ACM.
5. R. Canetti, U. Feige, O. Goldreich, and M. Naor. Adaptively Secure Multiparty Computation. In Proceedings of the twenty-eighth annual ACM symposium on the theory of computing - STOC '96, pages 639-648, Philadelphia, Pennsylvania, USA, May 1996. ACM.
6. R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor, and B. Pinkas. Multicast security: A taxonomy and some efficient constructions. In INFOCOM 1999. Proceedings of the Eighteenth Annual Joint conference of the IEEE computer and communications societies, volume 2, pages 708-716, New York, NY, Mar. 1999. IEEE.
7. R. Canetti, T. Malkin, and K. Nissim. Efficient communication-storage tradeoffs for multicast encryption. In J. Stern, editor, Advances in Cryptology - EUROCRYPT '99, Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques, volume 1592 of Lecture Notes in Computer Science, Prague, Czech Republic, May 1999. Springer-Verlag.
8. D. Dolev, C. Dwork, and M. Naor. Nonmalleable Cyptography. SIAM Journal on Computing, 30(2):391-437, 2000. Preliminary version in STOC 1991.
9. C. Dwork, M. Naor, O. Reingold, and L. Stockmeyer. Magic Functions. Journal of the ACM, 50(6):852-921, Nov. 2003.
10. V. Gligor and D. O. Horvitz. Weak Key Authenticity and the Computational Completeness of Formal Encryption. In D. Boneh, editor, Advances in cryptology CRYPTO 2003, proceedings of the 23rd annual international cryptology conference, volume 2729 of Lecture Notes in Computer Science, pages 530-547, Santa Barbara, California, USA, Aug. 2003. Springer-Verlag.
11. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sience, 28(2):270-299, 1984. Preliminary version in Proc. of STOC 1982.
12. J. C. Herzog. Computational Soundness for Standard Assumptions of Formal Cryptography. PhD thesis, Massachusetts Institute of Technology, Boston, USA, 2004.
13. R. Impagliazzo and B. Kapron. Logics for Reasoning about Cryptographic Constructions. In Proceedings of the 44rd annual symposium on foundations of computer science - FOCS 2003, pages 372-383, Cambridge, MA, USA, Nov. 2003. IEEE.
14. P. Laud. Symmetric Encryption in Automatic Analyses for Confidentiality against Active Adversaries. In IEEE symposium on security and Privacy, pages 71-85, Berkeley, CA, USA, May 2004. IEEE Computer Society.
15. P. D. Lincoln, J. C. Mitchell, M. Mitchell, and A. Scedrov. A probabilistic polytime framework for protocol analysis. In Proceedings of the fifth ACM conference on computer and communications security - CCS '98, pages 112-121, San Francisco, California, USA, Nov. 1998. ACM.
16. D. Micciancio. Towards Computationally Sound Symbolic Security Analysis, June 2004. Tutorial. Slides available at http://dimacs.rutgers.edu/Workshops/Protocols/slides/micciancio.pdf.
17. D. Micciancio and S. Panjwani. Adaptive Security of Symbolic Encryption, Nov. 2004. Full version of this paper. Available from http://www-cse.ucsd.edu/users/spanjwan/papers.html.
18. D. Micciancio and S. Panjwani. Optimal communication complexity of generic multicast key distributio. In C. Cachin and J. Camenisch, editors, Advances in cryptology - EUROCRYPT 2004, proceedings of the internarional conference on the theory and application of cryptographic techniques, volume 3027 of Lecture Notes in Computer Science, Interlaken, Switzerland, May 2004. Springer-Verlag.
19. D. Micciancio and B. Warinschi. Completeness theorems for the abadi-rogaway logic of encrypted expressions. Journal of Computer Security, 12(1):99-129, 2004. Preliminary version in WITS 2002.
20. D. Micciancio and B. Warinschi. Soundness of Formal Encryption in the presence of Active Adversaries. In M. Naor, editor, Theory of cryptography conference Proceedings of TCC 2004, volume 2951 of Lecture Notes in Computer Science, pages 133-151, Cambridge, MA, USA, Feb. 2004. Springer-Verlag.
21. C. Rackoff and D. R. Simon. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In J. Feigenbaum, editor, Advances in Cryptology - CRYPTO '91, Proceedings, volume 576 of Lecture Notes in Computer Science, Santa Barbara, California, USA, Aug. 1991. Springer-Verlag.
22. S. Rafaeli and D. Hutchinson. A survey of key management for secure group communication. ACM Computing Surveys, 35(3):309-329, Sept. 2003.
23. C. K. Wong, M. Gouda, and S. S. Lam. Secure group communications using key graphs. IEEE/ACM Transactions on Networking, 8(1): 16-30, Feb. 2000. Preliminary version in SIGCOMM 1998.