From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security
The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
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
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 · cited 2×
“[13]) adapted to the random oracle model as per [5].”
BackgroundMethodSelf-citationHow 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 · cited 13×
“Fiat and Shamir [11] suggested that their transform be applied to an ID scheme.”
BackgroundMethodResultInfluentialA 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
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787 · cited 1×
“, [11,14,6,17,24,7,12,20,19,26,21]) and are candidates for conversion to signature schemes via the FS transform.”
BackgroundSecurity Arguments for Digital Signatures and Blind Signatures
Pointcheval, D., & Stern, J. (2000) · Journal of Cryptology · doi:10.1007/s001450010003 · Cited by 2,209
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 · cited 1×
“Let us discuss this further.”
Zero-knowledge proofs of identity
Feige, U., Fiat, A., & Shamir, A. (1988) · Journal of Cryptology · doi:10.1007/bf02351717 · Cited by 1,029
A Forward-Secure Digital Signature Scheme
Bellare, M., & Miner, S. K. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_28 · Cited by 591 · cited 2×
“As previously mentioned, the non-triviality assumption on an ID scheme is necessary to guarantee that the FS transform yields a secure signature scheme.”
BackgroundSelf-citationProvably 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 · cited 1×
“A large number of canonical ID schemes are known (e.g., [11] [14] [6] [17] [24] [7] [12] [20] [19] [26] [21]) and are candidates for conversion to signature schemes via the FS transform.”
BackgroundOn Defining Proofs of Knowledge
Bellare, M., & Goldreich, O. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48071-4_28 · Cited by 556 · cited 1×
“The pioneering work of Pointcheval and Stern [23] assumes that the identification scheme is honest verifier zero-knowledge and also, in their Forking Lemma, assume a property that implies that it is a “proof of knowledge” [10,3], namely that there is an algorithm that can produce two transcripts which start with the s…”
BackgroundSelf-citation
Cited by
Boneh, D., Boyen, X., & Shacham, H. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_3 · Cited by 2,089
Multi-signatures in the plain public-Key model and a general forking lemma
Bellare, M., & Neven, G. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180453 · Cited by 654
Self-citationFernandez-Carames, T. M., & Fraga-Lamas, P. (2020) · IEEE Access · doi:10.1109/access.2020.2968985 · Cited by 607
“Other code-based signing algorithms have been proposed in the literature, such as identification protocols related to the application of Fiat-Shamir transformation [155], which in some cases outperform cryptosystems like CFS [156].”
MethodFiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
Lyubashevsky, V. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_35 · Cited by 558
Fernandez-Carames, T. M. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2958788 · Cited by 317
Zether: Towards Privacy in a Smart Contract World
Bünz, B., Agrawal, S., Zamani, M., & Boneh, D. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-51280-4_23 · Cited by 314
Bellare, M., & Palacio, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_11 · Cited by 312
Self-citationOn the (In)security of the Fiat-Shamir paradigm
Goldwasser, S., & Kalai, Y. T. (2004) · 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · doi:10.1109/sfcs.2003.1238185 · Cited by 311
Security Proofs for Identity-Based Identification and Signature Schemes
Bellare, M., Namprempre, C., & Neven, G. (2009) · Journal of Cryptology · doi:10.1007/s00145-008-9028-8 · Cited by 214
“We know that if the former is imp-pa secure, then the latter is uf-cma secure in the random oracle model [1].”
BackgroundMethodResultInfluentialSelf-citationA Concrete Treatment of Fiat-Shamir Signatures in the Quantum Random-Oracle Model
Kiltz, E., Lyubashevsky, V., & Schaffner, C. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-78372-7_18 · Cited by 163
“A canonical identification scheme [2] is a three-move authentication protocol ID of a specific form.”
On Cryptographic Mechanisms for the Selective Disclosure of Verifiable Credentials
Flamini, A., Sciarretta, G., Scuro, M., Sharif, A., Tomasi, A., & Ranise, S. (2024) · arXiv · Cited by 24
“…world game is being played, the challenger (also called simulator) creates a simulated proof without using the knowledge of w , as if it does not know w , by simulating also the random oracle 3 by programming it according to the queries it receives from the attacker as in [AABN02], Lemma 3.5.”
Influential
Metadata
- Authors
- Abdalla, M., An, J. H., Bellare, M., & Namprempre, C.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 418-433
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1526993157
- Cited by
- 189
- References
- 30
- FWCI
- 4.35
- 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.