High-Precision Privacy-Preserving Real-Valued Function Evaluation

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

Abstract

We propose a novel multi-party computation protocol for evaluating continuous real-valued functions with high numerical precision. Our method is based on approximations with Fourier series and uses at most two rounds of communication during the online phase. For the offline phase, we propose a trusted-dealer and honest-but-curious aided solution, respectively. We apply our algorithm to train a logistic regression classifier via a variant of Newton’s method (known as IRLS) to compute unbalanced classification problems that detect rare events and cannot be solved using previously proposed privacy-preserving optimization algorithms (e.g., based on piecewise-linear approximations of the sigmoid function). Our protocol is efficient as it can be implemented using standard quadruple-precision floating point arithmetic. We report multiple experiments and provide a demo application that implements our algorithm for training a logistic regression model.

Cite

CITATION STYLE

APA

Boura, C., Chillotti, I., Gama, N., Jetchev, D., Peceny, S., & Petric, A. (2018). High-Precision Privacy-Preserving Real-Valued Function Evaluation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10957 LNCS, pp. 183–202). Springer Verlag. https://doi.org/10.1007/978-3-662-58387-6_10

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