Variations of Diffie-Hellman Problem
By F. Bao, Robert Huijie Deng, Huafei Zhu. International Conference on Information, Communications and Signal Processing, 2003
324 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Discrete Mathematics and Combinatorics
View Paper: https://www.semanticscholar.org/paper/10ed0082d98a99e1d44ee473f4e3b45b966be67c
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
- Mauro Conti
- Ashok Kumar Das
- Vanga Odelu
- Mohammad Wazid
- Hongbo Li
- Qiong Huang
- Dario Catalano
- Dario Fiore
In Discrete Mathematics and Combinatorics
Citations in the corpus
- Provably Secure Authenticated Key Agreement Scheme for Smart Grid (2018, background): “Note that under the underlying group with prime order q, CDHP and DCDHP are equivalent [20], [21].”
- An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks (2017, background): “It is not hard to find a reduction from the InvDDH problem (which is conjectured to be equivalent to DDH problem) [5] to mDLIN problem in groups without pairings 1.”
- Vector Commitments and Their Applications (2013, methodology): “Interestingly, by combining this result with the vector commitment given in Section 3.1, we are able to provide the first accumulator that works in prime order groups based on a standard constant-size assumption (i.e., CDH).”