[PDF][PDF] A review of zero knowledge proofs
T Chen, A Lu, J Kunpittaya, A Luo - 2021 - timroughgarden.github.io
In this review, we provide an overview of the technical progress and applications of zk-
SNARKs, zeroknowledge succinct non-interactive argument of knowledge. We give a …
SNARKs, zeroknowledge succinct non-interactive argument of knowledge. We give a …
Wolverine: fast, scalable, and communication-efficient zero-knowledge proofs for boolean and arithmetic circuits
Efficient zero-knowledge (ZK) proofs for arbitrary boolean or arithmetic circuits have recently
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …
Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation
We present Libra, the first zero-knowledge proof system that has both optimal prover time
and succinct proof size/verification time. In particular, if C is the size of the circuit being …
and succinct proof size/verification time. In particular, if C is the size of the circuit being …
Ezee: Epoch parallel zero knowledge for ansi c
Recent work has produced interactive Zero Knowledge (ZK) proof systems that can express
proofs as arbitrary C programs (Heath et al., 2021, henceforth referred to as ZEE); these …
proofs as arbitrary C programs (Heath et al., 2021, henceforth referred to as ZEE); these …
[PDF][PDF] Two Shuffles Make a RAM: Improved Constant Overhead Zero Knowledge RAM.
Abstract We optimize Zero Knowledge (ZK) proofs of statements expressed as RAM
programs over arithmetic values. Our arithmetic-circuit-based read/write memory uses only 4 …
programs over arithmetic values. Our arithmetic-circuit-based read/write memory uses only 4 …
Succinct scriptable nizk via trusted hardware
Non-interactive zero-knowledge proof or argument (NIZK) systems are widely used in many
security sensitive applications to enhance computation integrity, privacy and scalability. In …
security sensitive applications to enhance computation integrity, privacy and scalability. In …
Poppins: A direct construction for asymptotically optimal zkSNARKs
We present Poppins, a direct construction of a zero-knowledge argument system for general
computation that features an $ O_ {\lambda}(n) $ time prover and an $ O_ {\lambda}(1) …
computation that features an $ O_ {\lambda}(n) $ time prover and an $ O_ {\lambda}(1) …
A multi-party protocol for constructing the public parameters of the Pinocchio zk-SNARK
Recent efficient constructions of zero-knowledge Succinct Non-interactive Arguments of
Knowledge (zk-SNARKs), require a setup phase in which a common-reference string (CRS) …
Knowledge (zk-SNARKs), require a setup phase in which a common-reference string (CRS) …
Stacked garbling for disjunctive zero-knowledge proofs
D Heath, V Kolesnikov - Annual International Conference on the Theory …, 2020 - Springer
Abstract Zero-knowledge (ZK) proofs (ZKP) have received wide attention, focusing on non-
interactivity, short proof size, and fast verification time. We focus on the fastest total proof …
interactivity, short proof size, and fast verification time. We focus on the fastest total proof …
Lurk: Lambda, the ultimate recursive knowledge
We introduce Lurk, a new LISP-based programming language for zk-SNARKs. Traditional
approaches to programming over zero-knowledge proofs require compiling the desired …
approaches to programming over zero-knowledge proofs require compiling the desired …