Authenticated Key Exchange Secure against Dictionary Attacks

By Mihir Bellare, David Pointcheval, Phillip Rogaway. International Conference on the Theory and Application of Cryptographic Techniques, 2000

1,572 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications, Information Systems

View Paper: https://www.semanticscholar.org/paper/b3fc8df0ce77b89adef253566b20c7b8c1792950

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computer Networks and Communications

In Information Systems

Citations in the corpus

Stronger Security of Authenticated Key Exchange (2006, methodology): “In this paper we extend the Canetti-Krawczyk [11,12] security model for authenticated key exchange (AKE) to capture attacks resulting from leakage of ephemeral and long-term secret keys.”
A Formal Security Analysis of the Signal Messaging Protocol (2017, methodology): “We choose to study the security of Signal in the traditional key exchange notion of key indistinguishability [7, 8] (albeit a multi-stage variant), as opposed to a monolithic secure channel notion such as authenticated and conﬁdential channel establishment (ACCE) [43].”
Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman (2000, methodology): “Compared to the protocol of [3], PAK does not require an ideal block cipher assumption for security, but has a more complicated proof.”
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords (2001, methodology): “However, these validations are not proofs in the standard model; [3] relies on ideal ciphers, while [10,22] rely on random oracles.”
GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks (2002, background): “With this, one moves into the domain of authenticated key-exchange protocols which is definitionally more complex (see for example [9,8,29,11]) and where identification without an associated exchange of a session-key is of little practical value.”
Anonymous Two-Factor Authentication in Distributed Systems: Certain Goals Are Beyond Attainment (2015, background): “…password authentication scheme without a sensitive verification table stored on the server, which is a key advantage of two-factor schemes over common passwordonly schemes, for the latter (e.g., [5], [6]) have to maintain a sensitive password (or salted password) table on the server.”
Provably authenticated group Diffie-Hellman key exchange (2001, methodology): “Recently, Bellare, Pointcheval and Rogaway [5] re ned this model to use session IDs as an approach to de ne the partnering.”
Identity-based key agreement protocols from pairings (2017, methodology): “We use the session ID, which can be the concatenation of the messages in a session (see [1]), to define matching conversations, i.”
Scalable Protocols for Authenticated Group Key Exchange (2003, methodology): “On the other hand, for this reason their proof uses only the weaker CDH assumption.”
Two Birds with One Stone: Two-Factor Authentication with Security Beyond Conventional Bound (2018, methodology): “We refer the reader unfamiliar with the BPR2000 model to [35], [50] for more details.”
Fast dictionary attacks on passwords using time-space tradeoff (2005, methodology): “It uses a special data structure called the rainbow table.”
Modern Cryptography: Theory and Practice (2003, background): “, [37] on key transport protocols, [36, 38] on key agreement protocols, [21, 57] on password-based protocols, [18, 66] on key exchange protocols and design to be correct protocols, and [67] on the Internet Key Exchange (IKE) protocols.”