Efficient arithmetic in garbled circuits

DOI10.1007/978-3-031-58740-5_1MaRDI QIDQ6637536zbMATH OpenFDO

Authors David G. Heath

Publication date 13 November 2024

zbMATH Keywords

arithmetic circuitsgarbled circuits

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• scientific article; zbMATH DE number 176564 (Why is no real title available?)
• 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?
• 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

(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)