A One Round Protocol for Tripartite Diffie–Hellman

By Antoine Joux. Journal of Cryptology, 2000

1,581 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Information Systems

View Paper: https://www.semanticscholar.org/paper/845e96c20e5a5ff3b03f4caf72c3cb817a7fa542

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

1. Brent Waters
2. Dan Boneh
3. Xavier Boyen
4. Craig Gentry
5. Amit Sahai
6. Allison Bishop
7. Jonathan Katz
8. Shai Halevi

In Information Systems

1. Xavier Boyen
2. Brent Waters
3. Dan Boneh
4. Craig Gentry
5. Allison Bishop
6. Jonathan Katz
7. Jens Groth
8. Eike Kiltz

Citations in the corpus

• Identity-based key agreement protocols from pairings (2017, methodology): “Pioneered by the work of Joux (the first key agreement scheme from pairings [18]), Sakai et al.”
• Short Randomizable Signatures (2016, background): “The emergence of pairing-based cryptography [34, 13] has created a need for such signature schemes compatible with this new setting.”
• Efficient Algorithms for Pairing-Based Cryptosystems (2002, neutral): “– Tripartite Diffie-Hellman [10].”
• Structure-Preserving Signatures and Commitments to Group Elements (2010, background): “Since the seminal works in [24] [63] [86], bilinear groups have been widely used for constructing efficient cryptographic protocols.”
• A Forward-Secure Public-Key Encryption Scheme (2003, methodology): “The computational version of this assumption has been used for a number of cryptographic constructions (e.g., [ 23 ,10,34,21,17]); furthermore, as noted in [9], the decisional version of the assumption (called the BDDH assumption there) is also believed to hold.”
• Multi-Dimensional Range Query over Encrypted Data (2007, methodology): “Decision BDH Assumption: The Decision Bilinear DH assumption, first used by Joux [32], later used by IBE systems [11], posits the hardness of the following problem: Given [g, g1 , g2 , g3 , Z] ∈ G(4) × G, where exponents z1, z2, z3 are picked at random fromZp, decide whether Z = e(g, g)123 .”
• Guide to Elliptic Curve Cryptography (2004, methodology): “Constructive applications of supersingular curves (and bilinear maps in general) include the three-party one-round Diffie-Hellman protocol of Joux [227], the identity-based public-key encryption scheme of Boneh and Franklin [58, 59], the hierarchical identity-based encryption and signature schemes o”
• GGHLite: More Efficient Multilinear Maps from Ideal Lattices (2014, background): “Bilinear maps (κ = 2) and multilinear maps have a lot of cryptographic applications, see [11,21,5] and [6,20,16,19], respectively.”
• Constructing Elliptic Curves with Prescribed Embedding Degrees (2002, background): “An important open problem in pairing-based cryptography [5, 6, 12, 14, 22, 23, 27, 29] is to build curves containing a subgroup with embedding degree k that is at once big enough to prevent the Frey-Rück attack, but small enough that the Tate pairing is efficiently computable, which in turn means th”
• A Taxonomy of Pairing-Friendly Elliptic Curves (2010, background): “, [44,45]), this condition is in fact not necessary [76].”
• Pairing-Based Cryptography at High Security Levels (2005, background): “We know of only three papers ([21] [23] [51]) that briefly discuss curves E over F p with #E(F p ) = p − 1.”
• Modern Cryptography: Theory and Practice (2003, methodology): “Independently, the work of Joux [154] uses the same technique to achieves another fascinating application: one-round three-party Diffie-Hellman key sharing (Joux names it "tripartite Diffie-Hellman".”
• ID-Based Blind Signature and Ring Signature from Pairings (2002, background): “However, the bilinear pairings have been found various applications in cryptography recently [4][5][14][15][17][23].”
• Scalable Protocols for Authenticated Group Key Exchange (2003, methodology): “Second, we may compile the 1round, 3-party key-exchange protocol of Joux [23] to obtain a simple, 3-party AKE protocol requiring 2 rounds.”
• An Algebraic Framework for Diffie–Hellman Assumptions (2013, background): “, groups , T of prime order q equipped with a bilinear map e : × → T ) [20,3] revolutionized cryptography in recent years and and are the basis for a large number of cryptographic protocols.”
• An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks (2017, background): “Decisional Bilinear Diffie-Hellman (DBDH) Problem [25, 9] is stated as below.”
• NanoECC: Testing the Limits of Elliptic Curve Cryptography in Sensor Networks (2008, neutral): “and Joux [40].”