Ligero: lightweight sublinear arguments without a trusted setup
From MaRDI portal
Recommendations
- Scalable zero knowledge with no trusted setup
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Aurora: transparent succinct arguments for R1CS
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
Cites work
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- scientific article; zbMATH DE number 7650353 (Why is no real title available?)
- Additive Fast Fourier Transforms Over Finite Fields
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Algebraic methods for interactive proof systems
- Aurora: transparent succinct arguments for R1CS
- BBQ: using AES in Picnic signatures
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
- Computational integrity with a public random string from quasi-linear PCPs
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- Constant-round interactive proofs for delegating computation
- Cryptography with constant computational overhead
- Delegating computation: interactive proofs for muggles
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Fast Reed-Solomon interactive oracle proofs of proximity
- Faster sounder succinct arguments and \textsf{IOP}s
- Fiat-Shamir: from practice to theory
- Founding Cryptography on Oblivious Transfer – Efficiently
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Interactive PCP
- Interactive oracle proofs
- Interactive oracle proofs with constant rate and query complexity
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Linear Algebra with Sub-linear Zero-Knowledge Arguments
- Linear-time arguments with sublinear verification from tensor codes
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Locally computable UOWHF with linear shrinkage
- Low-complexity cryptographic hash functions
- Nearly-linear size holographic proofs
- On Efficient Zero-Knowledge PCPs
- On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives
- On linear-size pseudorandom generators and hardcore functions
- On the concrete efficiency of probabilistically-checkable proofs
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Practical verified computation with streaming interactive proofs
- Probabilistic checking of proofs
- Probabilistically checkable proofs of proximity with zero-knowledge
- Proof verification and the hardness of approximation problems
- Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
- Quadratic span programs and succinct NIZKs without PCPs
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Recursive proof composition from accumulation schemes
- SPARKs: succinct parallelizable arguments of knowledge
- Scalable Secure Multiparty Computation
- Scalable zero knowledge with no trusted setup
- Secure Arithmetic Computation with No Honest Majority
- Short pairing-based non-interactive zero-knowledge arguments
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Succinct arguments from multi-prover interactive proofs and their efficiency benefits
- Succinct non-interactive arguments via linear interactive proofs
- The knowledge complexity of interactive proof-systems
- Time- and space-efficient arguments from groups of unknown order
- Time-optimal interactive proofs for circuit evaluation
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- Zero-knowledge proofs from secure multiparty computation
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
Cited in
(19)- Efficient transparent polynomial commitments for zk-SNARKs
- Threshold computation in the head: improved framework for post-quantum signatures and zero-knowledge arguments
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs
- ZK-for-Z2K: MPC-in-the-head zero-knowledge proofs for \(\mathbb{Z}_{2^k}\)
- Proximity gaps for Reed-Solomon codes
- Witness-succinct universally-composable SNARKs
- A crack in the firmament: restoring soundness of the Orion proof system and more
- \textsf{Orbweaver}: succinct linear functional commitments from lattices
- \texttt{Horst} meets \textit{Fluid}-SPN: Griffin for zero-knowledge applications
- SNARK lower bounds via communication complexity
- LaBRADOR: compact proofs for R1CS from Module-SIS
- Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
- Unlocking the lookup singularity with \textsf{Lasso}
- Blaze: fast SNARKs from interleaved RAA codes
- Succinct arguments over towers of binary fields
- An efficient ZK compiler from SIMD circuits to general circuits
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
This page was built for publication: Ligero: lightweight sublinear arguments without a trusted setup
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6063128)
