Stacked garbling for disjunctive zero-knowledge proofs
From MaRDI portal
Publication:2055668
DOI10.1007/978-3-030-45727-3_19OpenAlexW3012999251MaRDI QIDQ2055668
Vladimir Kolesnikov, David G. Heath
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45727-3_19
Related Items
Threshold Schnorr with stateless deterministic signing from standard assumptions, \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions, Garbled circuits with sublinear evaluator, Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier, Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions, PrORAM, Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions, Sok: vector OLE-based zero-knowledge protocols, Efficient proofs of knowledge for threshold relations, NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead, Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation, \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication, \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation, Masked triples. Amortizing multiplication triples across conditionals, Stacked garbling. Garbled circuit proportional to longest execution path, TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Improved OR-Composition of Sigma-Protocols
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
- Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge
- Two Halves Make a Whole
- One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
- Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract)
- Improved Garbled Circuit: Free XOR Gates and Applications
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- The knowledge complexity of interactive proof-systems
- Quadratic Span Programs and Succinct NIZKs without PCPs
- How to Garble RAM Programs?
- On the Size of Pairing-Based Non-interactive Arguments
