An Efficient Protocol for Authenticated Key Agreement
By L. Law, Alfred J. Menezes, Minghua Qu, J. Solinas, Scott A. Vanstone. Des. Codes Cryptogr., 2003
387 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/69bfc34e426c5f016999c82a80b63f657278c36c
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
- Matthew D. Green
- Aviel D. Rubin
- Ian Miers
- Christina Garman
- Joseph A. Akinyele
- Michael Rushanan
- Caroline Kudla
- Matthew W. Pagano
In Computer Networks and Communications
- Aviel D. Rubin
- Matthew D. Green
- Christina Garman
- Joseph A. Akinyele
- Michael Rushanan
- Ian Miers
- Matthew W. Pagano
- Liqun Chen
Citations in the corpus
- Charm: a framework for rapidly prototyping cryptosystems (2013, methodology): “Protocols Schnorr91 [49] Zero-Knowledge proof EC/Integer Standard 54 ECMQV [38] Key Agreement EC ROM 95 CNS07 [21] Oblivious Transfer Pairing Standard 160”
- Cryptographic Extraction and Key Derivation: The HKDF Scheme (2010, methodology): “For example, in a protocol such as MQV (or its provable variant HMQV) [50, 49] one can argue that the shared group element computed by the protocol is hard to fully guess by an attacker but not necessarily hard to distinguish from random group elements.”
- Identity based authenticated key agreement protocols from pairings (2003, methodology): “The method used here is well known and is identical to that used to add key confirmation to the MQV AK protocol as described in [ LMQSV ].”