Skip to main content

Deriving Private Information from Arbitrarily Projected Data

  • Conference paper
Advances in Knowledge Discovery and Data Mining (PAKDD 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4426))

Included in the following conference series:

Abstract

Distance-preserving projection based perturbation has gained much attention in privacy-preserving data mining in recent years since it mitigates the privacy/accuracy tradeoff by achieving perfect data mining accuracy. One apriori knowledge PCA based attack was recently investigated to show the vulnerabilities of this distance-preserving projected based perturbation approach when a sample dataset is available to attackers. As a result, non-distance-preserving projection was suggested to be applied since it is resilient to the PCA attack with the sacrifice of data mining accuracy to some extent. In this paper we investigate how to recover the original data from arbitrarily projected data and propose AK-ICA, an Independent Component Analysis based reconstruction method. Theoretical analysis and experimental results show that both distance-preserving and non-distance-preserving projection approaches are vulnerable to this attack. Our results offer insight into the vulnerabilities of projection based approach and suggest a careful scrutiny when it is applied in privacy-preserving data mining.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, D., Agrawal, C.: On the design and quantification of privacy preserving data mining algorithms. In: Proceedings of the 20th Symposium on Principles of Database Systems (2001)

    Google Scholar 

  2. Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Dallas, Texas, May 2000, pp. 439–450. ACM, New York (2000)

    Chapter  Google Scholar 

  3. Cardoso, J.: High-order contrasts for independent component analysis. Neural Computation 11(1), 157–192 (1999)

    Article  MathSciNet  Google Scholar 

  4. Chen, K., Liu, L.: Privacy preserving data classification with rotation perturbation. In: Proceedings of the 5th IEEE International Conference on Data Mining, Houston,TX, Nov. 2005, IEEE Computer Society Press, Los Alamitos (2005)

    Google Scholar 

  5. Guo, S., Wu, X.: On the use of spectral filtering for privacy preserving data mining. In: Proceedings of the 21st ACM Symposium on Applied Computing, Dijion, France, April 2006, ACM, New York (2006)

    Google Scholar 

  6. Guo, S., Wu, X., Li, Y.: On the lower bound of reconstruction error for spectral filting based privacy preserving data mining. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Huang, Z., Du, W., Chen, B.: Deriving private information from randomized data. In: Proceedings of the ACM SIGMOD Conference on Management of Data, Baltimore, MA, ACM Press, New York (2005)

    Google Scholar 

  8. Hyvarinen, A., Karhunen, J., Oja, E.: Independent Component Analysis. John Wiley & Sons, Chichester (2001)

    Google Scholar 

  9. Kargupta, H., et al.: On the privacy preserving properties of random data perturbation techniques. In: Proceedings of the 3rd International Conference on Data Mining, pp. 99–106 (2003)

    Google Scholar 

  10. Liu, K., Giannella, C., Kargupta, H.: An attacker’s view of distance preserving maps for privacy preserving data mining. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, Springer, Heidelberg (2006)

    Google Scholar 

  11. Liu, K., Kargupta, H., Ryan, J.: Random projection based multiplicative data perturbation for privacy preserving distributed data mining. IEEE Transaction on Knowledge and Data Engineering 18(1), 92–106 (2006)

    Article  Google Scholar 

  12. Muralidhar, K., Sarathy, R.: A general additive data perturbation method for database security. Management Science 45(10), 1399–1415 (1999)

    Article  Google Scholar 

  13. Oliveira, S., Zaiane, O.: Achieving privacy preservation when sharing data for clustering. In: Proceedings of the Workshop on Secure Data Management in a Connected World, Toronto, Canada, August 2004, pp. 67–82 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Zhi-Hua Zhou Hang Li Qiang Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Guo, S., Wu, X. (2007). Deriving Private Information from Arbitrarily Projected Data. In: Zhou, ZH., Li, H., Yang, Q. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2007. Lecture Notes in Computer Science(), vol 4426. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71701-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71701-0_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71700-3

  • Online ISBN: 978-3-540-71701-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics