Stacked garbling. Garbled circuit proportional to longest execution path
From MaRDI portal
Publication:2096548
Cites work
- A minimal model for secure computation (extended abstract)
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology – CRYPTO 2004
- Fast garbling of circuits under standard assumptions
- Flexor: Flexible garbling for XOR gates that beats free-XOR
- Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free
- Improved Garbled Circuit: Free XOR Gates and Applications
- More efficient universal circuit constructions
- On the security of the ``Free-XOR technique
- Overlaying conditional circuit clauses for secure computation
- Privacy-free garbled circuits with applications to efficient zero-knowledge
- Secure two-party computation is practical
- Stacked garbling for disjunctive zero-knowledge proofs
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
- Universal circuits (Preliminary Report)
- Valiant's universal circuit is practical
- Valiant's universal circuits revisited: an overall improvement and a lower bound
Cited in
(19)- \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation
- Masked triples. Amortizing multiplication triples across conditionals
- \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
- A new approach to garbled circuits
- Geometry-based garbled circuits relying solely on one evaluation algorithm under standard assumption
- Garbled circuit lookup tables with logarithmic number of ciphertexts
- Bitwise garbling schemes. A model with \(\frac{3}{2}\lambda \)-bit lower bound of ciphertexts
- Silent circuit relinearisation: sublinear-size (Boolean and arithmetic) garbled circuits from DCR
- Efficient mixed garbling from homomorphic secret sharing and GGM-tree
- Efficient garbled pseudorandom functions and lookup tables from minimal assumption
- Non-interactive secure computation with constant communication overhead
This page was built for publication: Stacked garbling. Garbled circuit proportional to longest execution path
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096548)
