Ligero: lightweight sublinear arguments without a trusted setup
From MaRDI portal
Publication:6063128
DOI10.1007/S10623-023-01222-8zbMath1527.94013OpenAlexW4384200977MaRDI QIDQ6063128
Muthuramakrishnan Venkitasubramaniam, Carmit Hazay, Yuval Ishai, Scott Ames
Publication date: 7 November 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-023-01222-8
Linear codes (general theory) (94B05) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Analytic circuit theory (94C05) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (6)
Witness-succinct universally-composable SNARKs ⋮ Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ \textsf{Orbweaver}: succinct linear functional commitments from lattices ⋮ \texttt{Horst} meets \textit{Fluid}-SPN: Griffin for zero-knowledge applications ⋮ LaBRADOR: compact proofs for R1CS from Module-SIS ⋮ Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On linear-size pseudorandom generators and hardcore functions
- BBQ: using AES in Picnic signatures
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- SPARKs: succinct parallelizable arguments of knowledge
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Recursive proof composition from accumulation schemes
- Linear-time arguments with sublinear verification from tensor codes
- Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
- Time- and space-efficient arguments from groups of unknown order
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Locally computable UOWHF with linear shrinkage
- Nearly-linear size holographic proofs
- Practical verified computation with streaming interactive proofs
- Time-Optimal Interactive Proofs for Circuit Evaluation
- On Efficient Zero-Knowledge PCPs
- Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Proof verification and the hardness of approximation problems
- Delegating Computation
- Interactive Oracle Proofs
- Linear Algebra with Sub-linear Zero-Knowledge Arguments
- Interactive PCP
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Zero-Knowledge Proofs from Secure Multiparty Computation
- Founding Cryptography on Oblivious Transfer – Efficiently
- Secure Arithmetic Computation with No Honest Majority
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Probabilistic checking of proofs
- Algebraic methods for interactive proof systems
- The knowledge complexity of interactive proof-systems
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
- Fiat-Shamir: from practice to theory
- Computational Integrity with a Public Random String from Quasi-Linear PCPs
- Additive Fast Fourier Transforms Over Finite Fields
- Constant-round interactive proofs for delegating computation
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- On the concrete efficiency of probabilistically-checkable proofs
- Probabilistically Checkable Proofs of Proximity with Zero-Knowledge
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Scalable Secure Multiparty Computation
- Faster sounder succinct arguments and \textsf{IOP}s
- On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives
This page was built for publication: Ligero: lightweight sublinear arguments without a trusted setup
