New online/offline signature schemes without random oracles

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

Volumn 3958 LNCS, Issue , 2006, Pages 330-346

  Kurosawa, Kaoru ^a   Schmidt Samoa, Katja ^b  

^a IBARAKI UNIVERSITY   (Japan)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Division intractability; Online offline signatures; Strong RSA assumption; Trapdoor hash

Indexed keywords

FUNCTION EVALUATION; MATHEMATICAL MODELS; ONLINE SYSTEMS; RANDOM PROCESSES; SECURITY OF DATA;

DIVISION INTRACTABILITY; ONLINE/OFFLINE SIGNATURES; STRONG RSA ASSUMPTION; TRAPDOOR HASH;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 33745858270     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11745853_22     Document Type: Conference Paper

References (20)

1. [BP97] N. Barić and B. Pfitzmann. Collision-free accumulators and fail-stop signature schemes without trees. In Walter Fumy, editor, EUROCRYPT, volume 1233 of Lecture Notes in Computer Science, pages 366-377, Berlin, 1997. Springer-Verlag.
2. [BR93] M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In Proc. of the 1st ACM Conference on Computer and Communications Security (CCS), pages 62-73. ACM Press, 1993.
3. [CGH98] R. Canetti, O. Goldreich, and S. Halevi. The random oracle methodology, revisited (preliminary version). In Proc. of the 30th Annual ACM Symposium on Theory of Computing (STOC '98), pages 209-218, New York, NY, USA, 1998. ACM Press.
4. [CGH04] R. Canetti, O. Goldreich, and S. Halevi. On the random-oracle methodology as applied to length-restricted signature schemes. In Moni Naor, editor, TCC, volume 2951 of Lecture Notes in Computer Science, pages 40-57. Springer, 2004.
5. [CL02] J. Camenisch and A. Lysyanskaya. A signature scheme with efficient protocols. In Stelvio Cimato, Clemente Galdi, and Giuseppe Persiano, editors, SCN, volume 2576 of Lecture Notes in Computer Science, pages 268-289. Springer, 2002.
6. [CN00] J.-S. Coron and D. Naccache. Security analysis of the Gennaro-Halevi-Rabin signature scheme. In Bart Preneel, editor, EUROCRYPT, volume 1807 of Lecture Notes in Computer Science, pages 91-101. Springer, 2000.
7. [Cop97] D. Coppersmith. Small solutions to polynomial equations, and low exponent rsa vulnerabilities. J. Cryptology, 10(4):233-260, 1997.
8. [CS99] R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. In ACM Conference on Computer and Communications Security, pages 46-51, 1999.
9. [Dam87] I. Damgård. Collision free hash functions and public key signature schemes. In David Chaum and Wyn L. Price, editors, EUROCRYPT, volume 304 of Lecture Notes in Computer Science, pages 203-216. Springer, 1987.
10. [EGM96] S. Even, O. Goldreich, and S. Micali. On-line/off-line digital signatures. Journal of Cryptology, 9(1):35-67, 1996.
11. [Fis03] M. Fischlin. The Cramer-Shoup strong-RSA signature scheme revisited. In Yvo Desmedt, editor, Public Key Cryptography, volume 2567 of Lecture Notes in Computer Science, pages 116-129. Springer, 2003.
12. [GHR99] R. Gennaro, S. Halevi, and T. Rabin. Secure hash-and-sign signatures without the random oracle. In Jacques Stern, editor, EUROCRYPT, volume 1592 of Lecture Notes in Computer Science, pages 123-139. Springer, 1999.
13. [GMR88] S. Goldwasser, S. Micali, and R. L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput., 17(2):281-308, 1988.
14. [KR00] H. Krawczyk and T. Rabin. Chameleon signatures. In Proc. of the Symposium on Network and Distributed Systems Security (NDSS). The Internet Society, 2000.
15. [KSS06] K. Kurosawa and K. Schmidt-Samoa. New online/offline signature schemes without random oracles. Cryptology ePrint Archive, 2006. http://eprint.iacr.org/.
16. [LL94] C. H. Lim and P. J. Lee. More flexible exponentiation with precomputation. In Yvo Desmedt, editor, CRYPTO, volume 839 of Lecture Notes in Computer Science, pages 95-107. Springer, 1994.
17. [Mil75] G. L. Miller. Riemann's hypothesis and tests for primality. In Proc. of the 7th annual ACM symposium on Theory of computing (STOC '75), pages 234-239, New York, NY, USA, 1975. ACM Press.
18. [Sho99] Victor Shoup. On the security of a practical identification scheme. J. Cryptology, 12(4):24 7-260, 1999.
19. [SST05] K. Schmidt-Samoa and T. Takagi. Paillier's cryptosystem modulo p2q and its applications to trapdoor commitment schemes. In Ed Dawson and Serge Vaudenay, editors, Mycrypt, volume 3715 of Lecture Notes in Computer Science, pages 296-313. Springer, 2005.
20. [ST01] A. Shamir and Y. Tauman. Improved online/offline signature schemes. In Joe Kilian, editor, CRYPTO, volume 2139 of Lecture Notes in Computer Science, pages 355-367. Springer, 2001.