FAQ

Fiat–Shamir heuristic

Known as: Fiat-Shamir heuristic 
The Fiat–Shamir heuristic is a technique in cryptography for taking an interactive proof of knowledge and creating a digital signature based on it… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1999-2017
012319992017

Related topics

Related topics

9 relations
Amos FiatAnonymous veto networkCryptographic hash functionDigital signature
(More)

Related mentions per year

Related mentions per year

1967-2018
1960198020002020
Fiat–Shamir heuristic
Digital signature
Random oracle
Cryptographic hash function
Interactive proof system
Proof of knowledge

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
ZKBoo: Faster Zero-Knowledge for Boolean Circuits
In this paper we describe ZKBoo, a proposal for practically efficient zeroknowledge arguments especially tailored for Boolean… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2015
2015
Compactly Hiding Linear Spans - Tightly Secure Constant-Size Simulation-Sound QA-NIZK Proofs and Applications
Quasi-adaptive non-interactive zero-knowledge (QA-NIZK) proofs is a recent paradigm, suggested by Jutla and Roy (Asiacrypt ’13… (More)
Is this relevant?
2015
2015
Making Sigma-Protocols Non-interactive Without Random Oracles
Damg̊ard, Fazio and Nicolosi (TCC 2006) gave a transformation of Sigma-protocols, 3-move honest verifier zero-knowledge proofs… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Why "Fiat-Shamir for Proofs" Lacks a Proof
The Fiat-Shamir heuristic (CRYPTO ’86) is used to convert any 3-message public-coin proof or argument system into a non… (More)
  • figure 3
Is this relevant?
2012
2012
On the (In)security of the Fiat-Shamir Paradigm, Revisited
The Fiat-Shamir paradigm [CRYPTO’86] is a heuristic for converting 3-round identification schemes into signature schemes, and… (More)
  • figure 4.1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Short Pairing-Based Non-interactive Zero-Knowledge Arguments
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero… (More)
  • table 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Non-interactive Zero-Knowledge Arguments for Voting
In voting based on homomorphic threshold encryption, the voter encrypts his vote and sends it in to the authorities that tally… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2004
2004
Honest Verifier Zero - Knowledge Arguments Applied
We apply honest verifier zero-knowledge arguments to cryptographic protocols for non-malleable commitment, voting, anonymization… (More)
  • figure 3.1
  • figure 4.1
  • figure 4.3
  • figure 4.4
  • figure 4.5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
A group signature scheme allows a group member to sign messages anonymously on behalf of the group. However, in the case of a… (More)
Is this relevant?
1999
1999
Anonymous Authentication with Subset Queries (extended abstract)
We develop new schemes for anonymous authentication that support identity escrow. Our protocols also allow a prover to… (More)
Is this relevant?