A New Approach to Practical Active-Secure Two-Party Computation
The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Abstract
We propose a new approach to practical two-party computation secure against an active adversary. All prior practical protocols were based on Yao's garbled circuits. We use an OT-based approach and get efficiency via OT extension in the random oracle model. To get a practical protocol we introduce a number of novel techniques for relating the outputs and inputs of OTs in a larger construction. We also report on an implementation of this approach, that shows that our protocol is more efficient than any previous one: For big enough circuits, we can evaluate more than 20000 Boolean gates per second. As an example, evaluating one oblivious AES encryption $$\sim 34000$$ gates takes 64i¾?seconds, but when repeating the task 27i¾?times it only takes less than 3i¾?seconds per instance.
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
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
Universally composable security: a new paradigm for cryptographic protocols
Canetti, R. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959888 · Cited by 3,309
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
Protocols for secure computations
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.88 · Cited by 2,661
Goldreich, O. (2001) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546891 · Cited by 2,181
Foundations of Cryptography: Volume 2, Basic Applications
Goldreich, O. (2004) · Cited by 1,592
Founding crytpography on oblivious transfer
Kilian, J. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62215 · Cited by 1,018
Fairplay—a secure two-party computation system
Malkhi, D., Nisan, N., Pinkas, B., & Sella, Y. (2004) · USENIX Security Symposium · Cited by 846
Extending Oblivious Transfers Efficiently
Ishai, Y., Kilian, J., Nissim, K., & Petrank, E. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_9 · Cited by 746
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
Secure 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
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
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
Founding Cryptography on Oblivious Transfer – Efficiently
Ishai, Y., Prabhakaran, M., & Sahai, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_32 · Cited by 460
Keyword Search and Oblivious Pseudorandom Functions
Freedman, M. J., Ishai, Y., Pinkas, B., & Reingold, O. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_17 · Cited by 441
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
Semi-homomorphic Encryption and Multiparty Computation
Bendlin, R., Damgård, I., Orlandi, C., & Zakarias, S. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_11 · Cited by 354
Self-citationSecure 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
Committed Oblivious Transfer and Private Multi-Party Computation
Crépeau, C., van de Graaf, J., & Tapp, A. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-44750-4_9 · Cited by 160
Two-Output Secure Computation with Malicious Adversaries
shelat, A., & Shen, C.-H. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_22 · Cited by 159
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
Self-citationCryptography 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
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 Arithmetic Computation with No Honest Majority
Ishai, Y., Prabhakaran, M., & Sahai, A. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00457-5_18 · 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
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
Lindell, Y., & Benny Pinkas, B. (2011) · Journal of Cryptology · doi:10.1007/s00145-011-9107-0 · Cited by 128
On Robust Combiners for Oblivious Transfer and Other Primitives
Harnik, D., Kilian, J., Naor, M., et al. (2005) · Lecture notes in computer science · doi:10.1007/11426639_6 · Cited by 119
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
OT-Combiners via Secure Computation
Harnik, D., Ishai, Y., Kushilevitz, E., & Nielsen, J. B. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-78524-8_22 · Cited by 96
Self-citationOn 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
VMCrypt: modular software architecture for scalable secure computation
Malka, L. (2011) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2046707.2046787 · Cited by 88
Financial Cryptography and Data Security - FC 2010
Damgård, I., & Keller, M. (2010) · Bristol Research (University of Bristol) · Cited by 88
Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost
Damgård, I., & Orlandi, C. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14623-7_30 · Cited by 72
Self-citationEfficient and Universally Composable Committed Oblivious Transfer and Applications
Garay, J. A., MACKENZIE, P. D., & Yang, K. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24638-1_17 · Cited by 60
The IPS Compiler: Optimizations, Variants and Concrete Efficiency
Lindell, Y., Oxman, E., & Benny Pinkas, B. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22792-9_15 · Cited by 53
Cited by
Multiparty Computation from Somewhat Homomorphic Encryption
Damgård, I., Pastro, V., Smart, N., & Zakarias, S. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_38 · Cited by 1,331
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
Homomorphic Evaluation of the AES Circuit
Gentry, C., Halevi, S., & Smart, N. P. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_49 · Cited by 796
Secure Multiparty Computation and Secret Sharing
Cramer, R., Damgård, I. B., & Nielsen, J. B. (2015) · doi:10.1017/cbo9781107337756 · Cited by 595
Self-citationSecure Multi-Party Computation: Theory, practice and applications
Zhao, C., Zhao, S., Zhao, M., Chen, Z., Gao, C.-Z., Li, H., & Tan, Y.-A. (2019) · Information Sciences · doi:10.1016/j.ins.2018.10.024 · Cited by 508
Metadata
- Authors
- Nielsen, J. B., Nordholt, P. S., Orlandi, C., & Burra, S. S.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2012
- Pages
- 681-700
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1505629034
- Cited by
- 379
- References
- 35
- FWCI
- 31.02
- 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.