Stacked garbling. Garbled circuit proportional to longest execution path
From MaRDI portal
Publication:2096548
DOI10.1007/978-3-030-56880-1_27OpenAlexW4245814547MaRDI QIDQ2096548
Vladimir Kolesnikov, David G. Heath
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56880-1_27
Related Items
\textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions, A simple post-quantum non-interactive zero-knowledge proof from garbled circuits, Garbled circuits with sublinear evaluator, Secure multiparty computation with free branching, Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions, PrORAM, Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions, NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead, Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation, \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation, Masked triples. Amortizing multiplication triples across conditionals
Cites Work
- More efficient universal circuit constructions
- Overlaying conditional circuit clauses for secure computation
- Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free
- Stacked garbling for disjunctive zero-knowledge proofs
- Valiant's universal circuits revisited: an overall improvement and a lower bound
- Fast garbling of circuits under standard assumptions
- A minimal model for secure computation (extended abstract)
- Valiant’s Universal Circuit is Practical
- FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR
- On the Security of the “Free-XOR” Technique
- Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge
- Two Halves Make a Whole
- Improved Garbled Circuit: Free XOR Gates and Applications
- Secure Two-Party Computation Is Practical
- Universal circuits (Preliminary Report)
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology - CRYPTO 2003
