Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Boolean satisfiability problemCommitment schemeCommon reference string modelCook–Levin theorem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Improved (Almost) Tightly-Secure Structure-Preserving Signatures
Structure Preserving Signatures (SPS) allow the signatures and the messages signed to be further encrypted while retaining the… 
2016
2016
The electronic cash system based on non-interactive zero-knowledge proofs
Electronic cash is an electronic form of currency, which allows the cash transactions over communication networks under privacy… 
2016
2016
Efficient Culpably Sound NIZK Shuffle Argument Without Random Oracles
One way to guarantee security against malicious voting servers is to use NIZK shuffle arguments. Up to now, only two NIZK shuffle… 
2015
2015
An enhanced Kerberos protocol with non-interactive zero-knowledge proof
As one of the most important trusted third-party-based authentication protocols, Kerberos is widely used to provide… 
2013
2013
Improving of Non-Interactive Zero-Knowledge Arguments Using Oblivious Transfer
We study non-interactive zero-knowledge (NIZK) arguments using oblivious transfer (OT) that correspond to interactive proof… 
2013
2013
New Trapdoor Projection Maps for Composite-Order Bilinear Groups
An asymmetric pairing over groups of composite order is a bilinear map e : G1 ×G2 → GT for groups G1 and G2 of composite order N… 
2011
2011
Efficient Cryptographic Primitives for Non-Interactive Zero-Knowledge Proofs and Applications
Non-interactive zero-knowledge (NIZK) proofs have enjoyed much interest in cryptography since they were introduced more than… 
2010
2010
Pairing-Based Non-interactive Zero-Knowledge Proofs
A non-interactive zero-knowledge proof permits the construction of a proof of the truth of a statement that reveals nothing else… 
2005
2005
Non-interactive zero-knowledge and applications two round authenticated key agreement
  • A. SaxenaB. Soh
  • 13th IEEE International Conference on Networks…
  • 2005
  • Corpus ID: 14310853
In this paper we propose a two-round authenticated key agreement protocol using non-interactive zero-knowledge (NIZK) proofs… 
1991
1991
Non-interactive zero-knowledge proof systems
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)