Password-Authenticated Key Exchange Based on RSA
Philip D. MacKenzie,Sarvar Patel,Ram Swaminathan +2 more
- pp 599-613
Reads0
Chats0
TLDR
It is shown how to modify the OKE protocol to obtain a password-authenticated key exchange protocol that can be proven secure (in the random oracle model), and the resulting protocol is very practical; the basic protocol requires about the same amount of computation as the Diffie-Hellman-based protocols or the well-known ssh protocol.Abstract:
There have been many proposals in recent years for password-authenticated key exchange protocols.Man y of these have been shown to be insecure, and the only ones that seemed likely to be proven secure (against active adversaries who may attempt to perform off-line dictionary attacks against the password) were based on the Diffie-Hellman problem.I n fact, some protocols based on Diffie-Hellman have been recently proven secure in the random-oracle model. We examine how to design a provably-secure password-authenticated key exchange protocol based on RSA. We first look at the OKE and protected-OKE protocols (both RSA-based) and show that they are insecure.Th en we show how to modify the OKE protocol to obtain a password-authenticated key exchange protocol that can be proven secure (in the random oracle model). The resulting protocol is very practical; in fact the basic protocol requires about the same amount of computation as the Diffie-Hellman-based protocols or the well-known ssh protocol.read more
Citations
More filters
Proceedings ArticleDOI
Seeing-is-believing: using camera phones for human-verifiable authentication
TL;DR: This work presents and analyzes seeing-is-believing, a system that utilizes 2D barcodes and camera-telephones to implement a visual channel for authentication and demonstrative identification of devices, and applies this visual channel to several problems in computer security.
Journal ArticleDOI
Password-based authenticated key exchange in the three-party setting
TL;DR: In this paper, a 3-party password-based authenticated key exchange (PAKE) protocol was proposed, in which the users trying to establish a common secret do not share a password between themselves but only with a trusted server.
Book ChapterDOI
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords
TL;DR: In this paper, a 3-round, password-authenticated key exchange protocol with human-memorable passwords was proposed, which is provably secure under the decisional Diffie-Hellman assumption.
Book ChapterDOI
Universally composable password-based key exchange
TL;DR: In this paper, the authors propose and realize a definition of security for password-based key exchange within the framework of universally composable (UC) security, thus providing security guarantees under arbitrary composition with other protocols.
Journal ArticleDOI
A survey of algebraic properties used in cryptographic protocols
TL;DR: This work gives a list of some relevant algebraic properties of cryptographic operators and provides examples of protocols or attacks using these properties, and gives an overview of the existing methods in formal approaches for analyzing cryptographic protocols.
References
More filters
Journal ArticleDOI
New Directions in Cryptography
TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Journal ArticleDOI
A method for obtaining digital signatures and public-key cryptosystems
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
Proceedings ArticleDOI
Random oracles are practical: a paradigm for designing efficient protocols
Mihir Bellare,Phillip Rogaway +1 more
TL;DR: It is argued that the random oracles model—where all parties have access to a public random oracle—provides a bridge between cryptographic theory and cryptographic practice, and yields protocols much more efficient than standard ones while retaining many of the advantages of provable security.
Book ChapterDOI
Entity authentication and key distribution
Mihir Bellare,Phillip Rogaway +1 more
TL;DR: This work provides the first formal treatment of entity authentication and authenticated key distribution appropriate to the distributed environment and presents a definition, protocol, and proof that the protocol meets its goal, assuming only the existence of a pseudorandom function.
Proceedings ArticleDOI
Encrypted key exchange: password-based protocols secure against dictionary attacks
TL;DR: A combination of asymmetric (public-key) and symmetric (secret- key) cryptography that allow two parties sharing a common password to exchange confidential and authenticated information over an insecure network is introduced.