Compressing Proofs of k-Out-Of-n Partial Knowledge
In a proof of partial knowledge, introduced by Cramer, Damgård and Schoenmakers
(CRYPTO 1994), a prover knowing witnesses for some k-subset of n given public statements …
(CRYPTO 1994), a prover knowing witnesses for some k-subset of n given public statements …
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 …
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 …
Lift-and-shift: obtaining simulation extractable subversion and updatable SNARKs generically
Zero-knowledge proofs and in particular succinct non-interactive zero-knowledge proofs (so
called zk-SNARKs) are getting increasingly used in real-world applications, with …
called zk-SNARKs) are getting increasingly used in real-world applications, with …
Efficiency preserving transformations for concurrent non-malleable zero knowledge
Ever since the invention of Zero-Knowledge by Goldwasser, Micali, and Rackoff 1, Zero-
Knowledge has become a central building block in cryptography-with numerous …
Knowledge has become a central building block in cryptography-with numerous …
[PDF][PDF] Linear zero-knowledge—A note on efficient zero-knowledge proofs and arguments
R Cramer, I Damgård - Proceedings of the twenty-ninth annual ACM …, 1997 - dl.acm.org
We present a 4-move zero-knowledge proof system [21] for any NP language L, which
allows showing that z EL with error probability y less than 2–k using communication …
allows showing that z EL with error probability y less than 2–k using communication …
Lattice-based zk-SNARKs from square span programs
Zero-knowledge SNARKs (zk-SNARKs) are non-interactive proof systems with short and
efficiently verifiable proofs. They elegantly resolve the juxtaposition of individual privacy and …
efficiently verifiable proofs. They elegantly resolve the juxtaposition of individual privacy and …
Snarky ceremonies
Succinct non-interactive arguments of knowledge (SNARKs) have found numerous
applications in the blockchain setting and elsewhere. The most efficient SNARKs require a …
applications in the blockchain setting and elsewhere. The most efficient SNARKs require a …
Jolt: Snarks for virtual machines via lookups
Abstract Succinct Non-interactive Arguments of Knowledge (SNARKs) allow an untrusted
prover to establish that it correctly ran some “witness-checking procedure” on a witness. A …
prover to establish that it correctly ran some “witness-checking procedure” on a witness. A …
Ligero: Lightweight sublinear arguments without a trusted setup
We design and implement a simple zero-knowledge argument protocol for NP whose
communication complexity is proportional to the square-root of the verification circuit size …
communication complexity is proportional to the square-root of the verification circuit size …