The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Efficient Garbling from a Fixed-Key Blockcipher
Open accessAbstract
We advocate schemes based on fixed-key AES as the best route to highly efficient circuit-garbling. We provide such schemes making only one AES call per garbled-gate evaluation. On the theoretical side, we justify the security of these methods in the random-permutation model, where parties have access to a public random permutation. On the practical side, we provide the Just Garble system, which implements our schemes. Just Garble evaluates moderate-sized garbled-circuits at an amortized cost of 23.2 cycles per gate (7.25 nsec), far faster than any prior reported results.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
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
Protocols for secure computations
Yao, A. C. (1982) · 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · doi:10.1109/sfcs.1982.38 · Cited by 3,306
Handbook of Applied Cryptography
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (2018) · CRC Press eBooks · doi:10.1201/9781439821916 · Cited by 2,896
Protocols for secure computations
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.88 · Cited by 2,661
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
A 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
Foundations of garbled circuits
Bellare, M., Hoang, V. T., & Rogaway, P. (2012) · Proceedings of the 2012 ACM conference on Computer and communications security · doi:10.1145/2382196.2382279 · Cited by 541
Self-citationSecure Multiparty Computation Goes Live
Bogetoft, P., Christensen, D. L., Damgård, I., Geisler, M., Jakobsen, T., Krøigaard, M., Nielsen, J. D., Nielsen, J. B., Nielsen, K., Pagter, J., et al. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03549-4_20 · Cited by 539
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
Canright, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/11545262_32 · Cited by 530
FairplayMP: a system for secure multi-party computation
Ben-David, A., Nisan, N., & Pinkas, B. (2008) · Proceedings of the 15th ACM conference on Computer and communications security · doi:10.1145/1455770.1455804 · Cited by 475
Maurer, U. M., Renner, R., & Holenstein, C. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24638-1_2 · Cited by 474
TASTY: tool for automating secure two-party computations
Henecka, W., K ögl, S., Sadeghi, A.-R., Schneider, T., & Wehrenberg, I. (2010) · Proceedings of the 17th ACM conference on Computer and communications security · doi:10.1145/1866307.1866358 · Cited by 356
(2010) · Cited by 291
LEGO for Two-Party Secure Computation
Nielsen, J. B., & Orlandi, C. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00457-5_22 · Cited by 158
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
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
Lindell, Y., Benny Pinkas, B., & Smart, N. P. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85855-3_2 · Cited by 142
A Secure One-Way Hash Function Built from DES
Winternitz, R. S. (1984) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.1984.10027 · Cited by 105
Salvaging Merkle-Damgård for Practical Applications
Dodis, Y., Ristenpart, T., & Shrimpton, T. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01001-9_22 · Cited by 104
Choi, S. G., Hwang, K.-W., Katz, J. I., Malkin, T., & Rubenstein, D. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-27954-6_26 · Cited by 102
On the Security of the “Free-XOR” Technique
Choi, S. G., Katz, J. I., Kumaresan, R., & Zhou, H.-S. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28914-9_3 · Cited by 94
Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
Rogaway, P., & Steinberger, J. P. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85174-5_24 · Cited by 88
Self-citationCryptography and cryptographic protocols
Goldreich, O. (2003) · Distributed Computing · doi:10.1007/s00446-002-0077-1 · Cited by 63
SCAPI: The Secure Computation Application Programming Interface.
Ejgenberg, Y., Farbstein, M., Levy, M., & Lindell, Y. (2012) · Cited by 58
Garbling XOR Gates “For Free” in the Standard Model
Applebaum, B. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-36594-2_10 · Cited by 27
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
ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation
Demmler, D., Schneider, T., & Zohner, M. (2015) · Proceedings 2015 Network and Distributed System Security Symposium · doi:10.14722/ndss.2015.23113 · Cited by 827
Machine Learning Classification over Encrypted Data
Bost, R., Popa, R. A., Tu, S., & Goldwasser, S. (2015) · Proceedings 2015 Network and Distributed System Security Symposium · doi:10.14722/ndss.2015.23241 · Cited by 674
MP-SPDZ: A Versatile Framework for Multi-Party Computation
Keller, M. (2020) · Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3372297.3417872 · Cited by 496
Chameleon: A Hybrid Secure Computation Framework for Machine Learning Applications
Riazi, M. S., Weinert, C., Tkachenko, O., Songhori, E. M., Schneider, T., & Koushanfar, F. (2018) · Proceedings of the 2018 on Asia Conference on Computer and Communications Security · doi:10.1145/3196494.3196522 · Cited by 410
Metadata
- Authors
- Bellare, M., Hoang, V. T., Keelveedhi, S., & Rogaway, P.
- Venue
- 2013 IEEE Symposium on Security and Privacy
- Publisher
- IEEE
- Published
- 2013-05
- Pages
- 478-492
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2134340933
- Cited by
- 304
- References
- 32
- FWCI
- 21.47
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.