Privacy-Preserving Pca On Horizontally-Partitioned Data

2017 IEEE CONFERENCE ON DEPENDABLE AND SECURE COMPUTING(2017)

Cited 15|Views22
No score
Abstract
Private data is used on daily basis by a variety of applications where machine learning algorithms predict our shopping patterns and movie preferences among other things. Principal component analysis (PCA) is a widely used method to reduce the dimensionality of data. Reducing the data dimension is essential for data visualization, preventing overfitting and resisting reconstruction attacks. In this paper, we propose methods that would enable the PCA computation to be performed on horizontally-partitioned data among multiple data owners without requiring them to stay online for the execution of the protocol. To address this problem, we propose a new protocol for computing the total scatter matrix using additive homomorphic encryption, and performing the Eigen decomposition using Garbled circuits. Our hybrid protocol does not reveal any of the data owner's input; thus protecting their privacy. We implemented our protocols using Java and Obliv-C, and conducted experiments using public datasets. We show that our protocols are efficient, and preserve the privacy while maintaining the accuracy.
More
Translated text
Key words
data dimensionality reduction,total scatter matrix,additive homomorphic encryption,eigen decomposition,Garbled circuits,Java,Obliv-C,PCA computation,data visualization,principal component analysis,movie preferences,shopping patterns,machine learning algorithms,private data,privacy-preserving PCA,data owner,multiple data owners,horizontally-partitioned data
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined