Computationally sound implementations of equational theories against passive adversaries

Information and Computation

Volumn 207, Issue 4, 2009, Pages 496-520

  Baudet, Mathieu ^a   Cortier, Véronique ^b   Kremer, Steve ^c  

^a DCSSI   (France)

^b LORIA   (France)

^c CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; SECURITY OF DATA;

ARBITRARY EQUATIONAL THEORIES; COMPUTATIONAL SOUNDNESS; CRYPTOGRAPHIC IMPLEMENTATIONS; EQUATIONAL THEORIES; EXCLUSIVE-OR; PASSIVE ADVERSARIES; SECURITY NOTIONS; SECURITY PROTOCOLS; STANDARD TOOLS; STATIC EQUIVALENCES;

CRYPTOGRAPHY;

EID: 60549089343     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2008.12.005     Document Type: Article

References (40)

1. M. Baudet, V. Cortier, S. Kremer, Computationally sound implementations of equational theories against passive adversaries, in: Proceedings of 32nd International Colloquium on Automata, Languages and Programming (ICALP'05), LNCS, vol. 3580, Springer, 2005, pp. 652-663.
2. D. Dolev, A.C. Yao, On the security of public key protocols, IEEE Transactions on Information Theory IT-29 (12) (1983) 198-208.
3. Goldwasser S., and Micali S. Probabilistic encryption. Journal of Computer and System Sciences 28 (1984) 270-299
4. M. Abadi, P. Rogaway, Reconciling two views of cryptography (the computational soundness of formal encryption), in: Proceedings 1st IFIP International Conference on Theoretical Computer Science (IFIP-TCS'00), LNCS, vol. 1872, 2000, pp. 3-22.
5. H. Comon, V. Shmatikov, Is it possible to decide whether a cryptographic protocol is secure or not? Journal of Telecommunications and Information Technology 4 (2002) 5-15.
6. Cortier V., Delaune S., and Lafourcade P. A survey of algebraic properties used in cryptographic protocols. Journal of Computer Security 14 1 (2006) 1-43
7. M. Abadi, C. Fournet, Mobile values, new names, and secure communications, in: Proceedings of 28th Annual ACM Symposium on Principles of Programming Languages (POPL'01), 2001, pp. 104-115.
8. R. Corin, J. Doumen, S. Etalle, Analysing password protocol security against off-line dictionary attacks, in: Proceedings of 2nd International Workshop on Security Issues with Petri Nets and other Computational Models (WISP'04), ENTCS, vol. 121, 2005, pp. 47-63.
9. Baudet M. Deciding security of protocols against off-line guessing attacks. Proceedings of 12th ACM Conference on Computer and Communications Security (CCS'05) (2005), ACM Press 16-25
10. M. Abadi, V. Cortier, Deciding knowledge in security protocols under equational theories, in: Proceedings of 31st International Colloquium on Automata, Languages and Programming (ICALP'04), LNCS, vol. 3142, 2004, pp. 46-58.
11. B. Blanchet, Automatic proof of strong secrecy for security protocols, in: Proceedings of 25th IEEE Symposium on Security and Privacy (SSP'04), 2004, pp. 86-100.
12. P. Adão, G. Bana, A. Scedrov, Computational and information-theoretic soundness and completeness of formal encryption, in: Proceedings of 18th IEEE Computer Security Foundations Workshop (CSFW'05), 2005, pp. 170-184.
13. Micciancio D., and Warinschi B. Completeness theorems for the Abadi-Rogaway logic of encrypted expressions. Journal of Computer Security 12 1 (2004) 99-129
14. P. Laud, Computationally secure information flow, Ph.D. Thesis, Universität des Saarlandes, 2002.
15. P. Laud, R. Corin, Sound computational interpretation of formal encryption with composed keys, in: Proceedings of 6th International Conference on Information Security and Cryptology (ICISC'03), LNCS, vol. 2971, 2004, pp. 55-66.
16. P. Adão, J. Herzog, G. Bana, A. Scedrov, Soundness of formal encryption in the presence of key-cycles, in: Proceedings of 10th European Symposium on Research in Computer Security (ESORICS'05), LNCS, vol. 3679, 2005, pp. 374-396.
17. Backes M., Pfitzmann B., and Waidner M. A composable cryptographic library with nested operations. Proceedings of 10th ACM Conference on Computer and Communications Security (CCS'03) (2003), ACM Press 220-230
18. M. Backes, B. Pfitzmann, Symmetric encryption in a simulatable Dolev-Yao style cryptographic library, in: Proceedings of 17th IEEE Computer Science Foundations Workshop (CSFW'04), 2004, pp. 204-218.
19. M. Backes, B. Pfitzmann, M. Waidner, Symmetric authentication within simulatable cryptographic library, in: Proceedings of 8th European Symposium on Research in Computer Security (ESORICS'03), LNCS, 2003, pp. 271-290.
20. V. Cortier, B. Warinschi, Computationally sound, automated proofs for security protocols, in: Proceedings of 14th European Symposium on Programming (ESOP'05), LNCS, vol. 3444, 2005, pp. 157-171.
21. R. Janvier, Y. Lakhnech, L. Mazaré, Completing the picture: soundness of formal encryption in the presence of active adversaries, in: Proceedings of 14th European Symposium on Programming (ESOP'05), LNCS, vol. 3444, 2005, pp. 172-185.
22. R. Canetti, J. Herzog, Universally composable symbolic analysis of mutual authentication and key-exchange protocols (extended abstract), in: Proceedings of 3rd Theory of Cryptography Conference (TCC'06), LNCS, vol. 3876, 2006, pp. 380-403.
23. P. Laud, Symmetric encryption in automatic analyses for confidentiality against active adversaries, in: Proceedings of IEEE Symposium on Security and Privacy (SSP'04), 2004, pp. 71-85.
24. A. Datta, A. Derek, J.C. Mitchell, V. Shmatikov, M. Turuani, Probabilistic polynomial-time semantics for a protocol security logic, in: Proceedings of 32nd International Colloquium on Automata, Languages and Programming, ICALP, Lisboa, Portugal, LNCS, vol. 3580, Springer, 2005, pp. 16-29.
25. Blanchet B. A computationally sound mechanized prover for security protocols. IEEE Symposium on Security and Privacy (2006), IEEE Computer Society Press 140-154
26. M. Backes, B. Pfitzmann, Limits of the cryptographic realization of dolev-yao-style xor, in: Proceedings of 10th European Symposium on Research in Computer Security (ESORICS'05), LNCS, vol. 3679, 2005, pp. 336-354.
27. M. Abadi, B. Warinschi, Password-based encryption analyzed, in: Proceedings of 32nd International Colloquium on Automata, Languages and Programming (ICALP'05), LNCS, vol. 3580, 2005, pp. 664-676.
28. M. Abadi, M. Baudet, B. Warinschi, Guessing attacks and the computational soundness of static equivalence, in: Proceedings of 9th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'06), LNCS, vol. 3921, 2006, pp. 398-412.
29. G. Bana, P. Mohassel, T. Stegers, The computational soundness of formal indistinguishability and static equivalence, in: Proceedings of 11th Asian Computing Science Conference (ASIAN'06), LNCS, vol. 4435, Springer, 2006, pp. 182-196.
30. S. Kremer, L. Mazaré, Adaptive soundness of static equivalence, in: Proceedings of 12th European Symposium on Research in Computer Security (ESORICS'07), LNCS, vol. 4734, Springer, 2007, pp. 610-625.
31. Comon-Lundh H., and Cortier V. Computational soundness of observational equivalence. Proceedings of 15th ACM Conference on Computer and Communications Security (CCS'08) (2008), ACM Press 109-118
32. M. Abadi, C. Fournet, Mobile values, new names, and secure communication, in: Proceedings of of the 28th ACM Symposium on Principles of Programming Languages (POPL'01), 2001, pp. 104-115.
33. S. Hohenberger, The cryptographic impact of groups with infeasible inversion, Master's Thesis, MIT, 2003.
34. R.L. Rivest, On the notion of pseudo-free groups, in: Proceedings of 1st Theory of Cryptography Conference (TCC'04), LNCS, vol. 2951, 2004, pp. 505-521.
35. S. Goldwasser, M. Bellare, Lecture Notes on Cryptography, Massachusetts Institute of Technology (MIT), 2008. Available from: .
36. D. Micciancio, The RSA group is pseudo-free, in: Advances in Cryptology-Proceedings of EUROCRYPT'05, LNCS, vol. 3494, 2005, pp. 387-403.
37. D.H. Phan, D. Pointcheval, About the security of ciphers (semantic security and pseudo-random permutations), in: Proceedings of Selected Areas in Cryptography (SAC'04), LNCS, vol. 3357, 2004, pp. 185-200.
38. S. Halevi, Invertible universal hashing and the TET encryption mode, in: Advances in Cryptology-Proceedings of CRYPTO'2007, LNCS, vol. 4622, 2007, pp. 412-429.
39. M. Bellare, P. Rogaway, On the construction of variable-input-length ciphers, in: Proceedings of 6th Workshop on Fast Software Encryption (FSE'99), LNCS, vol. 1636, 1999, pp. 231-244.
40. E. Contejean, C. Marché, B. Monate, X. Urbain, The CiME Rewrite Tool, 2000. Available from: .