How to Prove Yourself: Practical Solutions to Identification and Signature Problems

By Amos Fiat, Adi Shamir. 1986

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Privacy-Preserving Ridge Regression on Hundreds of Millions of Records (2013, methodology): “These protocols are made noninteractive using the standard Fiat-Shamir heuristic in the random oracle model [22].”
Enhanced Privacy ID from Bilinear Pairing for Hardware Authentication and Attestation (2010, methodology): “In the random oracle model, such proof of knowledge protocols can be turned into signature schemes using the Fiat-Shamir heuristic [29, 41].”
The Sybil Attack (2002, background): “Most prior research on electronic identities has focused on persistence and unforgeability [14, 15, 27, 31], rather than on distinctness.”
An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions (1998, background): “We also mention that another avenue of eliminating interaction was suggested by Fiat and Shamir [ 12 ].”
Cryptographic Extraction and Key Derivation: The HKDF Scheme (2010, methodology): “As with any application of the random-oracle model [26, 12] one has to be careful about the way one interprets results obtained in this model.”
Dining Cryptographers Revisited (2004, methodology): “The proof protocols may be made non-interactive through use of the Fiat-Shamir heuristic [ 15 ]; they may be perfectly simulated with application of the random oracle model to the hash function used to generate challenges.”
The SPHINCS+ Signature Framework (2019, methodology): “transform [24] with a non-tight security reduction in the ROM and one based on the Unruh transform [43–45] with a non-tight reduction in the QROM.”
How to win the clonewars: efficient periodic n-times anonymous authentication (2006, unknown): “(cid:2)(cid:2) heuristic [33].”
Non-interactive cryptocomputing for NC/sup 1/ (1999, methodology): “We note that without assuming the trusted random string, proofs which assure robustness on encrypted values whose decryption is assumed not in BPP, seem to require interaction based on our beliefs regarding computational complexity conjectures [24], (unless the random oracle model is assumed as a pr”
Delegating computation: interactive proofs for muggles (2008, background): “See the full version for details and theorem statements.”
Secure Computation on the Web: Computing without Simultaneous Interaction (2011, methodology): “The only exception is that for our practical construction in the case of malicious adversaries, we use random oracles in order to obtain practical non-interactive zero-knowledge via the Fiat-Shamir paradigm [5].”