Marlin: Preprocessing zkSNARKs with universal and updatable SRS
We present a methodology to construct preprocessing zkSNARKs where the structured
reference string (SRS) is universal and updatable. This exploits a novel use of holography …
reference string (SRS) is universal and updatable. This exploits a novel use of holography …
On the size of pairing-based non-interactive arguments
J Groth - Advances in Cryptology–EUROCRYPT 2016: 35th …, 2016 - Springer
Non-interactive arguments enable a prover to convince a verifier that a statement is true.
Recently there has been a lot of progress both in theory and practice on constructing highly …
Recently there has been a lot of progress both in theory and practice on constructing highly …
Snarky signatures: Minimal signatures of knowledge from simulation-extractable SNARKs
We construct a pairing based simulation-extractable SNARK (SE-SNARK) that consists of
only 3 group elements and has highly efficient verification. By formally linking SE-SNARKs to …
only 3 group elements and has highly efficient verification. By formally linking SE-SNARKs to …
Legosnark: Modular design and composition of succinct zero-knowledge proofs
We study the problem of building non-interactive proof systems modularly by linking small
specialized" gadget" SNARKs in a lightweight manner. Our motivation is both theoretical and …
specialized" gadget" SNARKs in a lightweight manner. Our motivation is both theoretical and …
vSQL: Verifying arbitrary SQL queries over dynamic outsourced databases
Cloud database systems such as Amazon RDS or Google Cloud SQLenable the
outsourcing of a large database to a server who then responds to SQL queries. A natural …
outsourcing of a large database to a server who then responds to SQL queries. A natural …
The hunting of the SNARK
The existence of succinct non-interactive arguments for NP (ie, non-interactive
computationally sound proofs where the verifier's work is essentially independent of the …
computationally sound proofs where the verifier's work is essentially independent of the …
On extractability obfuscation
We initiate the study of extractability obfuscation, a notion first suggested by Barak et
al.(JACM 2012): An extractability obfuscator eO for a class of algorithms M guarantees that if …
al.(JACM 2012): An extractability obfuscator eO for a class of algorithms M guarantees that if …
On the existence of extractable one-way functions
A function f is extractable if it is possible to algorithmically" extract," from any adversarial
program that outputs a value y in the image of f; a preimage of y. When combined with …
program that outputs a value y in the image of f; a preimage of y. When combined with …
Witness-succinct universally-composable snarks
Abstract Zero-knowledge Succinct Non-interactive ARguments of Knowledge (zkSNARKs)
are becoming an increasingly fundamental tool in many real-world applications where the …
are becoming an increasingly fundamental tool in many real-world applications where the …
Differing-inputs obfuscation and applications
In this paper, we study of the notion of differing-input obfuscation, introduced by Barak et
al.(CRYPTO 2001, JACM 2012). For any two circuits C_0 and C_1, a differing-input …
al.(CRYPTO 2001, JACM 2012). For any two circuits C_0 and C_1, a differing-input …