Computational Diffie–Hellman assumption (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Computational Diffie–Hellman assumption" in English language version.

refsWebsite

Global rank English rank

2^nd place

274^th place

309^th place

1,873^rd place

1,347^th place

low place

207^th place

136^th place

low place

11^th place

8^th place

aminer.org

Bao, Feng; Deng, Robert H.; Zhu, Huafei (2003), Variations of the Diffie–Hellman Problem (PDF)

den Boer, Bert (1988), Diffie–Hellman is as strong as discrete log for certain primes (PDF), Lecture Notes in Computer Science, vol. 403, pp. 530–539, doi:10.1007/0-387-34799-2_38, ISBN 978-0-387-97196-4
Joux, Antoine; Nguyen, Kim (2003), "Separating decision Diffie–Hellman from computational Diffie–Hellman in cryptographic groups", Journal of Cryptology, 16 (4): 239–247, doi:10.1007/s00145-003-0052-4
Burmester, Mike; Desmedt, Yvo; Seberry, Jeniffer (1998), "Equitable Key Escrow with Limited Time Span (or, How to Enforce Time Expiration Cryptographically) Extended Abstract" (PDF), Equitable key escrow with limited time span (or, how to enforce time expiration cryptographically), Lecture Notes in Computer Science, vol. 1514, pp. 380–391, doi:10.1007/3-540-49649-1_30, ISBN 978-3-540-65109-3
Pfitzmann, Brigitte; Sadeghi, Ahmad-Reza (2000), "Anonymous fingerprinting with direct non-repudiation" (PDF), Advances in Cryptology — ASIACRYPT 2000, Lecture Notes in Computer Science, vol. 1976, pp. 401–414, doi:10.1007/3-540-44448-3_31, ISBN 978-3-540-41404-9
Boneh, Dan; Lynn, Ben; Shacham, Hovav (2004), "Short Signatures from the Weil Pairing" (PDF), Journal of Cryptology, 17 (4): 297–319, doi:10.1007/s00145-004-0314-9, S2CID 929219

Diffie, Whitfield; Hellman, Martin (1976), New directions in cryptography (PDF)

Maurer, Ueli M. (1994), Towards the Equivalence of Breaking the Diffie–Hellman Protocol and Computing Discrete Logarithms, CiteSeerX 10.1.1.26.530

Boneh, Dan; Lynn, Ben; Shacham, Hovav (2004), "Short Signatures from the Weil Pairing" (PDF), Journal of Cryptology, 17 (4): 297–319, doi:10.1007/s00145-004-0314-9, S2CID 929219

den Boer, Bert (1988), Diffie–Hellman is as strong as discrete log for certain primes (PDF), Lecture Notes in Computer Science, vol. 403, pp. 530–539, doi:10.1007/0-387-34799-2_38, ISBN 978-0-387-97196-4
Burmester, Mike; Desmedt, Yvo; Seberry, Jeniffer (1998), "Equitable Key Escrow with Limited Time Span (or, How to Enforce Time Expiration Cryptographically) Extended Abstract" (PDF), Equitable key escrow with limited time span (or, how to enforce time expiration cryptographically), Lecture Notes in Computer Science, vol. 1514, pp. 380–391, doi:10.1007/3-540-49649-1_30, ISBN 978-3-540-65109-3
Pfitzmann, Brigitte; Sadeghi, Ahmad-Reza (2000), "Anonymous fingerprinting with direct non-repudiation" (PDF), Advances in Cryptology — ASIACRYPT 2000, Lecture Notes in Computer Science, vol. 1976, pp. 401–414, doi:10.1007/3-540-44448-3_31, ISBN 978-3-540-41404-9
Boneh, Dan; Lynn, Ben; Shacham, Hovav (2004), "Short Signatures from the Weil Pairing" (PDF), Journal of Cryptology, 17 (4): 297–319, doi:10.1007/s00145-004-0314-9, S2CID 929219

Bellare, Mihir; Rogaway, Phillip (2005), Introduction to Modern Cryptography (PDF)