2017
DOI: 10.1587/transinf.2016inp0019
|View full text |Cite
|
Sign up to set email alerts
|

Input and Output Privacy-Preserving Linear Regression

Abstract: SUMMARYWe build a privacy-preserving system of linear regression protecting both input data secrecy and output privacy. Our system achieves those goals simultaneously via a novel combination of homomorphic encryption and differential privacy dedicated to linear regression and its variants (ridge, LASSO). Our system is proved scalable over cloud servers, and its efficiency is extensively checked by careful experiments.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 15 publications
(4 citation statements)
references
References 19 publications
0
4
0
Order By: Relevance
“…The linear predictor function f (•) can be expressed as In order to alleviate the over-fitting problem of linear regression, its variants (e.g., ridge and lasso regression) are introduced as improved versions of linear regression by adding a regularization term in loss function for more accurate estimates. Using a secure technique combining both HE scheme and differential privacy, Aono et al [188] proposed a privacy-preserving scheme for linear regression. Receiving the encrypted training data from a client (using his public key), the cloud server performs necessary computations on the encrypted data and returns the encrypted model parameters to the client.…”
Section: ) Regression Algorithmsmentioning
confidence: 99%
“…The linear predictor function f (•) can be expressed as In order to alleviate the over-fitting problem of linear regression, its variants (e.g., ridge and lasso regression) are introduced as improved versions of linear regression by adding a regularization term in loss function for more accurate estimates. Using a secure technique combining both HE scheme and differential privacy, Aono et al [188] proposed a privacy-preserving scheme for linear regression. Receiving the encrypted training data from a client (using his public key), the cloud server performs necessary computations on the encrypted data and returns the encrypted model parameters to the client.…”
Section: ) Regression Algorithmsmentioning
confidence: 99%
“…In section 3.1, the supervised learning module and the feature extraction module of the proposed framework were evaluated using the subspace (ɑ3, ɑ4, ɑ11) of the NSL-KDD data set with binary classes (9,10) only. In a new experiment, the same subspace is again considered; however, the other classes (0,1), (0,5), (1,2), (1,9), (3,5), (3,9), and (6,8) are also studied. In addition, three other subspaces, (ɑ3, ɑ4, ɑ5), (ɑ3, ɑ4, ɑ7), and (ɑ4, ɑ7, ɑ10), are also included in the experiment to study the performance of the proposed analytical framework with DPLR.…”
Section: Multiple Subspace Analysismentioning
confidence: 99%
“…These characteristics of ϵ make the selection of a set of suitable values for ϵ much harder. A significant research has been performed to address this problem in various perspectives [1,2]; however, two main contributions that are closely related to the proposed study are selected and discussed in this section. For example, the authors of [7] studied the contributions of the privacy parameter and proposed a model that provides a balance between the objectives of a data owner and a data user, and studied its effectiveness by selecting several values of privacy parameter.…”
Section: Introductionmentioning
confidence: 99%
“…Aiming to achieve both secrecy and differential privacy, Aono et al [ 39 , 40 ] have designed systems for privacy-preserving linear and logistic regression, in which a semi-honest central server is used to handle homomorphic ciphertexts. Semantic security with homomorphism allows their system to achieve data secrecy (with respect to the central server) and differential privacy (with respect to publishing the final result) simultaneously.…”
Section: Introductionmentioning
confidence: 99%