Open Access
Ultimate solution to authentication via memorable password
TLDR
A new protocol called AMP, which allows the Di eHellman based key agreement and is actually superior to other related work in terms of e ciency and generalization features, is introduced.Abstract:
Human-memorable password authentication is not easy to provide over insecure networks due to the low entropy of the password. Such a password is typically vulnerable to dictionary attacks. A cryptographic protocol is the most promising solution to this problem. So far, numerous password authentication protocols have been proposed. Among them, A-EKE is a great landmark of veri er-based protocol and is followed by many distinguished protocols[7, 18, 34, 23, 9] such as SRP that is notable in its e ciency and SNAPI-X that is the rst provable approach of those protocols[34, 23]. Veri er-based protocols allow the asymmetric model in which a client possesses a password, while a server stores its veri er. Inspired by those works, this paper introduces a new protocol called AMP in a provable manner. It is the ultimate result of the author's AMP(Authentication and key agreement via Memorable Password) research project. AMP allows the Di eHellman based key agreement and is actually superior to other related work in terms of e ciency and generalization features. We give a rigorous comparison to them.read more
Citations
More filters
Book
Protocols for Authentication and Key Establishment
Colin Boyd,Anish Mathuria +1 more
TL;DR: This is the first comprehensive and integrated treatment of protocols for authentication and key establishment, which allows researchers and practitioners to quickly access a protocol for their needs and become aware of existing protocols which have been broken in the literature.
Proceedings ArticleDOI
A Fast and Secure Elliptic Curve Based Authenticated Key Agreement Protocol For Low Power Mobile Communications
TL;DR: This paper presents a fast and secure authenticated key agreement (EC-SAKA) protocol based on elliptic curve cryptography that can resist dictionary attacks mounted by either passive or active networks intruders, and offers perfect forward secrecy which protects past sessions and passwords against future compromise.
Book ChapterDOI
Password Authenticated Key Exchange Based on RSA for Imbalanced Wireless Networks
TL;DR: This paper proposes an authenticated key exchange protocol such that it is efficient enough to be implemented on most of the target low-power devices such as devices in sensor networks, smart cards and low- power Personal Digital Assistants and is secure against dictionary attacks.
BookDOI
Avian Ecology in Latin American Cityscapes
TL;DR: MacGregor et al. as mentioned in this paper gathered regional experts to set the state-of-the-art of bird studies in urban Latin America, focusing on the effects of urbanization on wildlife communities.
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.
Book
Handbook of Applied Cryptography
TL;DR: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols.
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.
Book ChapterDOI
An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance
TL;DR: An improved algorithm is derived which requires O(log2 p) complexity if p 1 has only small prime factors and such values of p must be avoided in the cryptosystem.