The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
Open accessAbstract
SPDZ (pronounced “Speedz”) is the nickname of the MPC protocol of Damgård et al. from Crypto 2012. In this paper we both resolve a number of open problems with SPDZ; and present several theoretical and practical improvements to the protocol. In detail, we start by designing and implementing a covertly secure key generation protocol for obtaining a BGV public key and a shared associated secret key. We then construct both a covertly and actively secure preprocessing phase, both of which compare favourably with previous work in terms of efficiency and provable security. We also build a new online phase, which solves a major problem of the SPDZ protocol: namely prior to this work preprocessed data could be used for only one function evaluation and then had to be recomputed from scratch for the next evaluation, while our online phase can support reactive functionalities. This improvement comes mainly from the fact that our construction does not require players to reveal the MAC keys to check correctness of MAC’d values. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
Modular multiplication without trial division
Montgomery, P. L. (1985) · Mathematics of Computation · doi:10.1090/s0025-5718-1985-0777282-x · Cited by 2,669
(Leveled) fully homomorphic encryption without bootstrapping
Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2012) · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference · doi:10.1145/2090236.2090262 · Cited by 1,782
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
Self-citationEfficient Multiparty Protocols Using Circuit Randomization
Beaver, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_34 · Cited by 893
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
Self-citationFairplay—a secure two-party computation system
Malkhi, D., Nisan, N., Benny Pinkas, B., & Sella, Y. (2004) · Cited by 782
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
Self-citationSharemind: A Framework for Fast Privacy-Preserving Computations
Bogdanov, D., Laur, S., & Willemson, J. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88313-5_13 · Cited by 690
Fully Homomorphic Encryption with Polylog Overhead
Gentry, C., Halevi, S., & Smart, N. P. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_28 · Cited by 497
Self-citationDamgård, I., Fitzi, M., Kiltz, E., Nielsen, J. B., & Toft, T. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_15 · Cited by 443
Self-citation
Cited by
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
MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer
Keller, M., Orsini, E., & Scholl, P. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978357 · Cited by 411
Self-citationSecure Multiparty Computations on Bitcoin
Andrychowicz, M., Dziembowski, S., Malinowski, D., & Mazurek, L. (2014) · 2014 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2014.35 · Cited by 345
A generic framework for privacy preserving deep learning
Ryffel, T., Trask, A., Dahl, M., Wagner, B., Mancuso, J., Rueckert, D., & Passerat-Palmbach, J. (2018) · arXiv · doi:10.48550/arxiv.1811.04017 · Cited by 335
PySyft: A Library for Easy Federated Learning
Ziller, A., Trask, A., Lopardo, A., Szymkow, B., Wagner, B., Bluemke, E., Nounahon, J.-M., Passerat-Palmbach, J., Prakash, K., Rose, N., et al. (2021) · Studies in Computational Intelligence · doi:10.1007/978-3-030-70604-3_5 · Cited by 246
Metadata
- Authors
- Damgård, I., Keller, M., Larraia, E., Pastro, V., Scholl, P., & Smart, N. P.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2013
- Pages
- 1-18
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1635361314
- Cited by
- 458
- References
- 20
- FWCI
- 20.38
- Type
- conference paper
- Language
- en
- Open access
- gold
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits. https://app.cochat.ai/papers/10.1007/978-3-642-40203-6_1
- The paper
- Damgård, I., Keller, M., Larraia, E., Pastro, V., Scholl, P., & Smart, N. P. (2013). Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-40203-6_1
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.
