\textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation
From MaRDI portal
Publication:2056778
DOI10.1007/978-3-030-77883-5_1OpenAlexW3170372235MaRDI QIDQ2056778
Vladimir Kolesnikov, David G. Heath
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77883-5_1
Related Items (5)
Garbled circuits with sublinear evaluator ⋮ Secure multiparty computation with free branching ⋮ 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
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
- Stacked garbling. Garbled circuit proportional to longest execution path
- Valiant's universal circuits revisited: an overall improvement and a lower bound
- Efficient and scalable universal circuits
- Fast garbling of circuits under standard assumptions
- Valiant’s Universal Circuit is Practical
- On the Security of the “Free-XOR” Technique
- Two Halves Make a Whole
- Improved Garbled Circuit: Free XOR Gates and Applications
- Universal circuits (Preliminary Report)
This page was built for publication: \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation
