A Bitwise Logistic Regression Using Binary Approximation and Real Number Division in Homomorphic Encryption Scheme

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

Abstract

Homomorphic Encryption (HE) is considered to be one of the most promising solutions to maintain secure data outsourcing because the user’s query is processed under encrypted state. Accordingly, many of existing literature related to HE utilizes additive and multiplicative property of HE to facilitate logistic regression which requires high precision for prediction. In consequence, they inevitably transform or approximate nonlinear function of the logistic regression to adjust to their scheme using simple polynomial approximation algorithms such as Taylor expansion. However, such an approximation can be used only in limited applications because they cause unwanted error in results if the function is highly nonlinear. In response, we propose a different approximation approach to constructing the highly accurate logistic regression for HE using binary approximation. Our novel approach originates from bitwise operations on encrypted bits to designing (1) real number representation, (2) division and (3) exponential function. The result of our experiment shows that our approach can be more generally applied and accuracy-guaranteed than the current literature.

Cite

CITATION STYLE

APA

Yoo, J. S., Hwang, J. H., Song, B. K., & Yoon, J. W. (2019). A Bitwise Logistic Regression Using Binary Approximation and Real Number Division in Homomorphic Encryption Scheme. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11879 LNCS, pp. 20–40). Springer. https://doi.org/10.1007/978-3-030-34339-2_2

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