Paper Info
Title
On the Insecurity of the Fiat-Shamir Signatures with Iterative Hash Functions
Abstract
At FOCS 2003, Goldwasser and Kalai showed the insecurity of the digital signature schemes obtained by the Fiat-Shamir transformation in the standard model. However, the proof of this negative result is complicated. This paper shows a much simpler counter example in the restricted (but realistic) case that the hash functions are designed by iterating an underlying hash function with an a-priori bounded input length, although we slightly extend the Fiat-Shamir paradigm. The result in [19] ruled out the case that the underlying identification schemes are interactive proofs, whereas this result can apply to the case.
Year
DOI
Venue
2009
10.1007/978-3-642-04642-1_11
ProvSec
Keywords
Field
DocType
iterative hash functions,hash function,simpler counter example,fiat-shamir signatures,underlying hash function,fiat-shamir transformation,digital signature scheme,fiat-shamir paradigm,a-priori bounded input length,negative result,underlying identification scheme,interactive proof,standard model
SHA-2,Discrete mathematics,Double hashing,Computer science,Collision resistance,Cryptographic hash function,Theoretical computer science,Hash function,SWIFFT,Security of cryptographic hash functions,Hash chain
Conference
Volume
ISSN
Citations 
5848
0302-9743
0
PageRank 
References 
Authors
0.34
28
3
Name
Order
Citations
PageRank
Eiichiro Fujisaki11526114.30
Ryo Nishimaki213114.91
Keisuke Tanaka327819.04