Efficient arithmetic in garbled circuits
From MaRDI portal
Cites work
- Arithmetic garbling from bilinear maps
- Fast garbling of circuits under standard assumptions
- Flexor: Flexible garbling for XOR gates that beats free-XOR
- Half-tree: halving the cost of tree expansion in COT and DPF
- How to Garble Arithmetic Circuits
- How to garble RAM programs?
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- Improved Garbled Circuit: Free XOR Gates and Applications
- Integer multiplication in time \(O(n\log n)\)
- New ways to garble arithmetic circuits
- On the security of the ``Free-XOR technique
- Secure two-party computation is practical
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- Tri-state circuits. A circuit model that captures RAM
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
Cited in
(10)- Garbled circuit lookup tables with logarithmic number of ciphertexts
- Scalable multiparty computation from non-linear secret sharing
- \textsf{PicoGRAM}: practical garbled RAM from decisional Diffie-Hellman
- (1/ )-rate Boolean garbling scheme from generic groups
- A unified framework for succinct garbling from homomorphic secret sharing
- Breaking the 1/ -rate barrier for arithmetic garbling
- Efficient mixed garbling from homomorphic secret sharing and GGM-tree
- Securely instantiating `Half Gates' garbling in the standard model
- Rate-1 arithmetic garbling from homomorphic secret sharing
- \textsf{Zebra}: arithmetic garbled RAM for large words from DCR
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)
