New security results on encrypted key exchange

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

Volumn 2947, Issue , 2004, Pages 145-158

  Bresson, Emmanuel ^a   Chevassut, Olivier ^b   Pointcheval, David ^c  

^a CELAR   (France)

^b LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^c ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; COMPUTATION THEORY; CRYPTOGRAPHY; HASH FUNCTIONS; PUBLIC KEY CRYPTOGRAPHY;

COMPUTATIONAL DIFFIE-HELLMAN PROBLEMS; DATA INTEGRITY; DENIAL OF SERVICE; ENCRYPTED KEY EXCHANGE; PUBLIC NETWORKS; RANDOM ORACLE; SYMMETRIC ENCRYPTION; WORKING GROUPS;

DENIAL-OF-SERVICE ATTACK;

EID: 35048866891     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24632-9_11     Document Type: Article

References (14)

1. W. Aiello, S. M. Bellovin, M. Blaze, R. Canetti, J. Ioannidis, A. D. Keromytis, and O. Reingold. Efficient, DoS-resistant, Secure Key Exchange for Internet Protocols. In Proc. of the 9th CCS, pages 48-58. ACM Press, New York, 2002.
2. M. Bellare, D. Pointcheval, and P. Rogaway. Authenticated Key Exchange Secure Against Dictionary Attacks. In Eurocrypt '00, LNCS 1807, pages 139-155. Springer-Verlag, Berlin, 2000.
3. M. Bellare and P. Rogaway. The AuthA Protocol for Password-Based Authenticated Key Exchange. Contributions to IEEE P1363. March 2000. Available from http://grouper.ieee.org/groups/1363/.
4. M. Bellare and P. Rogaway. Random Oracles Are Practical: a Paradigm for Designing Efficient Protocols. In Proc. of the 1st CCS, pages 62-73. ACM Press, New York, 1993.
5. S. M. Bellovin and M. Merritt. Encrypted Key Exchange: Password-Based Protocols Secure against Dictionary Attacks. In Proc. of the Symposium on Security and Privacy, pages 72-84. IEEE, 1992.
6. S. M. Bellovin and M. Merritt. Augmented Encrypted Key Exchange: A Password-Based Protocol Secure against Dictionary Attacks and Password File Compromise. In Proc. of the 1st CCS, pages 244-250. ACM Press, New York, 1993.
7. V. Boyko, P. MacKenzie, and S. Patel. Provably Secure Password Authenticated Key Exchange Using Diffie-Hellman. In Eurocrypt '00, LNCS 1807, pages 156-171. Springer-Verlag, Berlin, 2000. Final version available at: http://cm.bell-labs.com/who/philmac/research/.
8. E. Bresson, O. Chevassut, and D. Pointcheval. Security Proofs for Efficient Password-Based Key Exchange. In Proc. of the 10th CCS. ACM Press, New York, 2003. The full version is available on the Cryptology ePrint Archive 2002/192.
9. E. Bresson, O. Chevassut, and D. Pointcheval. New Security Results on Encrypted Key Exchange. In PKC '04, LNCS. Springer-Verlag, Berlin, 2004. Full version available at: http://www.di.ens.fr/users/pointche/.
10. C. Dwork, A. Goldberg, and M. Naor. On Memory-Bound Functions for Fighting Spam. In Crypto '03, LNCS 2729, pages 426-444. Springer-Verlag, Berlin, 2003.
11. IEEE Standard 1363.2 Study Group. Password-Based Public-Key Cryptography. Available from http://grouper.ieee.org/groups/1363/passwdPK.
12. A. Juels and J. Brainard. Client Puzzles: A Cryptographic Defense Against Connection Depletion Attacks. In Proc. of NDSS '99, pages 151-165, 1999.
13. M. Luby and Ch. Rackoff. How to Construct Pseudorandom Permutations from Pseudorandom Functions. SIAM Journal of Computing, 17(2):373-386, 1988.
14. V. Shoup. OAEP Reconsidered. Journal of Cryptology, 15(4):223-249, September 2002.