The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
On the (In)security of the Fiat-Shamir paradigm
Abstract
In 1986, Fiat and Shamir proposed a general method for transforming secure 3-round public-coin identification schemes into digital signature schemes. The idea of the transformation was to replace the random message of the verifier in the identification scheme, with the value of some deterministic hash function evaluated on various quantities in the protocol and on the message to be signed. The Fiat-Shamir methodology for producing digital signature schemes quickly gained popularity as it yields efficient and easy to implement digital signature schemes. The most important question however remained open: are the digital signatures produced by the Fiat-Shamir methodology secure? We answer this question negatively. We show that there exist secure 3-round public-coin identification schemes for which the Fiat-Shamir transformation yields insecure digital signature schemes for any hash function used by the transformation. This is in contrast to the work of Pointcheval and Stern which proved that the Fiat-Shamir methodology always produces digital signatures secure against chosen message attack in the "Random Oracle Model" - when the hash function is modeled by a random oracle. Among other things, we make new usage of Barak's technique for taking advantage of nonblack-box access to a program, this time in the context of digital signatures.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_13 · Cited by 7,060
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Fiat, A., & Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7_12 · Cited by 3,943
The MD5 Message-Digest Algorithm
Rivest (1992) · Medical Entomology and Zoology · Cited by 2,853
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
Self-citationEfficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
Goldreich, O. (2001) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546891 · Cited by 2,181
How to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
Self-citationThe MD5 Message-Digest Algorithm
Rivest, R. (1992) · doi:10.17487/rfc1321 · Cited by 1,976
Merkle, R. C. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_21 · Cited by 1,691
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
Blum, M., & Micali, S. (1984) · SIAM Journal on Computing · doi:10.1137/0213053 · Cited by 1,322
On the (Im)possibility of Obfuscating Programs
Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S., & Yang, K. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_1 · Cited by 1,286
Security Proofs for Signature Schemes
Pointcheval, D., & Stern, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_33 · Cited by 1,077
Zero-knowledge proofs of identity
Feige, U., Fiat, A., & Shamir, A. (1988) · Journal of Cryptology · doi:10.1007/bf02351717 · Cited by 1,029
Universal one-way hash functions and their cryptographic applications
Naor, M., & Yung, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73011 · Cited by 959
Bit commitment using pseudorandomness
Naor, M. (1991) · Journal of Cryptology · doi:10.1007/bf00196774 · Cited by 807
The random oracle methodology, revisited (preliminary version)
Canetti, R., Goldreich, O., & Halevi, S. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276741 · Cited by 715
One-way functions are necessary and sufficient for secure signatures
Rompel, J. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100269 · Cited by 695
A note on efficient zero-knowledge proofs and arguments (extended abstract)
Kilian, J. (1992) · Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 · doi:10.1145/129712.129782 · Cited by 606
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
Okamoto, T. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48071-4_3 · Cited by 581
A “Paradoxical” Indentity-Based Signature Scheme Resulting from Zero-Knowledge
Guillou, L. C., & Quisquater, J.-J. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34799-2_16 · Cited by 451
Micali, S. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795284959 · Cited by 424
Secure Hash-and-Sign Signatures Without the Random Oracle
Gennaro, R., Halevi, S., & Rabin, T. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_9 · Cited by 347
Universal arguments and their applications
Barak, B., & Goldreich, O. (2003) · Proceedings 17th IEEE Annual Conference on Computational Complexity · doi:10.1109/ccc.2002.1004355 · Cited by 244
Signature schemes based on the strong RSA assumption
Cramer, R., & Shoup, V. (1999) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/319709.319716 · Cited by 193
Abdalla, M., An, J. H., Bellare, M., & Namprempre, C. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_28 · Cited by 189
Cited by
Signature Schemes and Anonymous Credentials from Bilinear Maps
Camenisch, J., & Lysyanskaya, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_4 · Cited by 982
Delegating computation: interactive proofs for muggles
Goldwasser, S., Kalai, Y. T., & Rothblum, G. N. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374396 · Cited by 484
Self-citationAttribute-Based Encryption With Verifiable Outsourced Decryption
Lai, J., Deng, R. H., Guan, C., & Weng, J. (2013) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2013.2271848 · Cited by 466
Short Pairing-Based Non-interactive Zero-Knowledge Arguments
Groth, J. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17373-8_19 · Cited by 440
Improved Delegation of Computation Using Fully Homomorphic Encryption
Chung, K.-M., Kalai, Y., & Vadhan, S. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_26 · Cited by 403
Self-citation
Metadata
- Authors
- Goldwasser, S., & Kalai, Y. T.
- Venue
- 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
- Publisher
- IEEE Computer. Soc
- Published
- 2004-03-01
- Pages
- 102-113
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2120154759
- Cited by
- 311
- References
- 27
- FWCI
- 12.14
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.