The Hunting of the SNARK
J. Cryptology, Volume 30, Issue 4, 2017, Pages 989-1066.
The existence of succinct non-interactive arguments for NP (i.e., non-interactive computationally sound proofs where the verifier’s work is essentially independent of the complexity of the NP non-deterministic verifier) has been an intriguing question for the past two decades. Other than CS proofs in the random oracle model (Micali in SIA...More
Full Text (Upload PDF)
PPT (Upload PPT)