Efficient Secure Computation with Garbled Circuits

By Yan Huang, Chih-Hao Shen, David E. Evans, Jonathan Katz, Abhi Shelat. 2011

135 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

How researchers see this paper

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

In Artificial Intelligence

1. David E. Evans
2. Samee Zahur
3. Adrià Gascón
4. Mihir Bellare
5. Sriram Keelveedhi
6. Phillip Rogaway
7. Mariana Raykova
8. Borja Balle

In Computational Theory and Mathematics

1. David E. Evans
2. Adrià Gascón
3. Samee Zahur
4. Mariana Raykova
5. Phillipp Schoppmann
6. Borja Balle
7. Jack Doerner
8. Mihir Bellare

Citations in the corpus

• Privacy-Preserving Distributed Linear Regression on High-Dimensional Data (2017, background): “This selective failure attack has been discussed thoroughly in the context of garbled circuits [38, 53].”
• Efficient Garbling from a Fixed-Key Blockcipher (2013, background): “Beginning with Fairplay [32], a bit of a cottage industry has emerged to improve the efficiency and practicality of GC-based MPC [2, 7, 9, 10, 12, 17, 22– 24, 28, 29, 31, 36, 37].”