Sound and complete computational interpretation of symbolic hashes in the standard model

Theoretical Computer Science

Volumn 394, Issue 1-2, 2008, Pages 112-133

  Garcia, Flavio D ^a   van Rossum, Peter ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

Abadi Rogaway logic; Dolev Yao model; Oracle hashing; Protocol verification; Symbolic cryptography

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; POLYNOMIALS; SECURITY SYSTEMS; SEMANTICS;

ABADI ROGAWAY LOGIC; PROTOCOL VERIFICATION; SYMBOLIC CRYPTOGRAPHY;

NETWORK PROTOCOLS;

EID: 40049107445     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.11.011     Document Type: Article

References (33)

1. Adão P., Bana G., Herzog J., and Scedrov A. Soundness of formal encryption in the presence of key-cycles. In: De Capitani di Vimercati S., Syverson P.F., and Gollmann D. (Eds). Proceedings of the 10th European Symposium on Research in Computer Security. ESORICS'05. Lecture Notes in Computer Science vol. 3679 (2005), Springer Verlag 374-396
2. Adão P., Bana G., and Scedrov A. Computational and information-theoretic soundness and completeness of formal encryption. Proceedings of the 18th IEEE Computer Security Foundations Workshop. CSFW'05 (2005), IEEE 170-184
3. Abadi M., Baudet M., and Warinschi B. Guessing attacks and the computational soundness of static equivalence. In: Aceto L., and Ingólfsdóttir A. (Eds). 9th International Conference on Foundations of Software Science and Computation Structures. FoSSaCS'06. Lecture Notes in Computer Science vol. 3921 (2006), Springer Verlag 398-412
4. Abadi M., and Jürjens J. Formal eavesdropping and its computational interpretation. In: Kobayashi N., and Pierce B.C. (Eds). Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software. TACS'01. Lecture Notes in Computer Science vol. 2215 (2001), Springer Verlag 82-94
5. Abadi M., and Rogaway P. Reconciling two views of cryptography (the computational soundness of formal encryption). Journal of Cryptology 15 2 (2002) 103-127
6. Abadi M., and Warinschi B. Security analysis of cryptographically controlled access to XML documents. Proceedings of the 24th ACM Symposium on Principles of Database Systems (2005), ACM Press 108-117
7. Gergei Bana, Soundness and Completeness of Formal Logics of Symmetric Encryption, Ph.D. Thesis, University of Pennsylvania, 2004
8. Baudet M., Cortier V., and Kremer S. Computationally sound implementations of equational theories against passive adversaries. In: Caires L., Italiano G.F., Monteiro L., Palamidessi C., and Yung M. (Eds). Proceedings of the 32nd International Colloquium on Automata, Languages and Programming. ICALP'05. Lecture Notes in Computer Science vol. 3580 (2005), Springer Verlag 652-663
9. Bellare M., Desai A., Jokipii E., and Rogaway P. A concrete security treatment of symmetric encryption. Proceedings of the 38th Annual Symposium on Foundations of Computer Science. FOCS'97 (1997), IEEE 394-405
10. Bresson E., Lakhnech Y., Mazaré L., and Warinschi B. A generalization of DDH with applications to protocol analysis and computational soundness. In: Menezes A.J. (Ed). Proceedings the IACR International Conference: Advances in Cryptology. CRYPTO'07. Lecture Notes in Computer Science (2007), Springer Verlag
11. Backes M., Pfitzmann B., and Waidner M. Limits of the BRSIM/UC soundness of Dolev-Yao models with hashes. In: Gollmann D., Meier J., and Sabelfeld A. (Eds). Proceedings of the 11th European Symposium on Research in Computer Security. ESORICS'06. Lecture Notes in Computer Science vol. 4189 (2006), Springer Verlag 404-423
12. Bellare M., and Rogaway P. Random oracles are practical: A paradigm for designing efficient protocols. Proceedings of the 1st ACM Conference on Computer and Communication Security. CCS'93 (1993), ACM Press 62-73
13. Canetti R. Towards realizing random oracles: Hash functions that hide all partial information. In: Kaliski B. (Ed). Advances in Cryptology. CRYPTO'97. Lecture Notes in Computer Science vol. 1294 (1997), Springer Verlag 455-469
14. Ran Canetti, Towards realizing random oracles: Hash functions that hide all partial information, Cryptology ePrint Archive, Report 1997/007. http://eprint.iacr.org/1997/007, 1997
15. Canetti R., Goldreich O., and Halevi S. The random oracle methodology, revisited. Journal of the ACM 51 4 (2004) 557-594
16. Cortier V., Kremer S., Küsters R., and Warinschi B. Computationally sound symbolic secrecy in the presence of hash functions. In: Garg N., and Arun-Kumar S. (Eds). Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS'06. Lecture Notes in Computer Science vol. 4337 (2006), Springer Verlag 176-187
17. Canetti R., Micciancio D., and Reingold O. Perfectly one-way probabilistic hash functions. Proceedings of the 30th Annual ACM Symposium on Theory of Computing. STOC'98 (1998), ACM Press 131-140
18. Dolev D., Dwork C., and Naor M. Non-malleable cryptography. Proceedings of the 23rd Annual ACM Symposium on Theory of Computing. STOC'91 (1991), ACM Press 542-552
19. Dolev D., and Yao A.C. On the security of public key protocols. IEEE Transactions on Information Theory 29 2 (1983) 198-208
20. Shafi Goldwasser, Mihir Bellare, Lecture Notes on Cryptography. http://www-cse.ucsd.edu/~mihir/papers/gb.html, 2001
21. Goldwasser S., and Micali S. Probabilistic encryption. Journal of Computer and System Sciences 28 (1984) 270-299
22. Goldreich O. Foundations of Cryptography vol. 1 (2001), Cambridge University Press
23. Garcia F.D., and van Rossum P. Sound computational interpretation of symbolic hashes in the standard model. In: Yoshiura H., Sakurai K., Rannenberg K., Murayama Y., and Kawamura S. (Eds). Advances in Information and Computer Security. International Workshop on Security. IWSEC'06. Lecture Notes in Computer Science vol. 4266 (2006), Springer Verlag 33-47
24. Herzog J. A computational interpretation of Dolev-Yao adversaries. Theoretical Computer Science 340 1 (2005) 57-81
25. Janvier R., Lakhnech Y., and Mazaré L. Computational soundness of symbolic analysis for protocols using hash functions. Proceedings of the First Workshop in Information and Computer Security. ICS'06. Electronic Notes in Theoretical Computer Science vol. 186 (2007) 121-139
26. Kremer S., and Mazaré L. Adaptive soundness of static equivalence. In: Biskup J. (Ed). Proceedings of the 12th European Symposium on Research in Computer Security. ESORICS'07. Lecture Notes in Computer Science vol. 4734 (2007), Springer Verlag 610-625
27. Laurent Mazaré, Computationally sound analysis of protocols using bilinear pairings, in: Riccardo Focardi (Eds.) Preliminary Proceedings of the 7th International Workshop on Issues in the Theory of Security, WITS'07, 2007, pp. 6-21
28. Micciancio D., and Panjwani S. Adaptive security of symbolic encryption. In: Kilian J. (Ed). Proceedings of the 2nd Theory of Cryptography Conference. TCC'05. Lecture Notes in Computer Science vol. 3378 (2005), Springer Verlag 169-187
29. Micciancio D., and Warinschi B. Completeness theorems of the Abadi-Rogaway logic of encrypted expressions. Journal of Computer Security 12 1 (2004) 99-129
30. Micciancio D., and Warinschi B. Soundness of formal encryption in the presence of active adversaries. In: Naor M. (Ed). Proceedings of the 1st Theory of Cryptography Conference. TCC'04. Lecture Notes in Computer Science vol. 2951 (2004), Springer Verlag 133-151
31. Birgit Pfitzmann, Michael Waidner, Composition and integrity preservation of secure reactive systems, in: Proceedings of the 7th ACM Conference on Computer and Communication Security, CCS'00, 2000, pp. 245-254
32. Rogaway P., and Shrimpton T. Cryptographic hash-function basics: Definitions, implications, and separations for preimage resistance, second-preimage resistance, and collision resistance. In: Roy B., and Meier W. (Eds). Proceedings of the 11th Fast Software Encryption. FSE'04. Lecture Notes in Computer Science vol. 3017 (2004), Springer Verlag 371-388
33. Andrew C. Yao, Theory and applications of trapdoor functions, in: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, FOCS'82, 1982, pp. 80-91