Overdrive: Making SPDZ Great Again
The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
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
COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS
Vickrey, W. (1961) · The Journal of Finance · doi:10.1111/j.1540-6261.1961.tb02789.x · Cited by 7,722
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
On Ideal Lattices and Learning with Errors over Rings
Lyubashevsky, V., Peikert, C., & Regev, O. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_1 · Cited by 1,831
(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
Efficient Fully Homomorphic Encryption from (Standard) LWE
Brakerski, Z., & Vaikuntanathan, V. (2011) · 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2011.12 · Cited by 1,449
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
On the concrete hardness of Learning with Errors
Albrecht, M. R., Player, R., & Scott, S. (2015) · Journal of Mathematical Cryptology · doi:10.1515/jmc-2015-0016 · Cited by 861
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
Sharemind: 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
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
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
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-citationPrivacy-Preserving Ridge Regression on Hundreds of Millions of Records
Nikolaenko, V., Weinsberg, U., Ioannidis, S., Joye, M., Boneh, D., & Taft, N. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.30 · Cited by 439
A Toolkit for Ring-LWE Cryptography
Lyubashevsky, V., Peikert, C., & Regev, O. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38348-9_3 · Cited by 416
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-citationSemi-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
Succinct Non-interactive Arguments via Linear Interactive Proofs
Bitansky, N., Chiesa, A., Ishai, Y., Paneth, O., & Ostrovsky, R. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-36594-2_18 · Cited by 274
Asynchronous Multiparty Computation: Theory and Implementation
Damgård, I., Geisler, M., Krøigaard, M., & Nielsen, J. B. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00468-1_10 · Cited by 251
Privacy-preserving distributed linear regression on high-dimensional data
Gascón, A., Schoppmann, P., Balle, B., Raykova, M., Doerner, J., Zahur, S., & Evans, D. (2017) · Proceedings on Privacy Enhancing Technologies · doi:10.1515/popets-2017-0053 · Cited by 193
Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation
Wang, X., Ranellucci, S., & Katz, J. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134053 · Cited by 168
Obliv-C: A Language for Extensible Data-Oblivious Computation.
Zahur, S., & Evans, D. (2015) · Cited by 125
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
Which Ring Based Somewhat Homomorphic Encryption Scheme is Best?
Costache, A., & Smart, N. P. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-29485-8_19 · Cited by 104
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-citationMPC-Friendly Symmetric Key Primitives
Grassi, L., Rechberger, C., Rotaru, D., Schöll, P., & Smart, N. P. (2016) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2976749.2978332 · Cited by 85
Self-citationLattice-Based SNARGs and Their Application to More Efficient Obfuscation
Boneh, D., Ishai, Y., Sahai, A., & Wu, D. J. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-56617-7_9 · Cited by 73
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
Implementing 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-citationSecure Stable Matching at Scale
Doerner, J., Evans, D., & Shelat, A. A. (2016) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2976749.2978373 · Cited by 62
Faster Malicious 2-Party Secure Computation with Online/Offline Dual Execution
Rindal, P., & Rosulek, M. (2016) · USENIX Security Symposium · Cited by 40
Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack
Cramer, R., Damgård, I., Xing, C., & Yuan, C. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-56620-7_17 · Cited by 22
Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings.Preprint
Baum, C., & Lyubashevsky, V. (2017) · IACR Cryptology ePrint Archive · Cited by 11
Cited by
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
“There are different kinds of MPC protocols optimized for arithmetic and Boolean circuits based on secret sharing techniques [267], [268] and garbled circuits [269], [270], respectively.”
BackgroundMethodVeriFL: Communication-Efficient and Fast Verifiable Aggregation for Federated Learning
Guo, X., Liu, Z., Li, J., Gao, J., Hou, B., Dong, C., & Baker, T. (2021) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2020.3043139 · Cited by 314
Chen, H., Dai, W., Kim, M., & Song, Y. (2019) · Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3319535.3363207 · Cited by 256
Secure Partial Aggregation: Making Federated Learning More Robust for Industry 4.0 Applications
Gao, J., Zhang, B., Guo, X., Baker, T., Li, M., & Liu, Z. (2022) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2022.3145837 · Cited by 41
Metadata
- Authors
- Keller, M., Pastro, V., & Rotaru, D.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2018
- Pages
- 158-189
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2794685135
- Cited by
- 275
- References
- 34
- FWCI
- 11.65
- 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.