Guessing attacks and the computational soundness of static equivalence

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

Volumn 3921 LNCS, Issue , 2006, Pages 398-412

  Abadi, Martín ^a   Baudet, Mathieu ^b   Warinschi, Bogdan ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CNRS   (France)

^c LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL INDISTINGUISHABILITY; EQUATIONAL THEORY; STATIC EQUIVALENCE;

COMPUTATIONAL METHODS; CRYPTOGRAPHY; SECURITY OF DATA;

COMPUTER CRIME;

EID: 33745790245     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11690634_27     Document Type: Conference Paper

References (32)

1. M. Abadi, M. Baudet, and B. Warinschi. Guessing attack and the computational soundness of static equivalence (extended version). Manuscript, 2006.
2. M. Abadi and V. Cortier. Deciding knowledge in security protocols under equational theories. In Proc. 31st International Colloquium on Automata, Languages and Programming (ICALP'04), volume 3142 of LNCS, pages 46-58. Springer, 2004.
3. M. Abadi and V. Cortier. Deciding knowledge in security protocols under (many more) equational theories. In Proc. 18th IEEE Computer Security Foundations Workshop (CSFW'05), pages 62-76, 2005.
4. M. Abadi and C. Fournet. Mobile values, new names, and secure communication. In Proc. 28th ACM Symposium on Principles of Programming Languages (POPL'01), pages 104-115, 2001.
5. M. Abadi and A. D. Gordon. A bisimulation method for cryptographic protocols. Nordic Journal of Computing, 5(4):267-303, 1998.
6. M. Abadi and P. Rogaway. Reconciling two views of cryptography (The computational soundness of formal encryption). Journal of Cryptology, 15(2):103-127, 2002.
7. M. Abadi and B. Warinschi. Password-based encryption analyzed. In Proc. 32nd International Colloquium on Automata, Languages and Programming (ICALP'05), volume 3580 of LNCS, pages 664-676. Springer, 2005.
8. M. Backes, B. Pfitzmann, and M. Waidner. A composable cryptographie library with nested operations. In Proc. 10th ACM Conference on Computer and Communications Security (CCS'03), pages 220-330, 2003.
9. G. Bana. Soundness and completeness of formal logics of symmetric encryption. PhD thesis, University of Pensilvania, 2004.
10. M. Baudet. Deciding security of protocols against off-line guessing attacks. In Proc. 12th ACM Conference on Computer and Communications Security (CCS'05), pages 16-25, Alexandria, Virginia, USA, Nov. 2005.
11. M. Baudet, V. Cortier, and S. Kremer. Computationally sound implementations of equational theories against passive adversaries. In Proc. 32nd International Colloquium on Automata, Languages and Programming (ICALP'05), volume 3580 of LNCS, pages 652-663. Springer, 2005.
12. M. Bellare, D. Pointcheval, and P. Rogaway. Authenticated key exchange secure against dictionary attacks. In Advances in Cryptology - EUROCRYPT'00, volume 1807 of LNCS, pages 139-155. Springer, 2000.
13. S. M. Bellovin and M. Merritt. Encrypted key exchange: Password-based protocols secure against dictionary attacks. In Proc. 1992 IEEE Symposium on Security and Privacy (SSP'92), pages 72-84, 1992.
14. B. Blanchet, M. Abadi, and C. Fournet. Automated verification of selected equivalences for security protocols. In Proc. 20th IEEE Symposium on Logic in Computer Science (LICS'05), pages 331-340, 2005.
15. M. Boreale, R. De Nicola, and R. Pugliese. Proof techniques for cryptographic processes. In Proc. 14th IEEE Symposium on Logic in Computer Science (LICS'99), pages 157-166, 1999.
16. V. Boyko, P. MacKenzie, and S. Patel. Provably secure password-authenticated key exchange using Diffie-Hellman. In Advances in Cryptology - EUROCRYPT'00, volume 1807 of LNCS, pages 156-171. Springer, 2000.
17. R. Corin, J. M. Doumen, and S. Etalle. Analysing password protocol security against off-line dictionary attacks. Technical report TR-CTIT-03-52, Centre for Telematics and Information Technology, Univ. of Twente, The Netherlands, 2003.
18. R. Corin, S. Malladi, J. Alves-Foss, and S. Etalle. Guess what? Here is a new tool that finds some new guessing attacks (extended abstract). In IFIP WG 1.7 and ACM SIGPLAN Workshop on Issues in the Theory of Security (WITS'03), pages 62-71, 2003.
19. S. Delaune and F. Jacquemard. A theory of dictionary attacks and its complexity. In Proc. 17th IEEE Computer Security Foundations Workshop (CSFW'04), pages 2-15, 2004.
20. C. Fournet. Private communication, 2002.
21. R. Gennaro and Y. Lindell. A framework for password-based authenticated key exchange. In Advances in Cryptology - EUROCRYPT'03, volume 2656 of LNCS, pages 524-543. Springer, 2003.
22. O. Goldreich and Y. Lindell. Session key generation using human passwords only. In Advances in Cryptology - CRYPTO'01, volume 2139 of LNCS, pages 403-432. Springer, 2001.
23. L. Gong. Verifiable-text attacks in cryptographic protocols. In Proc. 9th IEEE Conference on Computer Communications (INFOCOM'90), pages 686-693, 1990.
24. L. Gong, T. M. A. Lomas, R. M. Needham, and J. H. Saltzer. Protecting poorly chosen secrets from guessing attacks. IEEE Journal on Selected Areas in Communications, 11(5):648-656, 1993.
25. J. Katz, R. Ostrovsky, and M. Yung. Practical password-authenticated key exchange provably secure under standard assumptions. In Advances in Cryptology EUROCRYPT'01, volume 2045 of LNCS, pages 475-494. Springer, 2001.
26. P. Laud. Symmetric encryption in automatic analyses for confidentiality against active adversaries. In Proc. 2004 IEEE Symposium on Security and Privacy (SSP'04), pages 71-85, 2004.
27. G. Lowe. Analysing protocols subject to guessing attacks. Journal of Computer Security, 12(1):83-98, 2004.
28. D. Micciancio and B. Warinschi. Completeness theorems for the Abadi-Rogaway logic of encrypted expressions. Journal of Computer Security, 12(1):99-129, 2004.
29. D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proc. Theory of Cryptography Conference (TCC'04), volume 2951 of LNCS, pages 133-151. Springer, 2004.
30. D. H. Phan and D. Pointcheval. About the security of ciphers (semantic security and pseudo-random permutations). In Proc. Selected Areas in Cryptography (SAC'04), volume 3357 of LNCS, pages 185-200. Springer, 2004.
31. M. Steiner, G. Tsudik, and M. Waidner. Refinement and extension of encrypted key exchange. ACM SIGOPS Oper. Syst. Rev., 29(3):22-30, 1995.
32. G. Tsudik and E. V. Herreweghen. Some remarks on protecting weak secrets and poorly-chosen keys from guessing attacks. In Proc. 12th IEEE Symposium on Reliable Distributed Systems (SRDS'93), 1993.