A new framework for efficient password-based authenticated key exchange

Authors:
Adam Groce;Jonathan Katz
Affiliations:
University of Maryland, College Park, MD, USA;University of Maryland, College Park, MD, USA
Venue:
Proceedings of the 17th ACM conference on Computer and communications security
Year:
2010

Citing 17
Cited 7

Provably secure session key distribution: the three party case

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Public-key cryptography and password protocols

ACM Transactions on Information and System Security (TISSEC)
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Password-Authenticated Key Exchange Based on RSA

ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Universally Composable Security: A New Paradigm for Cryptographic Protocols

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Encrypted Key Exchange: Password-Based Protocols SecureAgainst Dictionary Attacks

SP '92 Proceedings of the 1992 IEEE Symposium on Security and Privacy
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack

SIAM Journal on Computing
Session-Key Generation Using Human Passwords Only

Journal of Cryptology
A framework for password-based authenticated key exchange1

ACM Transactions on Information and System Security (TISSEC)
Simpler Session-Key Generation from Short Random Passwords

Journal of Cryptology
Efficient and secure authenticated key exchange using weak passwords

Journal of the ACM (JACM)
Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices

ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Provably secure password-authenticated key exchange using Diffie-Hellman

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Faster and shorter password-authenticated key exchange

TCC'08 Proceedings of the 5th conference on Theory of cryptography
Password based key exchange with mutual authentication

SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Two-Server password-only authenticated key exchange

ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Universally composable password-based key exchange

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques

Contributory password-authenticated group key exchange with join capability

CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Round-optimal password-based authenticated key exchange

TCC'11 Proceedings of the 8th conference on Theory of cryptography
Authenticating strangers in Online Social Networks

International Journal of Security and Networks
Gateway-oriented password-authenticated key exchange protocol in the standard model

Journal of Systems and Software
Password-Based authenticated key exchange

PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Efficient password authenticated key exchange via oblivious transfer

PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
CCBKE - Session key negotiation for fast and secure scheduling of scientific applications in cloud computing

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Protocols for password-based authenticated key exchange (PAKE) allow two users who share only a short, low-entropy password to agree on a cryptographically strong session key. The challenge in designing such protocols is that they must be immune to off-line dictionary attacks in which an eavesdropping adversary exhaustively enumerates the dictionary of likely passwords in an attempt to match a password to the set of observed transcripts. To date, few general frameworks for constructing PAKE protocols in the standard model are known. Here, we abstract and generalize a protocol by Jiang and Gong to give a new methodology for realizing PAKE without random oracles, in the common reference string model. In addition to giving a new approach to the problem, the resulting construction off ers several advantages over prior work. We also describe an extension of our protocol that is secure within the universal composability (UC) framework and, when instantiated using El Gamal encryption, is more efficient than a previous protocol of Canetti et al.