The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer
Open accessAbstract
We consider the task of secure multi-party computation of arithmetic circuits over a finite field. Unlike Boolean circuits, arithmetic circuits allow natural computations on integers to be expressed easily and efficiently. In the strongest setting of malicious security with a dishonest majority --- where any number of parties may deviate arbitrarily from the protocol --- most existing protocols require expensive public-key cryptography for each multiplication in the preprocessing stage of the protocol, which leads to a high total cost. We present a new protocol that overcomes this limitation by using oblivious transfer to perform secure multiplications in general finite fields with reduced communication and computation. Our protocol is based on an arithmetic view of oblivious transfer, with careful consistency checks and other techniques to obtain malicious security at a cost of less than 6 times that of semi-honest security. We describe a highly optimized implementation together with experimental results for up to five parties. By making extensive use of parallelism and SSE instructions, we improve upon previous runtimes for MPC over arithmetic circuits by more than 200 times.
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
How 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
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
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
Efficient Multiparty Protocols Using Circuit Randomization
Beaver, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_34 · Cited by 893
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
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
A Framework for Efficient and Composable Oblivious Transfer
Peikert, C., Vaikuntanathan, V., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_31 · Cited by 678
Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
Damgård, I., Keller, M., Larraia, E., Pastro, V., Scholl, P., & Smart, N. P. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40203-6_1 · Cited by 458
Self-citationA New Approach to Practical Active-Secure Two-Party Computation
Nielsen, J. B., Nordholt, P. S., Orlandi, C., & Burra, S. S. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_40 · Cited by 379
More efficient oblivious transfer and extensions for faster secure computation
Asharov, G., Lindell, Y., Schneider, T., & Zohner, M. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516738 · Cited by 358
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
Faster Private Set Intersection based on OT Extension.Preprint
Benny Pinkas, B., Schneider, T. H., & Zohner, M. (2014) · IACR Cryptology ePrint Archive · Cited by 236
Correlated pseudorandomness and the complexity of private computations
Beaver, D. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237996 · Cited by 233
Gilboa, N. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_8 · Cited by 189
Phasing: Private Set Intersection using Permutation-based Hashing.
Benny Pinkas, B., Schneider, T. H., Segev, G., & Zohner, M. (2015) · Cited by 180
The Simplest Protocol for Oblivious Transfer
Chou, T., & Orlandi, C. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-22174-8_3 · Cited by 165
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
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
Secure floating point arithmetic and private satellite collision analysis
Kamm, L., & Willemson, J. (2014) · International Journal of Information Security · doi:10.1007/s10207-014-0271-8 · Cited by 107
An architecture for practical actively secure MPC with dishonest majority
Keller, M., Schöll, P., & Smart, N. P. (2013) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2508859.2516744 · Cited by 88
Self-citationMultiparty 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
Bogdanov, D., Jõemets, M., Siim, S., & Vaht, M. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-47854-7_14 · Cited by 72
Confidential Benchmarking Based on Multiparty Computation
Damgård, I., Damgård, K., Nielsen, K., Nordholt, P. S., & Toft, T. (2017) · Lecture notes in computer science · doi:10.1007/978-3-662-54970-4_10 · Cited by 67
Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries
Lindell, Y., & Riva, B. (2015) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2810103.2813666 · Cited by 66
Dishonest Majority Multi-Party Computation for Binary Circuits
Larraia, E., Orsini, E., & Smart, N. P. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44381-1_28 · Cited by 66
Self-citationImplementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol
Damgård, I., Keller, M., Larraia, E., Miles, C., & Smart, N. P. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32928-9_14 · Cited by 62
Self-citationAn Analysis of the Blockcipher-Based Hash Functions from PGV
Black, J., Rogaway, P., Shrimpton, T., & Stam, M. (2010) · Journal of Cryptology · doi:10.1007/s00145-010-9071-0 · Cited by 62
A Unified Approach to MPC with Preprocessing Using OT
Frederiksen, T. K., Keller, M., Orsini, E., & Schöll, P. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48797-6_29 · Cited by 57
Self-citationHigh-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer
Burra, S. S., Larraia, E., Nielsen, J. B., Nordholt, P. S., Orlandi, C., Orsini, E., Schöll, P., & Smart, N. P. (2021) · Journal of Cryptology · doi:10.1007/s00145-021-09403-1 · Cited by 47
Self-citationBetter Preprocessing for Secure Multiparty Computation
Baum, C., Damgård, I., Toft, T., & Zakarias, R. W. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-39555-5_18 · Cited by 33
Students and Taxes: a Privacy-Preserving Social Study Using Secure Computation.
Bogdanov, D., Kamm, L., Kubo, B., Rebane, R., Sokk, V., & Talviste, R. (2015) · Cited by 13
Cited by
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
Self-citationThapa, C., & Camtepe, S. (2021) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2020.104130 · Cited by 393
Survey on Fully Homomorphic Encryption, Theory, and Applications
Marcolla, C., Sucasas, V., Manzano, M., Bassoli, R., Fitzek, F. H. P., & Aaraj, N. (2022) · Proceedings of the IEEE · doi:10.1109/jproc.2022.3205665 · Cited by 323
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
Overdrive: Making SPDZ Great Again
Keller, M., Pastro, V., & Rotaru, D. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-78372-7_6 · Cited by 275
Self-citation
Metadata
- Authors
- Keller, M., Orsini, E., & Scholl, P.
- Venue
- Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security
- Publisher
- ACM
- Published
- 2016-10-24
- Volume
- 2016
- Pages
- 830-842
- OpenAlex
- W2539273492
- Cited by
- 411
- References
- 32
- FWCI
- 16.70
- Type
- conference paper
- Language
- en
- Open access
- green
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.