A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Universal one-way hash functions and their cryptographic applications
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A compact and fast hybrid signature scheme for multicast packet authentication
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Collision-Resistant Hashing: Towards Making UOWHFs Practical
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
A composition theorem for universal one-way hash functions
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Finding collisions in the full SHA-1
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
How to break MD5 and other hash functions
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Strengthening digital signatures via randomized hashing
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Hash based digital signature schemes
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Public Key Authentication with Memory Tokens
Information Security Applications
Short Hash-Based Signatures for Wireless Sensor Networks
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
On the security of the Winternitz one-time signature scheme
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
XMSS - a practical forward secure signature scheme based on minimal security assumptions
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
On the security of the Winternitz one-time signature scheme
International Journal of Applied Cryptography
| Hi-index | 0.00 |
We propose a new construction for Merkle authentication trees which does not require collision resistant hash functions; in contrast with previous constructions that attempted to avoid the dependency on collision resistance, our technique enjoys provable security assuming the well-understood notion of second-preimage resistance. The resulting signature scheme is existentially unforgeable when the underlying hash function is second-preimage resistant, yields shorter signatures, and is affected neither by birthday attacks nor by the recent progresses in collision-finding algorithms.