Abstract
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 language | English |
|---|---|
| Title of host publication | Post-Quantum Cryptography - Second International Workshop, PQCrypto 2008, Proceedings |
| Pages | 109-123 |
| Number of pages | 15 |
| DOIs | |
| Publication status | Published - Dec 1 2008 |
| Event | 2nd International Workshop on Post-Quantum Cryptography, PQCrypto 2008 - Cincinnati, OH, United States Duration: Oct 17 2008 → Oct 19 2008 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 5299 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | 2nd International Workshop on Post-Quantum Cryptography, PQCrypto 2008 |
|---|---|
| Country | United States |
| City | Cincinnati, OH |
| Period | 10/17/08 → 10/19/08 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)
Cite this
Digital signatures out of second-preimage resistant hash functions. / Dahmen, Erik; Okeya, Katsuyuki; Takagi, Tsuyoshi; Vuillaume, Camille.
Post-Quantum Cryptography - Second International Workshop, PQCrypto 2008, Proceedings. 2008. p. 109-123 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5299 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Digital signatures out of second-preimage resistant hash functions
AU - Dahmen, Erik
AU - Okeya, Katsuyuki
AU - Takagi, Tsuyoshi
AU - Vuillaume, Camille
PY - 2008/12/1
Y1 - 2008/12/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=56749169079&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=56749169079&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-88403-3-8
DO - 10.1007/978-3-540-88403-3-8
M3 - Conference contribution
AN - SCOPUS:56749169079
SN - 3540884025
SN - 9783540884026
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 109
EP - 123
BT - Post-Quantum Cryptography - Second International Workshop, PQCrypto 2008, Proceedings
ER -