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 …
Revisiting the nova proof system on a cycle of curves
Nova is an efficient recursive proof system built from an elegant folding scheme for (relaxed)
R1CS statements. The original Nova paper (CRYPTO'22) presented Nova using a single …
R1CS statements. The original Nova paper (CRYPTO'22) presented Nova using a single …
From polynomial IOP and commitments to non-malleable zkSNARKs
We study sufficient conditions to compile simulation-extractable zkSNARKs from information-
theoretic interactive oracle proofs (IOP) using a simulation-extractable commit-and-prove …
theoretic interactive oracle proofs (IOP) using a simulation-extractable commit-and-prove …
How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach
Most succinct arguments (SNARKs) are initially only proven knowledge sound (KS). We
show that the commonly employed compilation strategy from polynomial interactive oracle …
show that the commonly employed compilation strategy from polynomial interactive oracle …
Muxproofs: Succinct arguments for machine computation from tuple lookups
Proofs for machine computation allow for proving the correct execution of arbitrary programs
that operate over fixed instruction sets (eg, RISC-V, EVM, Wasm). A standard approach for …
that operate over fixed instruction sets (eg, RISC-V, EVM, Wasm). A standard approach for …
Fiat-shamir bulletproofs are non-malleable (in the random oracle model)
Bulletproofs (Bünz et al. IEEE S&P 2018) are a celebrated ZK proof system that allows for
short and efficient proofs, and have been implemented and deployed in several real-world …
short and efficient proofs, and have been implemented and deployed in several real-world …
Generalized special-sound interactive proofs and their knowledge soundness
A classic result in the theory of interactive proofs shows that a special-sound Σ-protocol is
automatically a proof of knowledge. This result is very useful to have, since the latter …
automatically a proof of knowledge. This result is very useful to have, since the latter …
Simulation-Extractable KZG Polynomial Commitments and Applications to HyperPlonk
B Libert - IACR International Conference on Public-Key …, 2024 - Springer
HyperPlonk is a recent SNARK proposal (Eurocrypt'23) that features a linear-time prover
and supports custom gates of larger degree than Plonk. For the time being, its instantiations …
and supports custom gates of larger degree than Plonk. For the time being, its instantiations …
On Quantum Simulation-Soundness
B Abdolmaleki, C Chevalier, E Ebrahimi… - Cryptology ePrint …, 2023 - eprint.iacr.org
Non-interactive zero-knowledge (NIZK) proof systems are a cornerstone of modern
cryptography, but their security has received little attention in the quantum settings …
cryptography, but their security has received little attention in the quantum settings …