Fast Garbling of Circuits Under Standard Assumptions

106 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Prio: Private, Robust, and Scalable Computation of Aggregate Statistics (2017, background): “That said, there have been great advances in practical general-purpose MPC protocols of late [12,13,23,45,46,73,89,91,93,98].”
Trident: Efficient 4PC Framework for Privacy Preserving Machine Learning (2019, methodology): “We incorporate the recent optimisations including free XOR [?], [44], [45], half-gates [46], [47], fixed-key AES garbling [48].”
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority (2016, background): “We remark that other work on garbled circuits (e.g., two-party Yao with semi-honest adversaries) achieves much lower latency (e.g., 16ms reported in [13]).”
Scalable Private Set Intersection Based on OT Extension (2018, background): “This random OT extension protocol reduces the bits that P 1 has to send from 2 m(cid:96) to 0 at the expense of the stronger assumption that H is modeled as a RO instead of a CRF.”
CrypTFlow2: Practical 2-Party Secure Inference (2020, background): “• On the DNNs considered by prior work on secure inference, our protocols can evaluate the non-linear layers much more efficiently and decrease the total time (Table 5) as well as the online time (Table 6).”