Skip to main content

A Data Perturbation Method by Field Rotation and Binning by Averages Strategy for Privacy Preservation

  • Conference paper
Intelligent Data Engineering and Automated Learning – IDEAL 2008 (IDEAL 2008)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5326))

Abstract

In this paper a novel technique useful to guarantee privacy of sensitive data with specific focus on numeric databases is presented. It is noticed that analysts and decision makers are interested in summary values of the data rather than the actual values. The proposed method considers that the maximum information lies in association of attributes rather than their actual proper values. Therefore it is aimed to perturb attribute associations in a controlled way, by shifting the data values of specific columns by rotating fields. The number of rotations is determined via using a support function for association rule handling and an algorithm that computes the best-choice rotation dynamically. Final summary statistics such as average, standard deviation of the numeric data are preserved by making bin average replacements for the actual values. The methods are tested on selected datasets and results are reported.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Estivill-Castro, V., Brankovic, L.: Data Swapping: Balancing Privacy against Mining of Association Rules. In: Proceedings of Knowledge Discovery and Data Warehousing, Florence, Italy, August 1999, pp. 389–398 (1999)

    Google Scholar 

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

    Article  Google Scholar 

  3. Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proceedings of the 2000 ACM SIGMOD International Conference on dataset Management of Data, Dallas, Texas (May 2000)

    Google Scholar 

  4. Pierangela, S.: Protecting Respondents’ Identities in Microdata Release. IEEE Transactions on Knowledge and Data engineering, 13(6) (November-December 2001)

    Google Scholar 

  5. Dasseni, E., Verykois, V.S., Elmagarid, A.K., Bertino, E.: Hiding Association rules by using Confidence and Support. In: Proceedings of Information Hiding Workshop, pp. 369–383 (2001)

    Google Scholar 

  6. Sweeny, L.: K-anonymity a model for protecting privacy. International journal on uncertainty, Fuzzyness and knowledge based systems, (5), 557–570 (2002)

    Google Scholar 

  7. Domingo-Ferrer, J., Mateo-Sanz, J.M.: Practical Data-Oriented Micro-aggregation for Statistical Disclosure Control. IEEE Transaction on Knowledge and Data Eng. 14(1), 189–201 (2002)

    Article  Google Scholar 

  8. Datta, S., Kargupta, H., Sivakumar, K.: Homeland defense, privacy sensitive data mining, and random value distortion. In: Proceedings of the SIAM Workshop on Data Mining for Counter Terrorism and Security (SDM 2003), San Fransisco, C.A (May 2003)

    Google Scholar 

  9. Kargupta, H., Datta, S., Wang, Q., Sivakumar, K.: On the privacy preserving properties of random data perturbation techniques. In: Proceedings of the third IEEE International Conference on Data mining (ICDM 2003), Melbourne, Florida, November 19-22 (2003)

    Google Scholar 

  10. Verykios, V., Bertino, E., Nai, I., Loredana, F., Provenza, P., Saygin, Y., Theodoriddis, Y.: State of the Art in Privacy preserving Data Mining. In: SIGMOD Record, vol. 33(1) (2004)

    Google Scholar 

  11. Bakken, D., Parameswaran, R., Blough, D.: Data Obfuscation: Anonymity and Desensitization of Usable data Sets. In: IEEE Security and Privacy, vol. 2, pp. 34–41 (November-December 2004)

    Google Scholar 

  12. Hillol, K., Souptik, D., Oi, W., Krishnamurthy, S.: Random-data perturbation techniques and privacy preserving data mining. In: Knowledge and Information Systems, May 2005, vol. 7(4) (2005)

    Google Scholar 

  13. Chawla, S., Dwork, F., McSherry, Smith, A., Wee, H.: Towards privacy in public databases. In: Theory of cryptography conference, Cambridge, MA, February 9-12 (2005)

    Google Scholar 

  14. Li, L., Murat, K., Bhavani, T.: The Applicability of the Perturbation Model-based privacy Preserving Data Mining for real-world Data. In: Sixth IEEE International Conference on Data Mining – Workshops ICDMW 2006 (2006)

    Google Scholar 

  15. Vaidya, J., Christopher, W., Yu, C., Zhu, M.: Privacy Preserving Data Mining, vol. 13. Springer, Heidelberg (2006)

    MATH  Google Scholar 

  16. Clementine Workbench, http://www.spss.com

  17. Ciriani, V., De Capitani, S., di Vimercati, S., Samarati, F.P.: K-anonymity. Secure Data Management. In: Decentralized Systems (2007)

    Google Scholar 

  18. Wu, Y.-H., Chiang, C.-M., Arbee, L., Chen, P.: Hiding Sensitive Association Rules with Limited Side Effects. IEEE Transaction on Knowledge and Data Engineering, vol. 19(1) (January 2007)

    Google Scholar 

  19. Fung, B., Wang, C.M., Ke, Y., Philip, S.: Anonymizing Classification Data for Privacy preservation. In: IEEE Transactions on Knowledge and Data Engineering, May 2007, vol. 19(5), pp. 711–725 (2007)

    Google Scholar 

  20. Xu, S., Lai, S.: Fast Fourier Transform Based Data Perturbation Method for Privacy Protection. IEEE Transactions on Intelligence and Security Informatics, 221–224 (May 2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kadampur, M.A., D.V.L.N., S. (2008). A Data Perturbation Method by Field Rotation and Binning by Averages Strategy for Privacy Preservation. In: Fyfe, C., Kim, D., Lee, SY., Yin, H. (eds) Intelligent Data Engineering and Automated Learning – IDEAL 2008. IDEAL 2008. Lecture Notes in Computer Science, vol 5326. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88906-9_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88906-9_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88905-2

  • Online ISBN: 978-3-540-88906-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics