Efficient arithmetic in garbled circuits
From MaRDI portal
Publication:6637536
DOI10.1007/978-3-031-58740-5_1MaRDI QIDQ6637536
Publication date: 13 November 2024
Cites Work
- Title not available (Why is that?)
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- Arithmetic garbling from bilinear maps
- Fast garbling of circuits under standard assumptions
- Integer multiplication in time \(O(n\log n)\)
- FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR
- On the Security of the “Free-XOR” Technique
- Two Halves Make a Whole
- Improved Garbled Circuit: Free XOR Gates and Applications
- Secure Two-Party Computation Is Practical
- How to Garble RAM Programs?
- How to Garble Arithmetic Circuits
- New ways to garble arithmetic circuits
- Half-tree: halving the cost of tree expansion in COT and DPF
- Tri-state circuits. A circuit model that captures RAM
Related Items (2)
Garbled circuit lookup tables with logarithmic number of ciphertexts ⋮ Scalable multiparty computation from non-linear secret sharing
This page was built for publication: Efficient arithmetic in garbled circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637536)
