Sound computational interpretation of symbolic hashes in the standard model

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

Volumn 4266 LNCS, Issue , 2006, Pages 33-47

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

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; MATHEMATICAL MODELS; NETWORK PROTOCOLS; POLYNOMIALS; PROBABILITY; SEMANTICS;

ABADI-ROGAWAY LOGIC; CRYPTOGRAPHIC PROTOCOLS; POLYNOMIAL-TIME HASHES; PROBABILISTIC HASHES;

COMPUTATION THEORY;

EID: 33845272534     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11908739_3     Document Type: Conference Paper

References (17)

1. [AJ01] Martín Abadi and Jan Jürjens. Formal eavesdropping and its computational interpretation. In Naoki Kobayashi and Benjamin C. Pierce, editors, Proceedings of the Fourth International Symposium on Theoretical Aspects of Computer Software (TACS'01), volume 2215 of Lecture Notes in Computer Science, pages 82-94. Springer, 2001.
2. [AR02] Martín Abadi and Phillip Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). Journal of Cryptology, 15(2):103-127, 2002.
3. [BDJR97] Mihir Bellare, Anand Desai, Eron Jokipii, and Philip Rogaway. A concrete security treatment of symmetric encryption. In 38th Annual Symposium on Foundations of Computer Science (FOCS'97), pages 394-405. IEEE, 1997.
4. [BPW06] Michael Backes, Birgit Pfitzmann, and Michael Waidner. Limits of the reactive simulatability/UC of Dolev-Yao models with hashes. Cryptology ePrint Archive, Report 2006/014 (http://eprint.iacr.org/2006/068), 2006.
5. [BR93] Mihir Bellare and Phillip Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In Proceedings of the 1st ACM CCS, pages 62-73. ACM, 1993.
6. [Can97a] Ran Canetti. Towards realizing random oracles: Hash functions that hide all partial information. In Burt Kaliski, editor, Advances in Cryptology, 17th Annual International Cryptology Conference (CRYPTO'97), volume 1294 of Lecture Notes in Computer Science, pages 455-469. Springer, 1997.
7. [Can97b] 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.
8. [CMR98] Ran Canetti, Danielle Micciancio, and Omer Reingold. Perfectly one-way probabilistic hash functions (preliminary version). In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing (STOC'98), pages 131-140. ACM, 1998.
9. [DY83] Danny Dolev and Andrew C. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 29(2):198-208, 1983.
10. [GB01] Shafi Goldwasser and Mihir Bellare. Lecture Notes on Cryptography. 2001. http://www-cse.ucsd.edu/~mihir/papers/gb.html.
11. [GolOl] Oded Goldreich. Foundations of Cryptography, volume 1. Cambridge University Press, 2001.
12. [GR06] Flavio D. Garcia and Peter van Rossum. Sound computational interpretation of formal hashes. Cryptology ePrint Archive, Report 2006/014 (http://eprint.iacr.org/2006/014), 2006.
13. [Her05] Jonathan Herzog. A computational interpretation of Dolev-Yao adversaries. Theoretical Computer Science, 340(1):57-81, 2005.
14. [MP05] Daniele Micciancio and Saurabh Panjwani. Adaptive security of symbolic encryption. In Joe Kilian, editor, Theory of Cryptography: Second Theory of Cryptography Conference (TCC'05), volume 3378 of Lecture Notes in Computer Science, pages 169-187. Springer, February 2005.
15. [MW04] Daniele Micciancio and Bogdan Warinschi. Completeness theorems of the Abadi-Rogaway logic of encrypted expressions. Journal of Computer Security, 12(1):99-129, 2004.
16. [PW00] Birgit Pfitzmann and Michael Waidner. Composition and integrity preservation of secure reactive systems. In Proceedings of the 7th ACM CCS, pages 245-254, 2000.
17. [RS04] Phillip Rogaway and Thomas Shrimpton. Cryptographic hash-function basics: Definitions, implications, and separations for preimage resistance, second-preimage resistance, and collision resistance. In Bimal Roy and Willi Meier, editors, Fast Software Encryption: 11th International Workshop (FSE'04), volume 3017 of Lecture Notes in Computer Science, pages 371-388. Springer, 2004.