Secure sampling of public parameters for succinct zero knowledge proofs
Non-interactive zero-knowledge proofs (NIZKs) are a powerful cryptographic tool, with
numerous potential applications. However, succinct NIZKs (eg, zk-SNARK schemes) …
numerous potential applications. However, succinct NIZKs (eg, zk-SNARK schemes) …
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 …
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 …
Do You Need a Zero Knowledge Proof?
Abstract Zero-Knowledge Proofs (ZKPs), a cryptographic tool known for decades, have
gained significant attention in recent years due to advancements that have made them …
gained significant attention in recent years due to advancements that have made them …
[PDF][PDF] {ZKPDL}: A {Language-Based} system for efficient {Zero-Knowledge} proofs and electronic cash
In recent years, many advances have been made in cryptography, as well as in the
performance of communication networks and processors. As a result, many advanced …
performance of communication networks and processors. As a result, many advanced …
{MIRAGE}: Succinct arguments for randomized algorithms with applications to universal {zk-SNARKs}
The last few years have witnessed increasing interest in the deployment of zero-knowledge
proof systems, in particular ones with succinct proofs and efficient verification (zk-SNARKs) …
proof systems, in particular ones with succinct proofs and efficient verification (zk-SNARKs) …
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 …
A certifying compiler for zero-knowledge proofs of knowledge based on σ-protocols
Zero-knowledge proofs of knowledge (ZK-PoK) are important building blocks for numerous
cryptographic applications. Although ZK-PoK have a high potential impact, their real world …
cryptographic applications. Although ZK-PoK have a high potential impact, their real world …
Sonic: Zero-knowledge SNARKs from linear-size universal and updatable structured reference strings
M Maller, S Bowe, M Kohlweiss… - Proceedings of the 2019 …, 2019 - dl.acm.org
Ever since their introduction, zero-knowledge proofs have become an important tool for
addressing privacy and scalability concerns in a variety of applications. In many systems …
addressing privacy and scalability concerns in a variety of applications. In many systems …
Non-interactive zero-knowledge proofs for composite statements
The two most common ways to design non-interactive zero-knowledge (NIZK) proofs are
based on Sigma protocols and QAP-based SNARKs. The former is highly efficient for …
based on Sigma protocols and QAP-based SNARKs. The former is highly efficient for …