Deriving Private Information from General Linear Transfor mation Perturbed Data

Several perturbation techniques have been proposed for privacy preserving data mining, among which the most popular ones are the additive noise based randomization approach and the rotation based perturbation approach. This paper first presents a general framework based on the general linear transformation, which incorporates both the ad ditive noise based and the rotation based perturbation approaches. Then it explores its privacy preserving property . Specifically, an Independent Component Analysis based reconstruction method, AK-ICA, is proposed to breach privacy when a subset of sample data are a-priori known by attackers. The theoretical analysis and experimental resu lts show that all current transformed privacy preserving data mining techniques may need a careful scrutiny in order to prevent privacy breaches when a subset of sample data are available.

[1]  Keke Chen,et al.  Privacy preserving data classification with rotation perturbation , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[2]  Yingjiu Li,et al.  On the Lower Bound of Reconstruction Error for Spectral Filtering Based Privacy Preserving Data Mining , 2006, PKDD.

[3]  Yehuda Lindell,et al.  Privacy Preserving Data Mining , 2002, Journal of Cryptology.

[4]  Qi Wang,et al.  On the privacy preserving properties of random data perturbation techniques , 2003, Third IEEE International Conference on Data Mining.

[5]  Osmar R. Zaïane,et al.  Achieving Privacy Preservation when Sharing Data for Clustering , 2004, Secure Data Management.

[6]  Xintao Wu,et al.  On the use of spectral filtering for privacy preserving data mining , 2006, SAC '06.

[7]  Nabil R. Adam,et al.  Security-control methods for statistical databases: a comparative study , 1989, ACM Comput. Surv..

[8]  G. Stewart The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators , 1980 .

[9]  Rathindra Sarathy,et al.  A General Additive Data Perturbation Method for Database Security , 1999 .

[10]  Charu C. Aggarwal,et al.  On the design and quantification of privacy preserving data mining algorithms , 2001, PODS.

[11]  Jean-Franois Cardoso High-Order Contrasts for Independent Component Analysis , 1999, Neural Computation.

[12]  Kun Liu,et al.  Random projection-based multiplicative data perturbation for privacy preserving distributed data mining , 2006, IEEE Transactions on Knowledge and Data Engineering.

[13]  Philip S. Yu,et al.  A Condensation Approach to Privacy Preserving Data Mining , 2004, EDBT.

[14]  Wenliang Du,et al.  Deriving private information from randomized data , 2005, SIGMOD '05.

[15]  Alexandre V. Evfimievski,et al.  Privacy preserving mining of association rules , 2002, Inf. Syst..