On the security of the Winternitz one-time signature scheme
Autor: | Buchmann, Johannes, Dahmen, Erik, Ereth, Sarah, Hülsing, Andreas, Rückert, Markus, Nitaj, A., Pointcheval, D. |
---|---|
Přispěvatelé: | Discrete Mathematics, Coding Theory and Cryptology |
Jazyk: | angličtina |
Rok vydání: | 2011 |
Předmět: |
Theoretical computer science
Merkle signature scheme security reductions Hash function Pseudorandomness Pseudorandom function family Collision resistance post-quantum signatures pseudorandom functions Cryptographic hash function Hash chain Hash-based signatures Mathematics Standard model (cryptography) Computer Science::Cryptography and Security |
Zdroj: | Progress in Cryptology – AFRICACRYPT 2011: 4th International Conference on Cryptology in Africa, Dakar, Senegal, July 5-7, 2011 Proceedings, 363-378 STARTPAGE=363;ENDPAGE=378;TITLE=Progress in Cryptology – AFRICACRYPT 2011 Lecture Notes in Computer Science ISBN: 9783642219689 AFRICACRYPT |
ISSN: | 0302-9743 |
DOI: | 10.1007/978-3-642-21969-6_23 |
Popis: | We show that the Winternitz one-time signature scheme is existentially unforgeable under adaptive chosen message attacks when instantiated with a family of pseudo random functions. Compared to previous results, which require a collision resistant hash function, our result provides significantly smaller signatures at the same security level. We also consider security in the strong sense and show that the Winternitz one-time signature scheme is strongly unforgeable assuming additional properties of the pseudo random function. In this context we formally define several key-based security notions for function families and investigate their relation to pseudorandomness. All our reductions are exact and in the standard model and can directly be used to estimate the output length of the hash function required to meet a certain security level. |
Databáze: | OpenAIRE |
Externí odkaz: |