Variations of Diffie-Hellman problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2836, Issue , 2003, Pages 301-312

  Bao, Feng ^a   Deng, Robert H ^a   Zhu, Huafei ^a  

^a INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

Author keywords

Diffie Hellman problem; Divisible Diffie Hellman problem; Inverse Diffie Hellman problem; Square Diffie Hellman problem

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPUTATIONAL DIFFIE-HELLMAN PROBLEMS; DECISIONAL DIFFIE-HELLMAN PROBLEMS; DIFFIE-HELLMAN PROBLEM; HIGH GRANULARITY; OPTIMAL REDUCTIONS; SINGLE SAMPLE; SQUARE DIFFIE-HELLMAN PROBLEMS;

INVERSE PROBLEMS;

EID: 0142156713     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39927-8_28     Document Type: Article

References (22)

1. Eli Biham, Dan Boneh, and Omer Reingold. Breaking generalized Diffie Hellman modulo a composite is no easier than factoring. Information Processing Letters, 70:83-87, 1999.
2. Bresson, Chevassut and Pointcheval, The Group Diffie-Hellman Problems, SAC'02.
3. Mike Burmester, Yvo Desmedt, and Jennifer Seberry. Equitable key escrow with limited time span (or, how to enforce time expiration cryptographically). In K. Ohta and D. Pei, editors, Advances in Cryptology - ASIACRYPT '98, number 1514 in Lecture Notes in Computer Science, pages 380-391. Springer Verlag, Berlin Germany, 1998.
4. D. Beaver: Foundations of Secure Interactive Computing. CRYPTO 1991: 377-391.
5. Dan Boneh. The Decision Diffie-Hellman problem. In Third Algorithmic Number Theory Symposium, number 1423 in Lecture Notes in Computer Science, pages 48-63. Springer Verlag, Berlin Germany, 1998.
6. Christian Cachin, Klaus Kursawe, and Victor Shoup. Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography. In Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, Portland, Oregon, July 2000. ACM.
7. Full version appeared as Cryptology ePrint Archive Report 2000/034 (2000/7/7).
8. Jan Camenisch, Ueli Maurer, and Markus Stadler. Digital payment systems with passive anonymity evoking trustees. In E. Bertino, H. Kurth, G. Martella, and E. Montolivo, editors, Proceedings of the Fourth European Symposium on Research in Computer Security (ESORICS), number 1146 in Lecture Notes in Computer Science, pages 33-43, Rome, Italy, September 1996. Springer Verlag, Berlin Germany.
9. Ronald Cramer and Victor Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In Hugo Krawczyk, editor, Advances in Cryptology-CRYPTO'98, number 1462 in Lecture Notes in Computer Science, pages 13-25. International Association for Cryptologic Research, Springer Verlag, Berlin Germany, 1998.
10. Whitfield Diffie and Martin Hellman. New directions in cryptography. IEEE Transactions on Information Theory, IT No.2(6):644-654, November 1976.
11. Helena Handschuh, Yiannis Tsiounis, and Moti Yung. Decision oracles are equivalent to matching oracles. In International Workshop on Practice and Theory in Public Key Cryptography '99 (PKC '99), number 1560 in Lecture Notes in Computer Science, Kamakura, Japan, March 1999. Springer Verlag, Berlin Germany.
12. Kevin S. McCurley. The discrete logarithm problem. In Carl Pomerance, editor, Cryptology and Computational Number Theory, volume 42 of Proceedings of Symposia in Applied Mathematics, pages 49-74, Providence, 1990. American Mathematical Society.
13. Ueli M. Maurer and Stefan Wolf. Diffie-Hellman oracles. Neal Koblitz, editor. Advances in Cryptology-CRYPTO '96, number 1109 in Lecture Notes in Computer Science, pages 268-282. International Association for Cryptologic Research, Springer Verlag, Berlin Germany, 1996.
14. Ueli M. Maurer and Stefan Wolf. Lower bounds on generic algorithms in groups. In Kaisa Nyberg, editor, Advances in Cryptology-EUROCRYPT '98, number 1403 in Lecture Notes in Computer Science, pages 72-84. International Association for Cryptologic Research, Springer Verlag, Berlin Germany, 1998.
15. Ueli M. Maurer and Stefan Wolf. Diffie-Hellman, Decision Diffie-Hellman, and discrete logarithms. In IEEE Symposium on Information Theory, page 327, Cambridge, USA, August 1998.
16. Moni Naor and Omer Reingold. Number theoretic constructions of efficient pseudo-random functions. In 38th Symposium on Foundations of Computer Science (FOCS), pages 458-467. IEEE Computer Society Press, 1997.
17. Tatsuaki Okamoto and David Pointcheval, The Gap-Problems: a New Class of Problems for the Security of Cryptographic Schemes. Proceedings of the 2001 International Workshop on Practice and Theory in Public Key Cryptography (PKC'2001)(13-15 February 2001, Cheju Island, South Korea) K. Kim Ed., pages 104-118, LNCS 1992, Springer-Verlag, 2001.
18. Birgit Pfitzmann and Ahmadeza Sadeghi. Anonymous fingerprinting with direct non-repudiation. T. Okamoto, editor. Advances in Cryptology - ASIACRYPT '2000, number 1976 in Lecture Notes in Computer Science, Kyoto, Japan, 2000, pages 401-414. International Association for Cryptologic Research, Springer Verlag, Berlin Germany.
19. Victor Shoup. Lower bounds for discrete logarithms and related problems. In Walter Fumy, editor, Advances in Cryptology-EUROCRYPT'97, number 1233 in Lecture Notes in Computer Science, pages 256-266. International Association for Cryptologic Research, Springer Verlag, Berlin Germany, 1997.
20. Ahmad-Reza Sadeghi, Michael Steiner: Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference; Eurocrypt 2001, LNCS 2045, Springer-Verlag, May 2001, 243-260.
21. Michael Steiner, Gene Tsudik, and Michael Waidner. Key agreement in dynamic peer groups. IEEE Transactions on Parallel and Distributed Systems, 11(8):769-780, August 2000.
22. Stefan Wolf. Information theoretically and Computationally Secure Key Agreement in Cryptography. PhD thesis, ETH Zurich, 1999.