Hash function requirements for Schnorr signatures

Journal of Mathematical Cryptology

Volumn 3, Issue 1, 2009, Pages 69-87

  Neven, Gregory ^a,b   Smart, Nigel P ^c   Warinschi, Bogdan ^c  

^a IBM RESEARCH ZURICH   (Switzerland)

^b UNIVERSITY OF LEUVEN   (Belgium)

^c UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Generic group model; Hash function; Schnorr signatures

Indexed keywords

EID: 80053498671     PISSN: 18622976     EISSN: 18622984     Source Type: Journal    
DOI: 10.1515/JMC.2009.004     Document Type: Article

References (35)

1. Michel Abdalla, Jee Hea An, Mihir Bellare, and Chanathip Namprempre, From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security. Advances in Cryptology - EUROCRYPT 2002 (Lars R. Knudsen, ed.), Lecture Notes in Computer Science 2332, pp. 418-433. Springer-Verlag, Berlin, Germany, Amsterdam, The Netherlands, April 28- May 2, 2002.
2. Elena Andreeva, Gregory Neven, Bart Preneel, and Thomas Shrimpton, Seven-Property-Preserving Iterated Hashing: ROX. Advances in Cryptology - ASIACRYPT 2007 (Kaoru Kurosawa, ed.), Lecture Notes in Computer Science 4833, pp. 130-146. Springer-Verlag, Berlin, Germany, Kuching, Malaysia, December 2-6, 2007.
3. Mihir Bellare and Gregory Neven, Multi-signatures in the plain public-key model and a general forking lemma. ACM CCS 06: 13th Conference on Computer and Communications Secu-rity(Ari Juels, Rebecca N. Wright, and Sabrina De Capitani di Vimercati, eds.), pp. 390-399. ACM Press, Alexandria, Virginia, USA, October 30- November 3, 2006. (Pubitemid 47131386)
4. Mihir Bellare and Thomas Ristenpart, Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms. ICALP 2007: 34th International Colloquium on Automata, Languages and Programming(Lars Arge, Christian Cachin, Tomasz Jurdzinski, and Andrzej Tarlecki, eds.), Lecture Notes in Computer Science 4596, pp. 399-410. SpringerVerlag, Berlin, Germany, Wroclaw, Poland, July 9-13, 2007.
5. Mihir Bellare and Phillip Rogaway, Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. ACM CCS 93: 1st Conference on Computer and Communications Secu-rity(V. Ashby, ed.), pp. 62-73. ACM Press, Fairfax, Virginia, USA, November 3-5, 1993.
6. -, Collision-Resistant Hashing: Towards Making UOWHFs Practical. Advances in Cryptology - CRYPTO'97 (Burton S. Kaliski Jr., ed.), Lecture Notes in Computer Science 1294, pp. 470-484. Springer-Verlag, Berlin, Germany, Santa Barbara, CA, USA, August 17-21, 1997. (Pubitemid 127112573)
7. Ernest F. Brickell, David Pointcheval, Serge Vaudenay, and Moti Yung, Design Validations for Discrete Logarithm Based Signature Schemes. PKC 2000: 3rd International Workshop on Theory and Practice in Public Key Cryptography(Hideki Imai and Yuliang Zheng, eds.), Lecture Notes in Computer Science 1751, pp. 276-292. Springer-Verlag, Berlin, Germany, Melbourne, Victoria, Australia, January 18-20, 2000.
8. Daniel R. L. Brown, Generic Groups, Collision Resistance, and ECDSA, Cryptology ePrint Archive, Report 2002/026, 2002.
9. -, On the Provable Security of ECDSA. Advances in Elliptic Curve Cryptography, pp. 21-40. Cambridge University Press, 2005.
10. Ran Canetti, Oded Goldreich, and Shai Halevi, The random oracle methodology, revisited. 30th Annual ACM Symposium on Theory of Computing, pp. 209-218. ACM Press, Dallas, Texas, USA, May 23-26, 1998.
11. Ivan Damgård, A Design Principle for Hash Functions. Advances in Cryptology - CRYPTO'89 (Gilles Brassard, ed.), Lecture Notes in Computer Science 435, pp. 416-427. Springer-Verlag, Berlin, Germany, Santa Barbara, CA, USA, August 20-24, 1990.
12. Alexander W. Dent, Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model. Advances in Cryptology - ASIACRYPT 2002 (Yuliang Zheng, ed.), Lecture Notes in Computer Science 2501, pp. 100-109. Springer-Verlag, Berlin, Germany, Queen-stown, New Zealand, December 1-5, 2002.
13. Amos Fiat and Adi Shamir, How to Prove Yourself: Practical Solutions to Identification and Signature Problems. Advances in Cryptology - CRYPTO'86 (Andrew M. Odlyzko, ed.), Lecture Notes in Computer Science 263, pp. 186-194. Springer-Verlag, Berlin, Germany, Santa Barbara, CA, USA, August 1987.
14. Marc Fischlin, A Note on Security Proofs in the Generic Model. Advances in Cryptology - ASI-ACRYPT 2000 (Tatsuaki Okamoto, ed.), Lecture Notes in Computer Science 1976, pp. 458-469. Springer-Verlag, Berlin, Germany, Kyoto, Japan, December 3-7, 2000.
15. Shafi Goldwasser, Silvio Micali, and Ronald L. Rivest, A Digital Signature Scheme Secure Against Adaptive Chosen-message Attacks, SIAM Journal on Computing 17 (1988), pp. 281-308.
16. Shai Halevi and Hugo Krawczyk, Strengthening Digital Signatures Via Randomized Hashing. Advances in Cryptology - CRYPTO 2006 (Cynthia Dwork, ed.), Lecture Notes in Computer Science 4117, pp. 41-59. Springer-Verlag, Berlin, Germany, Santa Barbara, CA, USA, August 20-24, 2006. (Pubitemid 44532108)
17. Don Johnson, Alfred Menezes, and Scott A. Vanstone, The Elliptic Curve Digital Signature Algorithm (ECDSA), International Journal of Information Security 1 (2001), pp. 36-63.
18. John Kelsey and Tadayoshi Kohno, Herding Hash Functions and the Nostradamus Attack. Advances in Cryptology - EUROCRYPT 2006 (Serge Vaudenay, ed.), Lecture Notes in Computer Science 4004, pp. 183-200. Springer-Verlag, Berlin, Germany, St. Petersburg, Russia, May 28- June 1, 2006. (Pubitemid 44072240)
19. Neal Koblitz and Alfred J. Menezes, Another Look at "Provable Security", Journal of Cryp-tology 20 (2007), pp. 3-37.
20. Stefan Lucks, A Failure-Friendly Design Principle for Hash Functions. Advances in Cryp-tology - ASIACRYPT 2005 (Bimal K. Roy, ed.), Lecture Notes in Computer Science 3788, pp. 474-494. Springer-Verlag, Berlin, Germany, Chennai, India, December 4-8, 2005. (Pubitemid 43763491)
21. Ueli M. Maurer and Stefan Wolf, Lower Bounds on Generic Algorithms in Groups. Advances in Cryptology - EUROCRYPT'98 (Kaisa Nyberg, ed.), Lecture Notes in Computer Science 1403, pp. 72-84. Springer-Verlag, Berlin, Germany, Espoo, Finland, May 31- June 4, 1998. (Pubitemid 128081477)
22. Ralph C. Merkle, One Way Hash Functions and DES. Advances in Cryptology - CRYPTO'89 (Gilles Brassard, ed.), Lecture Notes in Computer Science 435, pp. 428-446. Springer-Verlag, Berlin, Germany, Santa Barbara, CA, USA, August 20-24, 1990.
23. Ilya Mironov, Hash Functions: From Merkle-Damgård to Shoup. Advances in Cryptology - EUROCRYPT 2001 (Birgit Pfitzmann, ed.), Lecture Notes in Computer Science 2045, pp. 166-181. Springer-Verlag, Berlin, Germany, Innsbruck, Austria, May 6-10, 2001.
24. Moni Naor and Moti Yung, Universal one-way hash functions and their cryptographic applications. 21st Annual ACM Symposium on Theory of Computing, pp. 33-43. ACM Press, Seattle, Washington, USA, May 15-17, 1989.
25. National Institute for Standards and Technology, Digital Signature Standard (DSS), Federal Information Processing Standards Publication 186, November 1994.
26. Kazuo Ohta and Tatsuaki Okamoto, On Concrete Security Treatment of Signatures Derived from Identification. Advances in Cryptology - CRYPTO'98 (Hugo Krawczyk, ed.), Lecture Notes in Computer Science 1462, pp. 354-369. Springer-Verlag, Berlin, Germany, Santa Barbara, CA, USA, August 23-27, 1998. (Pubitemid 128119018)
27. Pascal Paillier and Damien Vergnaud, Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log. Advances in Cryptology - ASIACRYPT 2005 (Bimal K. Roy, ed.), Lecture Notes in Computer Science 3788, pp. 1-20. Springer-Verlag, Berlin, Germany, Chennai, India, December 4-8, 2005. (Pubitemid 43763466)
28. David Pointcheval and Jacques Stern, Security Arguments for Digital Signatures and Blind Signatures, Journal of Cryptology 13 (2000), pp. 361-396.
29. Phillip Rogaway and Thomas Shrimpton, Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance. Fast Software Encryption - FSE 2004 (Bimal K. Roy and Willi Meier, eds.), Lecture Notes in Computer Science 3017, pp. 371-388. Springer-Verlag, Berlin, Germany, New Delhi, India, February 5-7, 2004.
30. Claus-Peter Schnorr, Efficient Identification and Signatures for Smart Cards. Advances in Cryptology - CRYPTO'89 (Gilles Brassard, ed.), Lecture Notes in Computer Science 435, pp. 239-252. Springer-Verlag, Berlin, Germany, Santa Barbara, CA, USA, August 20-24, 1990.
31. -, Efficient Signature Generation by Smart Cards, Journal of Cryptology 4 (1991), pp. 161-174.
32. Victor Shoup, Lower Bounds for Discrete Logarithms and Related Problems. Advances in Cryptology - EUROCRYPT'97 (Walter Fumy, ed.), Lecture Notes in Computer Science 1233, pp. 256-266. Springer-Verlag, Berlin, Germany, Konstanz, Germany, May 11-15, 1997. (Pubitemid 127067806)
33. Jacques Stern, David Pointcheval, John Malone-Lee, and Nigel P. Smart, Flaws in Applying Proof Methodologies to Signature Schemes. Advances in Cryptology - CRYPTO 2002 (Moti Yung, ed.), Lecture Notes in Computer Science 2442, pp. 93-110. Springer-Verlag, Berlin, Germany, Santa Barbara, CA, USA, August 18-22, 2002.
34. Xiaoyun Wang, Yiqun Lisa Yin, and Hongbo Yu, Finding Collisions in the Full SHA-1. Advances in Cryptology - CRYPTO 2005 (Victor Shoup, ed.), Lecture Notes in Computer Science 3621, pp. 17-36. Springer-Verlag, Berlin, Germany, Santa Barbara, CA, USA, August 14-18, 2005.
35. Xiaoyun Wang and Hongbo Yu, How to Break MD5 and Other Hash Functions. Advances in Cryptology - EUROCRYPT 2005 (Ronald Cramer, ed.), Lecture Notes in Computer Science 3494, pp. 19-35. Springer-Verlag, Berlin, Germany, Aarhus, Denmark, May 22-26, 2005. (Pubitemid 41313944)