Libra: succinct zero-knowledge proofs with optimal prover computation
From MaRDI portal
Publication:2304944
DOI10.1007/978-3-030-26954-8_24OpenAlexW2969207949MaRDI QIDQ2304944
Dawn Song, Jiaheng Zhang, Yu-Peng Zhang, Tiacheng Xie, Charalampos Papamanthou
Publication date: 9 March 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-26954-8_24
Related Items (35)
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 ⋮ BooLigero: improved sublinear zero knowledge proofs for Boolean circuits ⋮ MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK) ⋮ A simple post-quantum non-interactive zero-knowledge proof from garbled circuits ⋮ Asymptotically quasi-optimal cryptography ⋮ Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier ⋮ Gemini: elastic SNARKs for diverse environments ⋮ HyperPlonk: Plonk with linear-time prover and high-degree custom gates ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Private polynomial commitments and applications to MPC ⋮ Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier ⋮ Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ Faster sounder succinct arguments and \textsf{IOP}s ⋮ \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions ⋮ Proofs for inner pairing products and applications ⋮ Orion: zero knowledge proof with linear prover time ⋮ Nova: recursive zero-knowledge arguments from folding schemes ⋮ Vector commitments over rings and compressed \(\varSigma \)-protocols ⋮ On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives ⋮ A toolbox for barriers on interactive oracle proofs ⋮ Doubly efficient interactive proofs over infinite and non-commutative rings ⋮ 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 ⋮ Boosting verifiable computation on encrypted data ⋮ Flexible and efficient verifiable computation on encrypted data ⋮ Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics ⋮ Spartan: efficient and general-purpose zkSNARKs without trusted setup ⋮ Libra ⋮ TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures ⋮ Zero-knowledge proofs for committed symmetric Boolean functions
Uses Software
This page was built for publication: Libra: succinct zero-knowledge proofs with optimal prover computation
