Privacy Preserving Data Mining at Different Trust Levels
Abstract
Privacy preserving data mining has become
increasingly popular because it allows sharing of privacy sensitive
data for analysis purposes. So people have become increasingly
unwilling to share their data, frequently resulting in individuals either
refusing to share their data or providing incorrect data.The difficulty in
privacy-sensitive domain is solved by the development of the
Multi-Level Trust Privacy Preserving Data Mining (MLT-PPDM)
where multiple differently perturbed copies of the same data are
available to data miners at different trusted levels. In MLT-PPDM data
owners generate perturbed data by various techniques like Batch
generation and On-demand generation. MLT-PPDM can overcome the
diversity attacks. Partial information hiding methodologies like
random perturbation, random rotation perturbation are incorporated
with MLT-PPDM to enhance data security and to prevent leakage of
the sensitive data. The solution allows a data owner to generate
perturbed copies of its data for arbitrary trust levels on demand.
Finally MLT-PPDM approach is improved to tackle against the
non-linear attacks. The time and space complexities are calculated for
both techniques and the results show that on-demand algorithm is best
among them.
Keywords
Full Text:
PDFReferences
Yaping Li,Minghua Chen,Qiwei Li and Wei Zhang, “Enabling
Multi-level Trust in Privacy Preserving Data Mining”, IEEE Computer
Society,June 2011.
K. Chen and L. Liu,“Privacy Preserving Data Classification with Rotation
Perturbation,” Proc. IEEE Fifth Int’l Conf. Data Mining, 2005.
K. Liu, H. Kargupta, and J. Ryan, “Random Projection Based
Multiplicative Data Perturbation for Privacy Preserving Distributed Data
Mining,” IEEE Trans. Knowledge and Data Eng., vol. 18, no. 1, pp.
-106, Jan. 2006.
S. Papadimitriou, F. Li, G. Kollios, and P.S. Yu,“Time Series
Compressibility and Privacy,” Proc. 33rd Int’l Conf. Very LargeData
Bases (VLDB ’07), 2007.
Y. Lindell and B. Pinkas, “Privacy Preserving Data Mining,” Proc. Int’l
Cryptology Conf. (CRYPTO), 2000.
J. Vaidya and C.W. Clifton, “Privacy Preserving Association Rule
Mining in Vertically Partitioned Data,”,ACM SIGKDD Int’l Conf.
Knowledge Discovery and Data Mining, 2002.
O.Goldreich,“Secure Multi-Party Computation,” Final (incomplete)
draft, version 1.4, 2002.
A.W.-C. Fu, R.C.-W. Wong, and K. Wang, “Privacy-Preserving Frequent
Pattern Mining across Private Databases,” Proc. IEEE Fifth Int’l Conf.
Data Mining, 2005.
X. Xiao and Y. Tao, “M-Invariance: Towards Privacy Preserving
Re-Publication of Dynamic Datasets,” Proc. ACM SIGMOD Int’l
Conf.Management of Data, 2007.
B. Fung, K. Wang, A. Fu, and J. Pei, “Anonymity for Continuous Data
Publishing,” Proc. Int’l Conf Extending Database Technology
(EDBT),2008.
G. Wang, Z. Zhu, W. Du, and Z. Teng, “Inference Analysis in Privacy-
Preserving Data Re-Publishing,” Proc. Int’l Conf. Data Mining, 2008
Y. Li and M. Chen, “Enabling Multi-Level Trust in Privacy Preserving
Data Mining,” Technical Report
UCB/EECS-2008-156,EECSDept.,Univ.of California, Dec 2008.
X. Xiao, Y. Tao, and M. Chen, “Optimal Random Perturbation at
Multiple Privacy Levels,” Proc. Int’l Conf. Very Large Data Bases, 2009.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.