Generic lower bounds for root extraction and signature schemes in general groups

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

Volumn 2332, Issue , 2002, Pages 256-271

  Damgård, Ivan ^a   Koprowski, Maciej ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; COMPUTER PROGRAMMING; CRYPTOGRAPHY; EXTRACTION;

COMPLEXITY ASSUMPTIONS; GENERIC ALGORITHM; GENERIC COMPLEXITY; NATURAL GENERALIZATION; ROOT EXTRACTION; SIGNATURE SCHEME; SPECIAL PROPERTIES; STRONG RSA ASSUMPTION;

GROUP THEORY;

EID: 84947214473     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46035-7_17     Document Type: Conference Paper

References (24)

1. Ingrid Biehl, Johannes Buchmann, Safuat Hamdy, and Andreas Meyer. A signature scheme based on the intractability of computing roots. Technical Report 1/00, Darmstadt University of Technology, 2000.
2. D. Boneh and R. J. Lipton. Algorithms for black-box fields and their application to cryptography. Lecture Notes in Computer Science, 1109:283–297, 1996.
3. D. Boneh and R. Venkatesan. Breaking RSA may not be equivalent to factoring. Lecture Notes in Computer Science, 1403:59–71, 1998.
4. Johannes Buchmann and H. C. Williams. A key-exchange system based on imaginary quadratic fields. Journal of Cryptology: the journal of the International Association for Cryptologic Research, 1(2):107–118, 1988.
5. Duncan A. Buell. The expectation of success using a Monte Carlo factoring method—some statistics on quadratic class numbers. Mathematics of Computation, 43(167):313–327, July 1984.
6. Marc Bütikofer. An abstraction of the Cramer-Damgård signature scheme based on tribes of q-one-way-group-homomorphisms. ETH Z¨urich, 1999.
7. H. Cohen and H.W. Lenstra. Heuristics on class groups of number fields. In Number Theory,No ordvijkerhout 1983, volume 1068 of Lecture Notes in Math., pages 33–62, 1984.
8. R. Cramer and I. Damgaard. Secure signature schemes based on interactive protocols. Lecture Notes in Computer Science, 963:297–310, 1995.
9. R. Cramer and I. Damgaard. Newgeneration of secure and practical RSA-Based signatures. Lecture Notes in Computer Science, 1109:173–185, 1996.
10. Ronald Cramer and Victor Shoup. Signature schemes based on the strong RSA assumption. In ACM Conference on Computer and Communications Security, pages 46–51, 1999.
11. Ivan Damgård and Maciej Koprowski. Generic lower bounds for root extraction and signature schemes in general groups (extended version). Cryptology ePrint Archive, Report 2002/013, 2002. http://eprint.iacr.org/.
12. Marc Fischlin. A note on security proofs in the generic model. In T. Okamoto, editor, Advances in Cryptology – ASIACRYPT ’ 2000, volume 1976 of Lecture Notes in Computer Science, pages 458–469, Kyoto, Japan, 2000. International Association for Cryptologic Research, Springer-Verlag, Berlin Germany.
13. Safuat Hamdy and Bodo M¨oller. Security of cryptosystems based on class groups of imaginary quadratic orders. In T. Okamoto, editor, Advances in Cryptology - ASIACRYPT 2000, pages 234–247. Springer-Verlag, 2000.
14. M. Jacobson. Subexponential class group computation in quadratic orders. PhD thesis, Technische Universitat Darmstadt, Darmstadt, Germany, 1999.
15. Tsutomu Matsumoto, Koki Kato, and Hideki Imai. Speeding up secret computations with insecure auxiliary devices. In S. Goldwasser, editor, Advances in Cryptology—CRYPTO ’88, volume 403 of Lecture Notes in Computer Science, pages 497–506. Springer-Verlag, 1990, 21–25 August 1988.
16. U. Maurer and S. Wolf. Lower bounds on generic algorithms in groups. Lecture Notes in Computer Science, 1403:72–84, 1998.
17. J. Merkle and R. Werchner. On the security of server-aided RSA protocols. Lecture Notes in Computer Science, 1431:99–116, 1998.
18. V. I. Nechaev. Complexity of a determinate algorithm for the discrete logarithm. Mathematical Notes, 55(2):165–172, 1994. Translated from Matematicheskie Zametki, 55(2):91–101, 1994.
19. P. Q. Nguyen and I.E. Shparlinski. On the insecurity of a server-aided RSA protocol. In C. Boyd, editor, Advances in Cryptology—Asiacrypt’2001, volume 2248 of Lecture Notes in Computer Science, pages 21–35. Springer-Verlag, 2001.
20. C.-P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology: the journal of the International Association for Cryptologic Research, 4(3):161–174, 1991.
21. Claus Peter Schnorr. Security of DL-encryption and signatures against generic attacks - a survey. In K.Alster, H.C.Williams, and J.Urbanowicz, editors, Proceedings of Public-Key Cryptography and Computational Number Theory Conference, Warsaw,Septemb er,2000. Walter De Gruyter, 2002.
22. Claus Peter Schnorr and Markus Jakobsson. Security of discrete log cryptosystems in the random oracle + generic model. In Conference on The Mathematics of Public-Key Cryptography, The Fields Institute, Toronto, Canada, 1999.
23. Claus Peter Schnorr and Markus Jakobsson. Security of signed ElGamal encryption. In T. Okamoto, editor, Advances in Cryptology – ASIACRYPT ’ 2000, volume 1976 of Lecture Notes in Computer Science, pages 73–89, Kyoto, Japan, 2000. International Association for Cryptologic Research, Springer-Verlag, Berlin Germany
24. V. Shoup. Lower bounds for discrete logarithms and related problems. In Advances in Cryptology: Eurocrypt ’97, pages 256–266, 1997.