Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015 (2015), Article ID 464731, 14 pages
http://dx.doi.org/10.1155/2015/464731
Research Article

Privacy Protection Method for Multiple Sensitive Attributes Based on Strong Rule

College of Computer Science, Communication University of China, Beijing 100024, China

Received 14 April 2015; Revised 10 July 2015; Accepted 15 July 2015

Academic Editor: Nazrul Islam

Copyright © 2015 Tong Yi and Minyong Shi. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. L. Sweeney, “k-anonymity: a model for protecting privacy,” International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 10, no. 5, pp. 557–570, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. L. Sweeney, “Achieving k-anonymity privacy protection using generalization and suppression,” International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 10, no. 5, pp. 571–588, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. K. LeFevre, D. J. DeWitt, and R. Ramakrishnan, “Incognito: efficient full-domain K-anonymity,” in Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD '05), pp. 49–60, June 2005. View at Publisher · View at Google Scholar · View at Scopus
  4. A. Machanavajjhala, J. Gehrke, D. Kifer, and M. Venkitasubramaniam, “L-diversity: privacy beyond k-anonymity,” in Proceedings of the 22nd International Conference on Data Engineering (ICDE '06), pp. 24–26, April 2006. View at Publisher · View at Google Scholar · View at Scopus
  5. X. Xiao and Y. Tao, “Personalized privacy preservation,” in Prceedings of the 25th ACM SIGMOD International Conference on ACM Management of Data (SIGMOD '06), pp. 229–240, ACM, Chicago, Ill, USA, 2006.
  6. N. Koudas, D. Srivastava, T. Yu, and Q. Zhang, “Distribution based microdata anonymization,” Proceedings of the VLDB Endowment, vol. 2, no. 1, pp. 958–969, 2009. View at Publisher · View at Google Scholar
  7. L. Ninghui, L. Tiancheng, and S. Venkatasubramanian, “t-Closeness: privacy beyond k-anonymity and l-diversity,” in Proceedings of the 23rd International Conference on Data Engineering (ICDE '07), pp. 106–115, IEEE, Istanbul, Turkey, April 2007. View at Publisher · View at Google Scholar · View at Scopus
  8. X.-C. Yang, X.-Y. Liu, B. Wang, and G. Yu, “K-anonymization approaches for supporting multiple constraints,” Journal of Software, vol. 17, no. 5, pp. 1222–1231, 2006. View at Google Scholar · View at Scopus
  9. X. Xiao and Y. Tao, “Anatomy: simple and effective privacy preservation,” in Proceedings of the 32nd International Conference on Very Large Data Bases (VLDB '06), pp. 139–150, Seoul, Republic of Korea, September 2006. View at Scopus
  10. N. Li, W. Qardaji, and D. Su, “Provably private data anonymization: or, k-anonymity meets differential privacy,” CERIAS TR 2010-24, Center for Education and Research Information Assurance and Security, Purdue University, West Lafayette, India, 2010. View at Google Scholar
  11. G. Aggarwal, T. Feder, K. Kenthapadi et al., “Achieving anonymity via clustering,” in Proc. of the 25th ACM SIGMOD-SIGACT-SIGART Symp. on Principles of Database Systems, S. Vansummeren, Ed., pp. 153–162, ACM, New York, NY, USA, 2006. View at Google Scholar
  12. X.-C. Yang, Y.-Z. Wang, B. Wang, and G. Yu, “Privacy preserving approaches for multiple sensitive attributes in data publishing,” Chinese Journal of Computers, vol. 31, no. 4, pp. 574–587, 2008. View at Google Scholar · View at Scopus
  13. Y. Jing and W. Bo, “Personalized l-diversity algorithm for multiple sensitive attributes based on minimum selected degree first,” Journal of Computer Research and Development (China), vol. 49, no. 12, pp. 2603–2610, 2012. View at Google Scholar
  14. Y. Ye, Y. Liu, D. Lv, and J. Feng, “Decomposition: privacy preservation for multiple sensitive attributes,” in Database Systems for Advanced Applications, vol. 5463 of Lecture Notes in Computer Science, pp. 486–490, Springer, Berlin, Germany, 2009. View at Publisher · View at Google Scholar
  15. A. Abdalaal, M. E. Nergiz, and Y. Saygin, “Privacy-preserving publishing of opinion polls,” Computers & Security, vol. 37, pp. 143–154, 2013. View at Publisher · View at Google Scholar · View at Scopus
  16. Y. Fang, M. Zaman Ashrafi, and S. Kiong Ng, “Privacy beyond single sensitive attribute,” in Database and Expert Systems Applications, pp. 187–201, Springer, 2011. View at Google Scholar
  17. J. Liu, J. Luo, and J. Z. Huang, “Rating: privacy preservation for multiple attributes with different sensitivity requirements,” in Proceedings of the 11th IEEE International Conference on Data Mining Workshops (ICDMW '11), pp. 666–673, Vancouver, Canad, December 2011. View at Publisher · View at Google Scholar · View at Scopus
  18. J. W. Han and M. Kamber, Data Mining Concepts and Techniques, China Machine Press, Beijing, China, 2011.