Key-dependent message security under active attacks - BRSIM/UC-soundness of symbolic encryption with key cycles -

Proceedings - IEEE Computer Security Foundations Symposium

Volumn , Issue , 2007, Pages 112-124

  Backes, Michael ^a   Pfitzmann, Birgit ^b   Scedrov, Andre ^c  

^a SAARLAND UNIVERSITY   (Germany)

^b IBM RESEARCH ZURICH   (Switzerland)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DOLEV-YAO MODELS; SYMMETRIC ENCRYPTION;

AUTHENTICATION; COMPUTER SIMULATION; MATHEMATICAL MODELS; NETWORK PROTOCOLS;

SECURITY OF DATA;

EID: 35048877673     PISSN: 19401434     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSF.2007.23     Document Type: Conference Paper

References (34)

1. M. Abadi and J. Jürjens. Formal eavesdropping and its computational interpretation. In Proc. 4th International Symposium on Theoretical Aspects of Computer Software (TACS), pages 82-94, 2001.
2. M. Abadi and P. Rogaway. Reconciling two views of cryptography: The computational soundness of formal encryption. In Proc. 1st IFIP International Conference on Theoretical Computer Science, volume 1872 of Lecture Notes in Computer Science, pages 3-22. Springer, 2000.
3. P. Adão, G. Bana, J. Herzog, and A. Scedrov. Soundness of formal encryption in the presence of key-cycles. In Proc. 10th European Symposium on Research in Computer Security (ESORICS), volume 3679 of Lecture Notes in Computer Science, pages 374-396. Springer, 2005.
4. M. Backes and B. Pfitzmann. Symmetric encryption in a simulatable Dolev-Yao style cryptographic library. In Proc. 17th IEEE Computer Security Foundations Workshop (CSFW), pages 204-218, 2004.
5. M. Backes and B. Pfitzmann. Relating symbolic and cryptographic secrecy. IEEE Transactions on Dependable and Secure Computing, 2(2):109-123, 2005.
6. M. Backes, B. Pfitzmann, and A. Scedrov. Key-dependent message security under active attacks. IACR Cryptology ePrint Archive 2005/421, Nov. 2005.
7. M. Backes, B. Pfitzmann, and M. Waidner. A composable cryptographic library with nested operations (extended abstract). In Proc. 10th ACM Conference on Computer and Communications Security, pages 220-230, 2003. Full version in IACR Cryptology ePrint Archive 2003/015, Jan. 2003, http://eprint.iacr.org/.
8. D. Beaver. Secure multiparty protocols and zero knowledge proof systems tolerating a faulty minority. Journal of Cryptology, 4(2):75-122, 1991.
9. M. Bellare, A. Desai, E. Jokipii, and P. Rogaway. A concrete security treatment of symmetric encryption. In Proc. 38th IEEE Symposium on Foundations of Computer Science (FOCS), pages 394-403, 1997.
10. M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway. Relations among notions of security for public-key encryption schemes. In Advances in Cryptology: CRYPTO '98, volume 1462 of Lecture Notes in Computer Science, pages 26-45. Springer, 1998.
11. M. Bellare and C. Namprempre. Authenticated encryption: Relations among notions and analysis of the generic composition paradigm. In Advances in Cryptology: ASIACRYPT 2000, volume 1976 of Lecture Notes in Computer Science, pages 531-545. Springer, 2000.
12. J. Black, P. Rogaway, and T. Shrimpton. Encryption-scheme security in the presence of key-dependent messages. In Proc. 9th Annual Workshop on Selected Areas in Cryptography (SAC), pages 62-75, 2002.
13. J. Camenisch and A. Lysyanskaya. An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In Advances in Cryptology: EUROCRYPT 2001, volume 2045 of Lecture Notes in Computer Science, pages 93-118. Springer, 2001.
14. R. Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 3(1):143-202, 2000.
15. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proc. 42nd IEEE Symposium on Foundations of Computer Science (FOCS), pages 136-145, 2001. Extended version in Cryptology ePrint Archive, Report 2000/67, http://eprint.iacr.org/.
16. R. Canetti and J. Herzog. Universally composable symbolic analysis of mutual authentication and key exchange protocols. In Proc. 3rd Theory of Cryptography Conference (TCC), volume 3876 of Lecture Notes in Computer Science, pages 380-403. Springer, 2006.
17. V. Cortier and B. Warinschi. Computationally sound, automated proofs for security protocols. In Proc. 14th European Symposium on Programming (ESOP), pages 157-171, 2005.
18. D. Dolev, C. Dwork, and M. Naor. Nonmalleable cryptography. SIAM Journal on Computing, 30(2):391-437, 2000.
19. D. Dolev and A. C. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 29(2):198-208, 1983.
20. C. Dwork, M. Naor, O. Reingold, and L. J. Stockmeyer. Magic functions. Journal of the ACM, 50(6):852-921, 2003.
21. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game - or - a completeness theorem for protocols with honest majority. In Proc. 19th Annual ACM Symposium on Theory of Computing (STOC), pages 218-229, 1987.
22. S. Goldwasser and L. Levin. Fair computation of general functions in presence of immoral majority. In Advances in Cryptology: CRYPTO '90, volume 537 of Lecture Notes in Computer Science, pages 77-93. Springer, 1990.
23. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28:270-299, 1984.
24. P. Laud. Semantics and program analysis of computationally secure information flow. In Proc. 10th European Symposium on Programming (ESOP), pages 77-91, 2001.
25. P. Laud. Symmetric encryption in automatic analyses for confidentiality against active adversaries. In Proc. 25th IEEE Symposium on Security & Privacy, pages 71-85, 2004.
26. M. Luby. Pseudorandomness and Cryptographic Applications. Princeton Computer Society Notes, Princeton, 1996.
27. C. Meadows. Using narrowing in the analysis of key management protocols. In Proc. 10th IEEE Symposium on Security & Privacy, pages 138-147, 1989.
28. S. Micali and P. Rogaway. Secure computation. In Advances in Cryptology: CRYPTO '91, volume 576 of Lecture Notes in Computer Science, pages 392-404. Springer, 1991.
29. D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proc. 1st Theory of Cryptography Conference (TCC), volume 2951 of Lecture Notes in Computer Science, pages 133-151. Springer, 2004.
30. B. Pfitzmann and M. Waidner. Composition and integrity preservation of secure reactive systems. In Proc. 7th ACM Conference on Computer and Communications Security, pages 245-254, 2000. Extended version (with Matthias Schunter) IBM Research Report RZ 3206, May 2000, http://www.semper.org/ sirene/publ/PfSW1_00ReactSimulIBM.ps.gz.
31. B. Pfitzmann and M. Waidner. A model for asynchronous reactive systems and its application to secure message transmission. In Proc. 22nd IEEE Symposium on Security & Privacy, pages 184-200, 2001. Extended version of the model (with Michael Backes) IACR Cryptology ePrint Archive 2004/082, http://eprint.iacr.org/.
32. C. Rackoff and D. R. Simon. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In Advances in Cryptology: CRYPTO '91, volume 576 of Lecture Notes in Computer Science, pages 433-444. Springer, 1992.
33. C. E. Shannon. Communication theory of secrecy systems. Bell System Technical Journal, 28(4):656-715, 1949.
34. A. C. Yao. Theory and applications of trapdoor functions. In Proc. 23rd IEEE Symposium on Foundations of Computer Science (FOCS), pages 80-91, 1982.