Enabling Multi-level Trust in Privacy Preserving Data Mining
Yaping Li, Minghua Chen, Qiwei Li, Wei Zhang

TL;DR
This paper introduces a multi-level trust framework for privacy-preserving data mining that prevents malicious data miners from reconstructing original data by combining differently perturbed copies, enhancing privacy guarantees.
Contribution
It extends perturbation-based PPDM to multiple trust levels, correlates perturbations across copies, and proves robustness against diversity attacks.
Findings
Robust against diversity attacks in multi-level trust settings.
Allows flexible, on-demand generation of perturbed data copies.
Ensures data privacy even when multiple perturbed copies are combined.
Abstract
Privacy Preserving Data Mining (PPDM) addresses the problem of developing accurate models about aggregated data without access to precise information in individual data record. A widely studied \emph{perturbation-based PPDM} approach introduces random perturbation to individual values to preserve privacy before data is published. Previous solutions of this approach are limited in their tacit assumption of single-level trust on data miners. In this work, we relax this assumption and expand the scope of perturbation-based PPDM to Multi-Level Trust (MLT-PPDM). In our setting, the more trusted a data miner is, the less perturbed copy of the data it can access. Under this setting, a malicious data miner may have access to differently perturbed copies of the same data through various means, and may combine these diverse copies to jointly infer additional information about the original data…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Cryptography and Data Security · Privacy, Security, and Data Protection
