Private Data Imputation
Abdelkarim Kati, Florian Kerschbaum, Marina Blanton
摘要
Data imputation is an important data preparation task where the data analyst replaces missing or erroneous values to increase the expected accuracy of downstream analyses. The accuracy improvement of data imputation extends to private data analyses across distributed databases. However, existing data imputation methods violate the privacy of the data rendering the privacy protection in the downstream analyses obsolete. We conclude that private data analysis requires private data imputation. In this paper, we present the first optimized protocols for private data imputation. We consider the case of horizontally and vertically split data sets. Our optimization aims to reduce most of the computation to private set intersection (or at least oblivious programmable pseudo-random function) protocols which can be very efficiently computed. We show that private data imputation has -- on average across all evaluated datasets -- an accuracy advantage of 20% in case of vertically split data and 5% in case of horizontally split data over imputing data locally. In case of the worst data split we observed that imputing using our method resulted in an increase of up to 32.7 times in the quality of imputation over the vertically split data and 3.4 times in case of horizontally split data. Our protocols are very efficient and run in 2.4 seconds in case of vertically split data and 8.4 seconds in case of horizontally split data for 100,000 records evaluated in the 10 Gbps network setting, performing one data imputation.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper6
- CrypTen: Secure Multi-Party Computation Meets Machine LearningBrian Knott, Shobha Venkataraman, Awni Y. Hannun, Shubho Sengupta 等NeurIPS 2021 · 被引用 573 次
- PSI from PaXoS: Fast, Malicious Private Set IntersectionBenny Pinkas, Mike Rosulek, Ni Trieu, Avishay YanaiEUROCRYPT 2020 · 被引用 198 次
- VOLE-PSI: Fast OPRF and Circuit-PSI from Vector-OLEPeter Rindal, Phillipp SchoppmannEUROCRYPT 2021 · 被引用 159 次
- SANNS: Scaling Up Secure Approximate k-Nearest Neighbors SearchHao Chen, Ilaria Chillotti, Yihe Dong, Oxana Poburinnaya 等USENIX Security 2020
- Faster Secure Comparisons with Offline Phase for Efficient Private Set IntersectionFlorian Kerschbaum, Erik-Oliver Blass, Rasoul Akhavan MahdaviNDSS 2023
相关 Paper
- Private Collaborative Data Cleaning via Non-Equi PSIErik-Oliver Blass, Florian KerschbaumS&P 2023
- Learnable Prompt as Pseudo-Imputation: Rethinking the Necessity of Traditional EHR Data Imputation in Downstream Clinical PredictionWeibin Liao, Yinghao Zhu, Zhongji Zhang, Yuhang Wang 等KDD 2025 · 被引用 2 次
- Secure Parallel Computation on Privately Partitioned Data and ApplicationsNuttapong Attrapadung, Hiraku Morita, Kazuma Ohara, Jacob C. N. Schuldt 等CCS 2022 · 被引用 7 次
- In-Database Data ImputationMassimo Perini, Milos NikolicSIGMOD 2024 · 被引用 5 次
- Shuffle-based Private Set Union: Faster and More SecureYanxue Jia, Shifeng Sun, Hong-Sheng Zhou, Jiajun Du 等USENIX Security 2022
