Hash function requirements for Schnorr signatures
From MaRDI portal
Publication:3632752
DOI10.1515/JMC.2009.004zbMath1165.94323MaRDI QIDQ3632752
Gregory Neven, Bogdan Warinschi, Nigel P. Smart
Publication date: 12 June 2009
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
94A60: Cryptography
Related Items
On the complexity of the herding attack and some related attacks on hash functions, Increasing the flexibility of the herding attack, The random oracle model: a twenty-year retrospective, On tight security proofs for Schnorr signatures, Provable Chosen-Target-Forced-Midfix Preimage Resistance, On the Joint Security of Encryption and Signature in EMV, The Symbiosis between Collision and Preimage Resistance
Cites Work
- Another look at ``provable security
- Efficient signature generation by smart cards
- Security arguments for digital signatures and blind signatures
- Herding Hash Functions and the Nostradamus Attack
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
- How to Break MD5 and Other Hash Functions
- Seven-Property-Preserving Iterated Hashing: ROX
- Finding Collisions in the Full SHA-1
- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
- A Failure-Friendly Design Principle for Hash Functions
- Strengthening Digital Signatures Via Randomized Hashing
