2017 IEEE Conference on Dependable and Secure Computing 2017
DOI: 10.1109/desec.2017.8073817
|View full text |Cite
|
Sign up to set email alerts
|

Privacy-preserving PCA on horizontally-partitioned data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
15
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
1
1
1

Relationship

1
8

Authors

Journals

citations
Cited by 21 publications
(15 citation statements)
references
References 12 publications
0
15
0
Order By: Relevance
“…Many similar PCA techniques rely on results derived from random matrix theory [ 216 - 219 ]. To reduce the computational cost of the privacy model, additive HE was used for PCA with a single data user [ 217 ], where the rank of PCA with an unknown distribution could be adaptively estimated to achieve (𝜖, 𝛿)-DP [ 218 ]. More recently, the concept of collaborative learning (or shared machine learning) [ 94 , 97 , 220 ] became very popular in data anonymization.…”
Section: Resultsmentioning
confidence: 99%
“…Many similar PCA techniques rely on results derived from random matrix theory [ 216 - 219 ]. To reduce the computational cost of the privacy model, additive HE was used for PCA with a single data user [ 217 ], where the rank of PCA with an unknown distribution could be adaptively estimated to achieve (𝜖, 𝛿)-DP [ 218 ]. More recently, the concept of collaborative learning (or shared machine learning) [ 94 , 97 , 220 ] became very popular in data anonymization.…”
Section: Resultsmentioning
confidence: 99%
“…A widely-used tool in SMC is garbled circuit [4], a cryptographic protocol carefully designed for two-party computation, in which they can jointly evaluate a function over their sensitive data without the trust of each other. In [18], Mohammad introduced a SMC protocol for principle component analysis (PCA) which is a hybrid system utilizing additive homomorphic and garbled circuit. In secret sharing techniques [5], a secret s is distributed over multiple pieces n also called shares, where the secret can only be recovered by a sufficient amount of t shares.…”
Section: Literature Reviewmentioning
confidence: 99%
“…We carefully designed the decomposition and sort algorithms based on the MPC platform's performance characters, avoiding expensive operations and fully exploiting the opportunities to batch up operations, thus greatly reduced the computation time. In our work, we have improved performance by 200× comparing with [2] on similar scale matrices and have achieved the entire PCA on the 7, 062, 606 × 115 dataset from 9 parties within 3 minutes.…”
Section: Introductionmentioning
confidence: 99%
“…The next step is the core step of PCA, in which we perform eigen-decomposition on the covariance matrix. Previous work [2] provides an MPC-based approach to compute it on cipher-text, but the performance is unacceptable (even a 50 × 50 matrix takes 126.7 minutes). The slow performance leads to proposals to reveal the covariance matrix as plain-text for decomposition, arguing that it does not contain private information [28].…”
Section: Introductionmentioning
confidence: 99%