Password-based encryption analyzed

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 664-676

  Abadi, Martín ^a   Warinschi, Bogdan ^b  

^a University of California Santa Cruz   (United States)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK PROTOCOLS; SECURITY OF DATA; THEOREM PROVING;

PASSWORD-BASED ENCRYPTION; PROTOCOL MESSAGE; SECURITY MESSAGES;

CRYPTOGRAPHY;

EID: 26444502046     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_54     Document Type: Conference Paper

References (23)

1. M. Abadi and P. Rogaway. Reconciling two views of cryptography (The computational soundness of formal encryption). Journal of Cryptology, 15(2):103-127, 2002.
2. M. Backes, B. Pfitzmann, and M. Waidner. A composable cryptographic library with nested operations. In Proceedings of the 10th ACM Conference on Computer and Communications Security, pages 220-330, 2003.
3. M. Bellare and C. Namprempre. Authenticated encryption: Relations among notions and analysis of the generic composition paradigm. In Advances in Cryptology - ASIACRYPT 2000, volume 1976 of LNCS, pages 531-545. Springer-Verlag, 2000.
4. M. Bellare, D. Pointcheval, and P. Rogaway. Authenticated key exchange secure against dictionary attacks. In Advances in Cryptology - EUROCRYPT 2000, volume 1807 of LNCS, pages 139-155. Springer-Verlag, 2000.
5. S. M. Bellovin and M. Merritt. Encrypted key exchange: Password-based protocols secure against dictionary attacks. In Proceedings of the 1992 IEEE Symposium on Security and Privacy, pages 72-84, 1992.
6. V. Boyko, P. MacKenzie, and S. Patel. Provably secure password-authenticated key exchange using Diffie-Hellman. In Advances in Cryptology - EUROCRYPT 2000, volume 1807 of LNCS, pages 156-171. Springer-Verlag, 2000.
7. 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.
8. 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), pages 62-71, 2003.
9. S. Delaune and F. Jacquemard. A theory of dictionary attacks and its complexity. In Proc.of the 17th IEEE Computer Security Foundations Workshop (CSFW2004), pages 2-15, 2004.
10. R. Gennaro and Y. Lindell. A framework for password-based authenticated key exchange. In Advances in Cryptology - EUROCRYPT 2003, volume 2656 of LNCS, pages 524-543. Springer-Verlag, 2003.
11. O. Goldreich and Y. Lindell. Session key generation using human passwords only. In Advances in Cryptology - CRYPTO 2001, volume 2139 of LNCS, pages 403-432. Springer-Verlag, 2001.
12. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28:270-299, 1984.
13. L. Gong. Verifiable-text attacks in cryptographic protocols. In INFOCOM '90, pages 686-693, 1990.
14. 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.
15. J. Katz, R. Ostrovsky, and M. Yung. Practical password-authenticated key exchange provably secure under standard assumptions. In Advances in Cryptology - EUROCRYPT 2001, volume 2045 of LNCS, pages 475-494. Springer-Verlag, 2001.
16. J. Kohl and C. Neuman. RFC 1510: The Kerberos network authentication service (V5). Web page at ftp://ftp.isi.edu/in-notes/rfc1510.txt, 1993.
17. P. Laud. Symmetric encryption in automatic analyses for confidentiality against active adversaries. In Proc. of 2004 IEEE Symposium on Security and Privacy, pages 71-85, 2004.
18. G. Lowe. Analysing protocols subject to guessing attacks. Journal of Computer Security, 12(1):83-98, 2004.
19. D. Micciancio and B. Warinschi. Completeness theorems for the Abadi-Rogaway logic of encrypted expressions. Journal of Computer Security, 12(1):99-129, 2004.
20. D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Theory of Cryptography Conference (TCC 2004), volume 2951 of LNCS, pages 133-151. Springer-Verlag, 2004.
21. G. Miklau and D. Suciu. Controlling access to published data using cryptography. In Proceedings of 29th International Conference on Very Large Data Bases - VLDB 2003, pages 898-909. Morgan Kaufmann Publishers, 2003.
22. J. Mitchell, A. Ramanathan, A. Scedrov, and V. Teague. A probabilistic polynomial-time calculus for analysis of cryptographic protocols. Electronic Notes in Theoretical Computer Science, 45, 2001.
23. S. Patel. Number theoretic attacks on secure password schemes. In Proc. of the IEEE Symposium on Research in Security and Privacy, pages 236-247, 1997.