Digital signatures out of second-preimage resistant hash functions

Erik Dahmen, Katsuyuki Okeya, Tsuyoshi Takagi, Camille Vuillaume

Research output: Chapter in Book/Report/Conference proceedingConference contribution

34 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationPost-Quantum Cryptography - Second International Workshop, PQCrypto 2008, Proceedings
PublisherSpringer Verlag
Number of pages15
ISBN (Print)3540884025, 9783540884026
Publication statusPublished - 2008
Externally publishedYes
Event2nd International Workshop on Post-Quantum Cryptography, PQCrypto 2008 - Cincinnati, OH, United States
Duration: Oct 17 2008Oct 19 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5299 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other2nd International Workshop on Post-Quantum Cryptography, PQCrypto 2008
Country/TerritoryUnited States
CityCincinnati, OH

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Digital signatures out of second-preimage resistant hash functions'. Together they form a unique fingerprint.

Cite this