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

22 Citations (Scopus)

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 languageEnglish
Title of host publicationPost-Quantum Cryptography - Second International Workshop, PQCrypto 2008, Proceedings
Pages109-123
Number of pages15
DOIs
Publication statusPublished - Dec 1 2008
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

Other

Other2nd International Workshop on Post-Quantum Cryptography, PQCrypto 2008
CountryUnited States
CityCincinnati, OH
Period10/17/0810/19/08

Fingerprint

Electronic document identification systems
Hash functions
Digital Signature
Hash Function
Collision
Short Signature
Authentication
Provable Security
Signature Scheme
Attack
Resistance

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Dahmen, E., Okeya, K., Takagi, T., & Vuillaume, C. (2008). Digital signatures out of second-preimage resistant hash functions. In Post-Quantum Cryptography - Second International Workshop, PQCrypto 2008, Proceedings (pp. 109-123). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5299 LNCS). https://doi.org/10.1007/978-3-540-88403-3-8

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 proceedingConference contribution

Dahmen, E, Okeya, K, Takagi, T & Vuillaume, C 2008, Digital signatures out of second-preimage resistant hash functions. in Post-Quantum Cryptography - Second International Workshop, PQCrypto 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5299 LNCS, pp. 109-123, 2nd International Workshop on Post-Quantum Cryptography, PQCrypto 2008, Cincinnati, OH, United States, 10/17/08. https://doi.org/10.1007/978-3-540-88403-3-8
Dahmen E, Okeya K, Takagi T, Vuillaume C. Digital signatures out of second-preimage resistant hash functions. In 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)). https://doi.org/10.1007/978-3-540-88403-3-8
Dahmen, Erik ; Okeya, Katsuyuki ; Takagi, Tsuyoshi ; Vuillaume, Camille. / Digital signatures out of second-preimage resistant hash functions. Post-Quantum Cryptography - Second International Workshop, PQCrypto 2008, Proceedings. 2008. pp. 109-123 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{7354ebadc2d44c169ad5004300e44ee1,
title = "Digital signatures out of second-preimage resistant hash functions",
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.",
author = "Erik Dahmen and Katsuyuki Okeya and Tsuyoshi Takagi and Camille Vuillaume",
year = "2008",
month = "12",
day = "1",
doi = "10.1007/978-3-540-88403-3-8",
language = "English",
isbn = "3540884025",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "109--123",
booktitle = "Post-Quantum Cryptography - Second International Workshop, PQCrypto 2008, Proceedings",

}

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 -