Scalable zero knowledge with no trusted setup
From MaRDI portal
Publication:2304940
DOI10.1007/978-3-030-26954-8_23OpenAlexW2968027060MaRDI QIDQ2304940
Michael Riabzev, Yinon Horesh, Iddo Bentov, Eli Ben-Sasson
Publication date: 9 March 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-26954-8_23
Related Items (52)
\textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments ⋮ Subquadratic SNARGs in the random oracle model ⋮ An algebraic framework for universal and updatable SNARKs ⋮ Multi-party revocation in sovrin: performance through distributed trust ⋮ Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography ⋮ Updateable Inner Product Argument with Logarithmic Verifier and Applications ⋮ Tight state-restoration soundness in the algebraic group model ⋮ \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions ⋮ Does Fiat-Shamir require a cryptographic hash function? ⋮ SoK: communication across distributed ledgers ⋮ Layering quantum-resistance into classical digital signature algorithms ⋮ Asymptotically quasi-optimal cryptography ⋮ A PCP theorem for interactive proofs and applications ⋮ Polynomial IOPs for Linear Algebra Relations ⋮ Succinct arguments in the quantum random oracle model ⋮ Linear-size constant-query IOPs for delegating computation ⋮ HyperPlonk: Plonk with linear-time prover and high-degree custom gates ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Merkle tree ladder mode: reducing the size impact of NIST PQC signature algorithms in practice ⋮ Resumable zero-knowledge for circuits from symmetric key primitives ⋮ Efficient proofs of knowledge for threshold relations ⋮ Parallelizable delegation from LWE ⋮ Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup ⋮ Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection ⋮ Inner product functional commitments with constant-size public parameters and openings ⋮ Short-lived zero-knowledge proofs and signatures ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions ⋮ Lattice-based inner product argument ⋮ Lower bound on SNARGs in the random oracle model ⋮ Orion: zero knowledge proof with linear prover time ⋮ Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\) ⋮ On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives ⋮ Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II ⋮ GUC-secure commitments via random oracles: new impossibility and feasibility ⋮ \textsc{Poseidon}2: a faster version of the \textsc{Poseidon} hash function ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ \textsf{Orbweaver}: succinct linear functional commitments from lattices ⋮ \texttt{Horst} meets \textit{Fluid}-SPN: Griffin for zero-knowledge applications ⋮ Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes ⋮ Tight security bounds for Micali's SNARGs ⋮ Security of the Poseidon hash function against non-binary differential and linear attacks ⋮ Transparent SNARKs from DARK compilers ⋮ Marlin: preprocessing zkSNARKs with universal and updatable SRS ⋮ \textsc{Fractal}: post-quantum and transparent recursive proofs from holography ⋮ Stacked garbling for disjunctive zero-knowledge proofs ⋮ On succinct arguments and witness encryption from groups ⋮ A non-PCP approach to succinct quantum-safe zero-knowledge ⋮ New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust ⋮ Spartan: efficient and general-purpose zkSNARKs without trusted setup ⋮ Privacy-preserving data aggregation with probabilistic range validation
This page was built for publication: Scalable zero knowledge with no trusted setup
