Optimizing MPC for robust and scalable integer and floating-point arithmetic

7Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Secure multiparty computation (SMC) is a rapidly maturing field, but its number of practical applications so far has been small. Most existing applications have been run on small data volumes with the exception of a recent study processing tens of millions of education and tax records. For practical usability, SMC frameworks must be able to work with large collections of data and perform reliably under such conditions. In this work we demonstrate that with the help of our recently developed tools and some optimizations, the Sharemind secure computation framework is capable of executing tens of millions integer operations or hundreds of thousands floating-point operations per second. We also demonstrate robustness in handling a billion integer inputs and a million floating-point inputs in parallel. Such capabilities are absolutely necessary for real world deployments.

Cite

CITATION STYLE

APA

Kerik, L., Laud, P., & Randmets, J. (2016). Optimizing MPC for robust and scalable integer and floating-point arithmetic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9604 LNCS, pp. 271–287). Springer Verlag. https://doi.org/10.1007/978-3-662-53357-4_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free