TY - GEN
T1 - Privacy-preserving PCA on horizontally-partitioned data
AU - Al-Rubaie, Mohammad
AU - Wu, Pei Yuan
AU - Chang, J. Morris
AU - Kung, Sun Yuan
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/10/18
Y1 - 2017/10/18
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85039924570&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85039924570&partnerID=8YFLogxK
U2 - 10.1109/DESEC.2017.8073817
DO - 10.1109/DESEC.2017.8073817
M3 - Conference contribution
AN - SCOPUS:85039924570
T3 - 2017 IEEE Conference on Dependable and Secure Computing
SP - 280
EP - 287
BT - 2017 IEEE Conference on Dependable and Secure Computing
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 IEEE Conference on Dependable and Secure Computing
Y2 - 7 August 2017 through 10 August 2017
ER -