New Directions in Cryptography

By Whitfield Diffie, Martin E. Hellman. 1976

How researchers see this paper

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

Citations in the corpus

Byzantine-Resilient Secure Federated Learning (2020, methodology): “This is typically done by creating pairwise keys between the users through a key exchange protocol [19].”
Turbo-Aggregate: Breaking the Quadratic Aggregation Barrier in Secure Federated Learning (2020, methodology): “For secure aggregation, users create pairwise keys through a key exchange protocol, such as [40], then utilize them to communicate messages securely with other users, while all communication is forwarded through the server.”
Riffle (2016, methodology): “During the setup phase, the clients share three sets of pairwise secrets with the servers: (1) {kij} using a verifiable shuffle (used in the hybrid shuffle), and (2) {mij} and (3) {sij} using simpler methods like Diffie-Hellman [25] (used in the PIR).”
A Survey on Homomorphic Encryption Schemes (2017, methodology): “dition for binary numbers. 3.1.3. El-Gamal. In 1985, Taher Elgamal proposed a new public key encryption scheme [ElGamal 1985] which is the improved version of the original Difﬁe-Hellman Key Exchange [Difﬁe and Hellman 1976] algorithm, which is based on the hardness of certain problems in discrete lo”
A robust image authentication method distinguishing JPEG compression from malicious manipulation (2001, methodology): “A digital signature is based on the method of Public Key Encryption[4][13].”
The Complexity of Computing the Permanent (1979, background): “In particular, a fast algorithm for computing permanents mod 3 would imply that such schemes for cryptography as those proposed in [26] are nonexistent.”
Simple and fault-tolerant key agreement for dynamic collaborative groups (2000, methodology): “propose a group key agreement protocol, referred to as STR [19], which is based on an extension of the Diffie-Hellman (DH) key agreement protocol [10].”
An efficient cryptographic protocol verifier based on prolog rules (2001, background): “The Diffie-Hellman key agreement [18] enables two principals to build a shared secret.”
Physical One-Way Functions (2002, background): “Public-key encryption of the Diffie-Hellman flavor [9] relies on trapdoor one-way functions, where inversion is efficient given the trapdoor, but intractable otherwise.”
Practical Secure Aggregation for Privacy-Preserving Machine Learning (2017, methodology): “The specific Key Agreement scheme we will use is DiffieHellman key agreement [20], composed with a hash function.”
An Efficient Protocol for Authenticated Key Agreement (2003, methodology): “The protocol is based on Diffie-Hellman key agreement [ 13 ], and has many of the desirable security and performance attributes discussed in [8] (see Section 2). Two modifications of this protocol are also presented: a one-pass AK protocol suitable for environments where only one entity is on-line, ”