The DOI matches its Crossref record; 52 of the 52 references it cites were found in a registry or an index.
Foundations of garbled circuits
Abstract
Garbled circuits, a classical idea rooted in the work of Yao, have long been understood as a cryptographic technique, not a cryptographic goal. Here we cull out a primitive corresponding to this technique. We call it a garbling scheme. We provide a provable-security treatment for garbling schemes, endowing them with a versatile syntax and multiple security definitions. The most basic of these, privacy, suffices for two-party secure function evaluation (SFE) and private function evaluation (PFE). Starting from a PRF, we provide an efficient garbling scheme achieving privacy and we analyze its concrete security. We next consider obliviousness and authenticity, properties needed for private and verifiable outsourcing of computation. We extend our scheme to achieve these ends. We provide highly efficient blockcipher-based instantiations of both schemes. Our treatment of garbling schemes presages more efficient garbling, more rigorous analyses, and more modularly designed higher-level protocols.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
Self-citationHow to generate and exchange secrets
Yao, A. C.-C. (1986) · 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) · doi:10.1109/sfcs.1986.25 · Cited by 3,733
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Protocols for secure computations
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.88 · Cited by 2,661
(2011) · IEEE Software · doi:10.1109/ms.2011.67 · Cited by 1,989
Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
Gennaro, R., Gentry, C., & Parno, B. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_25 · Cited by 1,145
Fairplay—a secure two-party computation system
Malkhi, D., Nisan, N., Benny Pinkas, B., & Sella, Y. (2004) · Cited by 782
Privacy preserving auctions and mechanism design
Naor, M., Pinkas, B., & Sumner, R. (1999) · Proceedings of the 1st ACM conference on Electronic commerce · doi:10.1145/336992.337028 · Cited by 753
Improved Garbled Circuit: Free XOR Gates and Applications
Kolesnikov, V., & Schneider, T. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70583-3_40 · Cited by 743
The round complexity of secure protocols
Beaver, D., Micali, S., & Rogaway, P. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100287 · Cited by 721
Self-citationSecure Two-Party Computation Is Practical
Pinkas, B., Schneider, T., Smart, N. P., & Williams, S. C. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_15 · Cited by 711
The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
Bellare, M., & Rogaway, P. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_25 · Cited by 672
Self-citationA Proof of Security of Yao’s Protocol for Two-Party Computation
Lindell, Y., & Pinkas, B. (2009) · Journal of Cryptology · doi:10.1007/s00145-008-9036-8 · Cited by 651
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
Applebaum, B., Cash, D., Peikert, C., & Sahai, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_35 · Cited by 562
Faster Secure Two-Party Computation Using Garbled Circuits
Huang, Y., Evans, D., Katz, J. I., & Malka, L. (2011) · doi:10.18130/v3hj5c · Cited by 532
Structured Encryption and Controlled Disclosure
Chase, M., & Kamara, S. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17373-8_33 · Cited by 520
Cryptographic techniques for privacy-preserving data mining
Pinkas, B. (2002) · ACM SIGKDD Explorations Newsletter · doi:10.1145/772862.772865 · Cited by 430
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
Lindell, Y., & Pinkas, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72540-4_4 · Cited by 427
Circular-Secure Encryption from Decision Diffie-Hellman
Boneh, D., Halevi, S., Hamburg, M., & Ostrovsky, R. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_7 · Cited by 293
A Leakage-Resilient Mode of Operation
Pietrzak, K. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01001-9_27 · Cited by 261
Ishai, Y., & Kushilevitz, E. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892118 · Cited by 254
A minimal model for secure computation (extended abstract)
Feige, U., Killian, J., & Naor, M. (1994) · Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 · doi:10.1145/195058.195408 · Cited by 251
Applebaum, B., Ishai, Y., & Kushilevitz, E. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539705446950 · Cited by 215
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
Aumann, Y., & Lindell, Y. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70936-7_8 · Cited by 211
Privacy preserving error resilient dna searching through oblivious automata
Troncoso-Pastoriza, J. R., Katzenbeisser, S., & Celik, M. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315309 · Cited by 202
From Secrecy to Soundness: Efficient Verification via Secure Computation: (Extended Abstract)
Applebaum, B., Ishai, Y., & Kushilevitz, E. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14165-2_14 · Cited by 198
Worry-free encryption: functional encryption with public keys
Sahai, A., & Seyalioglu, H. (2010) · Proceedings of the 17th ACM conference on Computer and communications security · doi:10.1145/1866307.1866359 · Cited by 177
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
Lindell, Y., & Pinkas, B. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19571-6_20 · Cited by 175
Outsourcing Multi-Party Computation.Preprint
Kamara, S., Mohassel, P., & Raykova, M. (2011) · IACR Cryptology ePrint Archive · Cited by 172
Universal circuits (Preliminary Report)
Valiant, L. G. (1976) · Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76 · doi:10.1145/800113.803649 · Cited by 170
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials
Ishai, Y., & Kushilevitz, E. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45465-9_22 · Cited by 165
Communication preserving protocols for secure function evaluation
Naor, M., & Nissim, K. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380855 · Cited by 165
Cryptography with constant computational overhead
Ishai, Y., Kushilevitz, E., Ostrovsky, R., & Sahai, A. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374438 · Cited by 158
Efficiency Tradeoffs for Malicious Two-Party Computation
Mohassel, P., & Franklin, M. (2006) · Lecture notes in computer science · doi:10.1007/11745853_30 · Cited by 154
Efficient Secure Computation with Garbled Circuits
Huang, Y., Shen, C.-H., Evans, D., Katz, J. I., & Shelat, A. A. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25560-1_2 · Cited by 146
Secure circuit evaluation: A protocol based on hiding information from an oracle
Abadi, M., & Feigenbaum, J. (1990) · Journal of Cryptology · doi:10.1007/bf02252866 · Cited by 145
Billion-Gate Secure Computation with Malicious AdversariesPreprint
Kreuter, B., Shelat, A. A., & Shen, C.-H. (2012) · IACR Cryptology ePrint Archive · Cited by 145
Secure Evaluation of Private Linear Branching Programs with Medical Applications
Barni, M., Failla, P., Kolesnikov, V., Lazzeretti, R., Sadeghi, A., & Schneider, T. H. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04444-1_26 · Cited by 144
COMPUTATIONALLY PRIVATE RANDOMIZING POLYNOMIALS AND THEIR APPLICATIONS
Applebaum, B., Ishai, Y., & Kushilevitz, E. (2006) · Computational Complexity · doi:10.1007/s00037-006-0211-8 · Cited by 143
Bounded Key-Dependent Message Security
Barak, B., Haitner, I., Hofheinz, D., & Ishai, Y. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13190-5_22 · Cited by 141
Applebaum, B. (2013) · Information security and cryptography · doi:10.1007/978-3-642-17367-7_4 · Cited by 136
One-Round Secure Computation and Secure Autonomous Mobile Agents
Cachin, C., Camenisch, J. L., Kilian, J., & Müller, J. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45022-x_43 · Cited by 135
A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
Kolesnikov, V., & Schneider, T. H. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85230-8_7 · Cited by 112
Efficient Two Party and Multi Party Computation Against Covert Adversaries
Goyal, V., Mohassel, P., & Smith, A. (2008) · Springer eBooks · doi:10.1007/978-3-540-78967-3_17 · Cited by 104
How to Garble Arithmetic Circuits
Applebaum, B., Ishai, Y., & Kushilevitz, E. (2011) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2011.40 · Cited by 85
Secure text processing with applications to private DNA matching
Katz, J. I., & Malka, L. (2010) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1866307.1866361 · Cited by 82
Key-Dependent Message Security: Generic Amplification and Completeness
Applebaum, B. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20465-4_29 · Cited by 78
Cryptography and cryptographic protocols
Goldreich, O. (2003) · Distributed Computing · doi:10.1007/s00446-002-0077-1 · Cited by 63
Sadeghi, A., & Schneider, T. H. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00730-9_21 · Cited by 51
Secure function evaluation with ordered binary decision diagrams
Kruger, L., Jha, S., Goh, E.-J., & Boneh, D. (2006) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1180405.1180455 · Cited by 51
Privacy-preserving credit checking
Frikken, K. B., Atallah, M. J., & Zhang, C. (2005) · ACM Conference on Electronic Commerce (EC) · doi:10.1145/1064009.1064025 · Cited by 33
Practical Secure Function Evaluation
Schneider, T. H. (2008) · Informatiktage · Cited by 24
Cited by
SecureML: A System for Scalable Privacy-Preserving Machine Learning
Mohassel, P., & Zhang, Y. (2017) · 2017 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2017.12 · Cited by 1,936
“We require the garbling scheme to satisfy the standard security properties formalized in [13].”
MethodAttribute-based encryption for circuits
Gorbunov, S., Vaikuntanathan, V., & Wee, H. (2013) · Proceedings of the forty-fifth annual ACM symposium on Theory of Computing · doi:10.1145/2488608.2488677 · Cited by 406
Two Halves Make a Whole: Reducing Data Transfer in Garbled Circuits Using Half Gates
Zahur, S., Rosulek, M., & Evans, D. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46803-6_8 · Cited by 367
Attribute-Based Encryption for Circuits from Multilinear Maps
Garg, S., Gentry, C., Halevi, S., Sahai, A., & Waters, B. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40084-1_27 · Cited by 328
A Pragmatic Introduction to Secure Multi-Party Computation
Evans, D., Kolesnikov, V., & Rosulek, M. (2018) · Foundations and Trends® in Privacy and Security · doi:10.1561/3300000019 · Cited by 321
Metadata
- Authors
- Bellare, M., Hoang, V. T., & Rogaway, P.
- Venue
- Proceedings of the 2012 ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 2012-10-16
- Pages
- 784-796
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2170696315
- Cited by
- 541
- References
- 52
- FWCI
- 31.51
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.