Secure principal component analysis in multiple distributed nodes

Citations

WEB OF SCIENCE

8
Citations

SCOPUS

11

초록

Privacy preservation becomes an important issue in recent big data analysis, and many secure multiparty computations have been proposed for the purpose of privacy preservation in the environment of distributed nodes. As a secure multiparty computations of principal component analysis (PCA), in this paper, we propose S-PCA, which compute PCA securely among the distributed nodes. PCA is widely used in many applications including time-series analysis, text mining, and image compression. In general, we compute PCA after concentrating all data in a single server, but this approach discloses data privacy of each node. In contrast, the proposed S-PCA computes PCA without disclosing the sensitive data of individual nodes. In S-PCA, the nodes share non-sensitive mean vectors first and compute covariance matrices and PCA securely using the shared mean vectors. In this paper, we formally prove the correctness and secureness of S-PCA and apply it to an application of secure similar document detection. Experimental results show that the performance of S-PCA is slightly worse than that of PCA due to guarantee of secureness, but it significantly improves the performance of secure similar document detection by up to two orders of magnitudes. Copyright (c) 2016 John Wiley & Sons, Ltd.

키워드

privacy-preserving data mining; secure principal component analysis; secure multiparty computation; secure similar document detection; EUCLIDEAN DISTANCE; MINING ALGORITHMS
제목
Secure principal component analysis in multiple distributed nodes
저자
Won, Hee-Sun; Kim, Sang-Pil; Lee, Sanghun; Choi, Mi-Jung; Moon, Yang-Sae
DOI
10.1002/sec.1501
발행일
2016-09-25
유형
Article
저널명
Security and Communication Networks
권
9
호
14
페이지
2348 ~ 2358