BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
From MaRDI portal
Publication:2145410
DOI10.1007/978-3-662-64322-8_23zbMath1492.94119OpenAlexW3211202543MaRDI QIDQ2145410
Yaron Gvili, Sarah Scheffler, Mayank Varia
Publication date: 17 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-662-64322-8_23
Cryptography (94A60) Switching theory, applications of Boolean algebras to circuits and networks (94C11)
Related Items (2)
On interactive oracle proofs for Boolean R1CS statements ⋮ Ligero: lightweight sublinear arguments without a trusted setup
Uses Software
Cites Work
- Unnamed Item
- Updatable and universal common reference strings with applications to zk-SNARKs
- Privacy-free garbled circuits for formulas: size zero and information-theoretic
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Aurora: transparent succinct arguments for R1CS
- Libra: succinct zero-knowledge proofs with optimal prover computation
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- Interactive Oracle Proofs
- Interactive PCP
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
- Separating succinct non-interactive arguments from all falsifiable assumptions
- On the Size of Pairing-Based Non-interactive Arguments
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
This page was built for publication: BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
