\textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
From MaRDI portal
Publication:2139630
DOI10.1007/978-3-030-84259-8_4zbMath1497.94075OpenAlexW3190538822MaRDI QIDQ2139630
Peter Scholl, Marc B. Rosen, Alex J. Malozemoff, Carsten Baum
Publication date: 18 May 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84259-8_4
Related Items (20)
Gemini: elastic SNARKs for diverse environments ⋮ Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions ⋮ Actively secure half-gates with minimum overhead under duplex networks ⋮ Actively secure arithmetic computation and VOLE with constant computational overhead ⋮ Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions ⋮ Sok: vector OLE-based zero-knowledge protocols ⋮ Practical sublinear proofs for R1CS from lattices ⋮ Efficient proofs of knowledge for threshold relations ⋮ Efficient proof of RAM programs from any public-coin zero-knowledge system ⋮ Non-interactive secure computation of inner-product from LPN and LWE ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ Reverse firewalls for oblivious transfer extension and applications to zero-knowledge ⋮ Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ Faster sounder succinct arguments and \textsf{IOP}s ⋮ Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation ⋮ Correlated pseudorandomness from expand-accumulate codes ⋮ 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}\) ⋮ Half-tree: halving the cost of tree expansion in COT and DPF ⋮ Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Amortized complexity of information-theoretically secure MPC revisited
- Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free
- Secure computation with constant communication overhead using multiplication embeddings
- Stacked garbling for disjunctive zero-knowledge proofs
- Stacked garbling. Garbled circuit proportional to longest execution path
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
- Efficient pseudorandom correlation generators: silent OT extension and more
- Scalable zero knowledge with no trusted setup
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge
- Two Halves Make a Whole
- Interactive Oracle Proofs
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Fiat-Shamir: from practice to theory
This page was built for publication: \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
