Prover-efficient commit-and-prove zero-knowledge SNARKs
H Lipmaa - Progress in Cryptology–AFRICACRYPT 2016: 8th …, 2016 - Springer
Zk-SNARKs (succinct non-interactive zero-knowledge arguments of knowledge) are needed
in many applications. Unfortunately, all previous zk-SNARKs for interesting languages are …
in many applications. Unfortunately, all previous zk-SNARKs for interesting languages are …
[PDF][PDF] zk-SNARKs: A gentle introduction
A Nitulescu - Ecole Normale Superieure, 2020 - di.ens.fr
Abstract Zero-Knowledge Succinct Non-interactive Arguments of Knowledge (zk-SNARKs)
are non-interactive systems with short proofs (ie, independent of the size of the witness) that …
are non-interactive systems with short proofs (ie, independent of the size of the witness) that …
{zkSaaS}:{Zero-Knowledge}{SNARKs} as a Service
A decade of active research has led to practical constructions of zero-knowledge succinct
non-interactive arguments of knowledge (zk-SNARKs) that are now being used in a wide …
non-interactive arguments of knowledge (zk-SNARKs) that are now being used in a wide …
zk-Bench: A Toolset for Comparative Evaluation and Performance Benchmarking of SNARKs
J Ernstberger, S Chaliasos, G Kadianakis… - Cryptology ePrint …, 2023 - eprint.iacr.org
Abstract Zero-Knowledge Proofs (ZKPs), especially Succinct Non-interactive ARguments of
Knowledge (SNARKs), have garnered significant attention in modern cryptographic …
Knowledge (SNARKs), have garnered significant attention in modern cryptographic …
Scalable zero knowledge via cycles of elliptic curves
Non-interactive zero-knowledge proofs of knowledge for general NP statements are a
powerful cryptographic primitive, both in theory and in practical applications. Recently, much …
powerful cryptographic primitive, both in theory and in practical applications. Recently, much …
Doubly-efficient zkSNARKs without trusted setup
We present a zero-knowledge argument for NP with low communication complexity, low
concrete cost for both the prover and the verifier, and no trusted setup, based on standard …
concrete cost for both the prover and the verifier, and no trusted setup, based on standard …
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) …
Subversion-zero-knowledge SNARKs
G Fuchsbauer - Public-Key Cryptography–PKC 2018: 21st IACR …, 2018 - Springer
Subversion zero knowledge for non-interactive proof systems demands that zero knowledge
(ZK) be maintained even when the common reference string (CRS) is chosen maliciously …
(ZK) be maintained even when the common reference string (CRS) is chosen maliciously …
Simulation-extractable zk-SNARK with a single verification
Among the zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARK),
the simulation-extractable zk-SNARK (SE-SNARK) introduces a security notion of non …
the simulation-extractable zk-SNARK (SE-SNARK) introduces a security notion of non …
Multi-Party proof generation in QAP-based zk-SNARKs
A Rahimi, MA Maddah-Ali - IEEE Journal on Selected Areas in …, 2021 - ieeexplore.ieee.org
Zero-knowledge succinct non-interactive argument of knowledge (zkSNARK) allows a party,
known as the prover, to convince another party, known as the verifier, that he knows a …
known as the prover, to convince another party, known as the verifier, that he knows a …