Non-interactive zero-knowledge proof

Known as: NIZK, SNARK 
Non-interactive zero-knowledge proofs are a variant of zero-knowledge proofs in which no interaction is necessary between prover and verifier. Blum… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
As one of the most important trusted third-party-based authentication protocols, Kerberos is widely used to provide… (More)
  • table I
  • figure 1
  • figure 2
  • table II
  • table IV
Is this relevant?
2014
2014
We present a construction for non-interactive zero-knowledge proofs of knowledge in the random oracle model from general sigma… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
In 2010, Groth constructed the only previously known sublinear-communication NIZK circuit satisfiability argument in the common… (More)
  • table 1
  • figure 1
Is this relevant?
2006
2006
Let Lambda : {0, 1}n times {0,1}m rarr {0,1} be a Boolean formula of size d, or more generally, an arithmetic circuit of degree d… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Non-interactive zero-knowledge (NIZK) systems are fundamental cryptographic primitives used in many constructions, including CCA2… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
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?
2005
2005
Non-interactive zero-knowledge (NIZK) proofs have been investigated in two models: the Public Parameter model and the Secret… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive… (More)
Is this relevant?
2000
2000
We introduce weaker models for non-interactive zero knowledge, in which the dealer is not restricted to deal a truly random… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We introduce the notion ofnon-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary… (More)
Is this relevant?