Computational Soundness of Symbolic Analysis for Protocols Using Hash Functions

Electronic Notes in Theoretical Computer Science

Volumn 186, Issue SPEC. ISS., 2007, Pages 121-139

  Janvier, Romain ^a   Lakhnech, Yassine ^a   Mazaré, Laurent ^a  

^a VERIMAG   (France)

Author keywords

Computational Model; Cryptographic Protocols; Dolev Yao Model; Formal Encryption; Keyed Hash Function; Probabilistic Encryption; Security

Indexed keywords

COMPUTATIONAL METHODS; CRYPTOGRAPHY; NETWORK PROTOCOLS; PROBABILITY;

COMPUTATIONAL MODELS; CRYPTOGRAPHIC PROTOCOLS; FORMAL ENCRYPTION; KEYED HASH FUNCTIONS; PROBABILISTIC ENCRYPTION;

MATHEMATICAL MODELS;

EID: 34347205954     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.01.066     Document Type: Article

References (21)

1. M. Abadi and P. Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). In IFIP International Conference on Theoretical Computer Science (IFIP TCS2000), Sendai, Japan, 2000. Springer-Verlag, Berlin Germany
2. A. Armando, D. Basin, Y. Boichut, Y. Chevalier, L. Compagna, J. Cuellar, P. Hankes Drielsma, P.-C. Héam, O. Kouchnarenko, J. Mantovani, S. Moedersheim, D. von Oheimb, M. Rusinowitch, J. Santiago, M. Turuani, L. Viganò, and L. Vigneron. The Avispa tool for the automated validation of internet security protocols and applications. In CAV 2005, 17th Int. Conf. on Computer Aided Verification, volume 3576 of LNCS, pages 281-285, Edinburgh, Scotland, UK, July 2005. Springer-Verlag
3. M. Backes, B. Pfitzmann, and M. Waidner. A composable cryptographic library with nested operations. In Proceedings of the 10th ACM conference on Computer and communication security, pages 220-230. ACM Press, 2003
4. Backes M., Pfitzmann B., and Waidner M. Limits of the reactive simulatability/uc of dolev-yao models with hashes (2006)
5. Bellare M., Boldyreva A., and Micali S. Public-key encryption in a multi-user setting: Security proofs and improvements. Advances in Cryptology-EUROCRYPT 2000. Lecture Notes in Comput. Sci. Vol. 1807 (2000), Springer 259-274
6. Bellare M., Canetti R., and Krawczyk H. Keying hash functions for message authentication. CRYPTO. Lecture Notes in Computer Science volume 1109 (1996), Springer 1-15
7. Blanchet B. Abstracting cryptographic protocols by prolog rules. International Static Analysis Symposium. LNCS volume 2126 (2001) 433-436
8. Bozga L., Lakhnech Y., and Périn M. Hermes: An automatic tool for verification of secrecy in security protocols. 15th International Conference on Computer Aided Verification (CAV). LNCS volume 2725 (2003)
9. Canetti R. Towards realizing random oracles: Hash functions that hide all partial information. CRYPTO. Lecture Notes in Computer Science volume 1294 (1997), Springer 455-469
10. J.A. Clark and J.L. Jacob. A survey of authentication protocol literature. Version 1.0, University of York, Department of Computer Science, November 1997
11. V. Cortier, S. Kremer, R. Küsters, and B. Warinschi. Computationnaly sound symbolic secrecy in the presence of hash functions, to appear, 2006
12. Cortier V., and Warinschi B. Computationally Sound, Automated Proofs for Security Protocols. Proceeding of the Fourtennth European Symposium on Programming. (ESOP 2005) (2005), Springer-Verlag 157-171
13. M. Daubignard, R. Janvier, Y. Lakhnech, and L. Mazaré. Game-based criterion partition applied to computational soundness of adaptive security. In International Workshop on Formal Aspects in Security and Trust (FAST'06), Hamilton, Canada, August 2006. To appear
14. Dolev D., and Yao A.C. On the security of public key protocols. IEEE Transactions on Information Theory 29 2 (1983) 198-208
15. F.D. Garcia and P. Rossum. Sound computational interpretation of formal hashes. Cryptology ePrint Archive, Report 2006/014, 2006. http://eprint.iacr.org/
16. Goldwasser S., and Micali S. Probabilistic encryption. Journal of Computer and System Sciences 28 2 (April 1984) 270-299
17. Janvier R., Lakhnech Y., and Mazaré L. Completing the Picture: Soundness of Formal Encryption in the Presence of Active Adversaries. Proc. 14th European Symposium on Programming. (ESOP'05). Lecture Notes in Computer Science volume 3444 (April 2005), Springer, Edinburgh, U. K 172-185
18. Lowe G. An attack on the Needham-Schroeder public-key authentification protocol. Information Processing Letters 56 3 (1995) 131-133
19. D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proceedings of the Theory of Cryptography Conference, pages 133-151. Springer, 2004
20. Rogaway P., and Shrimpton T. Cryptographic hash-function basics: Definitions, implications, and separations for preimage resistance, second-preimage resistance, and collision resistance. FSE. Lecture Notes in Computer Science (2004), Springer 371-388
21. M. Rusinowitch and M. Turuani. Protocol insecurity with finite number of sessions is NP-complete. In IEEE Computer Security Foundations Workshop, 2001