Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
From MaRDI portal
Publication:5739207
DOI10.1007/978-3-662-49896-5_12zbMath1369.94520OpenAlexW2473389213WikidataQ62047243 ScholiaQ62047243MaRDI QIDQ5739207
Jonathan Bootle, Jens Groth, Andrea Cerulli, Pyrros Chaidos, Christophe Petit
Publication date: 15 July 2016
Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)
Full work available at URL: http://link.springer.com/10.1007/978-3-662-49896-5_12
Related Items (81)
Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols ⋮ DualRing: generic construction of ring signatures with efficient instantiations ⋮ \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments ⋮ Proof-carrying data without succinct arguments ⋮ Subquadratic SNARGs in the random oracle model ⋮ Sumcheck arguments and their applications ⋮ An algebraic framework for universal and updatable SNARKs ⋮ Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography ⋮ Updateable Inner Product Argument with Logarithmic Verifier and Applications ⋮ Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions ⋮ Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices ⋮ A compressed \(\varSigma \)-protocol theory for lattices ⋮ Tight state-restoration soundness in the algebraic group model ⋮ Lattice-based zero-knowledge arguments for additive and multiplicative relations ⋮ Efficient lattice-based polynomial evaluation and batch ZK arguments ⋮ Compressing proofs of \(k\)-out-of-\(n\) partial knowledge ⋮ Time- and space-efficient arguments from groups of unknown order ⋮ Generic plaintext equality and inequality proofs ⋮ BooLigero: improved sublinear zero knowledge proofs for Boolean circuits ⋮ High-threshold AVSS with optimal communication complexity ⋮ MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK) ⋮ More efficient amortization of exact zero-knowledge proofs for LWE ⋮ A simple post-quantum non-interactive zero-knowledge proof from garbled circuits ⋮ Improved zero-knowledge argument of encrypted extended permutation ⋮ Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier ⋮ Gemini: elastic SNARKs for diverse environments ⋮ Making Private Function Evaluation Safer, Faster, and Simpler ⋮ Polynomial IOPs for Linear Algebra Relations ⋮ ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines ⋮ Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle ⋮ An optimized inner product argument with more application scenarios ⋮ Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures ⋮ On interactive oracle proofs for Boolean R1CS statements ⋮ Witness-succinct universally-composable SNARKs ⋮ Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions ⋮ Supersingular curves you can trust ⋮ Spartan and bulletproofs are simulation-extractable (for free!) ⋮ A survey of elliptic curves for proof systems ⋮ Resumable zero-knowledge for circuits from symmetric key primitives ⋮ DualDory: logarithmic-verifier linkable ring signatures through preprocessing ⋮ Efficient unique ring signatures from lattices ⋮ On the impossibility of algebraic vector commitments in pairing-free groups ⋮ Trustworthy sealed-bid auction with low communication cost atop blockchain ⋮ Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup ⋮ Counting vampires: from univariate sumcheck to updatable ZK-SNARK ⋮ Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier ⋮ Fiat-Shamir transformation of multi-round interactive proofs (Extended version) ⋮ Inner product functional commitments with constant-size public parameters and openings ⋮ MyOPE: malicious security for oblivious polynomial evaluation ⋮ What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable? ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs ⋮ \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions ⋮ Proofs for inner pairing products and applications ⋮ Lattice-based inner product argument ⋮ Lower bound on SNARGs in the random oracle model ⋮ Nova: recursive zero-knowledge arguments from folding schemes ⋮ Threshold signatures with private accountability ⋮ Quantum rewinding for many-round protocols ⋮ Fiat-Shamir transformation of multi-round interactive proofs ⋮ Vector commitments over rings and compressed \(\varSigma \)-protocols ⋮ \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation ⋮ Lattice-based succinct arguments from vanishing polynomials (extended abstract) ⋮ \textsf{Orbweaver}: succinct linear functional commitments from lattices ⋮ Correlation intractability and SNARGs from sub-exponential DDH ⋮ Algebraic reductions of knowledge ⋮ On the impossibility of algebraic NIZK in pairing-free groups ⋮ LaBRADOR: compact proofs for R1CS from Module-SIS ⋮ Succinct Diophantine-satisfiability arguments ⋮ Public-key generation with verifiable randomness ⋮ Dory: efficient, transparent arguments for generalised inner products and polynomial commitments ⋮ Transparent SNARKs from DARK compilers ⋮ Marlin: preprocessing zkSNARKs with universal and updatable SRS ⋮ On succinct arguments and witness encryption from groups ⋮ A non-PCP approach to succinct quantum-safe zero-knowledge ⋮ Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics ⋮ Spartan: efficient and general-purpose zkSNARKs without trusted setup ⋮ Computational Integrity with a Public Random String from Quasi-Linear PCPs ⋮ TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures ⋮ Zero-knowledge proofs for committed symmetric Boolean functions
This page was built for publication: Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
