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

  • Mohammad Ali Kadampur
  • Somayajulu D.V.L.N.
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5326)


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.


Association Rule Minimum Support Association Rule Mining Average Strategy Privacy Preservation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 2.
    Muralidhar, K., Parsa, R., Sarathy, R.: A general additive data perturbation method for database security. Management Science 45(10), 1399–1415 (1999)CrossRefGoogle Scholar
  3. 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. 4.
    Pierangela, S.: Protecting Respondents’ Identities in Microdata Release. IEEE Transactions on Knowledge and Data engineering, 13(6) (November-December 2001)Google Scholar
  5. 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. 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. 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)CrossRefGoogle Scholar
  8. 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. 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. 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. 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. 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. 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. 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. 15.
    Vaidya, J., Christopher, W., Yu, C., Zhu, M.: Privacy Preserving Data Mining, vol. 13. Springer, Heidelberg (2006)zbMATHGoogle Scholar
  16. 16.
    Clementine Workbench,
  17. 17.
    Ciriani, V., De Capitani, S., di Vimercati, S., Samarati, F.P.: K-anonymity. Secure Data Management. In: Decentralized Systems (2007)Google Scholar
  18. 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. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Mohammad Ali Kadampur
    • 1
  • Somayajulu D.V.L.N.
    • 1
  1. 1.Department of Computer Science and EngineeringNational Institute of TechnologyWarangalIndia

Personalised recommendations