Noninteractive Zero-Knowledge

By Manuel Blum, Alfredo De Santis, Silvio Micali, Giuseppe Persiano. 1990

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

Pinocchio: Nearly Practical Verifiable Computation (2013, background): “1Such a scheme may also be referred to as a non-interactive zero knowledge (NIZK) proof [31].”
Coercion-resistant electronic elections (2005, methodology): “As sketched above, we use non-interactive proofs of knowledge [6] in a number of places.”
Verifiable random functions (1999, methodology): “Suchinteraction could be removed by using noninter-active zero-knowledge proofs (NIZK) [BFM88, BDMP91], as done by Bellare and Goldwasser [BG89].”
Computationally Sound Proofs (2000, background): “In exemplifying the new notion, most relevant has been a construction of Kilian’s [23], and, to a lesser extent, the works of [18] and [9].”
Lecture Notes on Cryptography (2001, methodology): “If it doesn't decrypt c,then Bi(y) = b.What is done instead uses the notion of Non-Interactive Zero-Knowledge Proofs (NIZK) [37, 130].”
Quadratic Span Programs and Succinct NIZKs without PCPs (2013, methodology): “The CRS size is linear in the circuit size, and prover computation is quasi-linear, making our scheme seemingly quite practical.”
An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions (1998, background): “(In their joint journal version [4], they also suggest how to prove “many theorems” while saving in the length of the random string.)”
Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency (2008, methodology): “To address these issues, the common random string (CRS) model was introduced [7, 6].”
Non-interactive cryptocomputing for NC/sup 1/ (1999, methodology): “We assume as in the model of [8] that a trusted random string is made initiallyavailable to the parties.”