Call for Paper - January 2023 Edition
IJCA solicits original research papers for the January 2023 Edition. Last date of manuscript submission is December 20, 2022. Read More

Effective Incentive Compatible Model for Privacy Preservation of Information in Secure Data Sharing and Publishing

Print
PDF
International Journal of Computer Applications
© 2014 by IJCA Journal
Volume 96 - Number 16
Year of Publication: 2014
Authors:
M. Dhanalakshmi
V. Balu
10.5120/16876-6875

M Dhanalakshmi and V Balu. Article: Effective Incentive Compatible Model for Privacy Preservation of Information in Secure Data Sharing and Publishing. International Journal of Computer Applications 96(16):7-11, June 2014. Full text available. BibTeX

@article{key:article,
	author = {M. Dhanalakshmi and V. Balu},
	title = {Article: Effective Incentive Compatible Model for Privacy Preservation of Information in Secure Data Sharing and Publishing},
	journal = {International Journal of Computer Applications},
	year = {2014},
	volume = {96},
	number = {16},
	pages = {7-11},
	month = {June},
	note = {Full text available}
}

Abstract

Privacy preserving is one of the most important research topics in the data security field and it has become a serious concern in the secure transformation of personal data in recent years. For example, different credit card companies and disease control centers may try to build better data sharing or publishing models for privacy protection through privacy preserving data mining techniques (PPDM). A model has been proposed to design the effective Privacy Preserving Mining Framework for secure private information transformation and Publishing. Building this framework depends on Incentive Compatible Model based secure code computation process and PPDM techniques like Association rule mining, Randomization method and Cryptographic technique. An Encryption algorithm is used to identify which data sets need to be encrypted for preserving privacy in data storage publishing. The Incentive Compatible model is very efficient in protecting the sensitive data in privacy preserving data sharing, because it provides the secrecy against not only semi-honest adversary model and also the malicious model.

References

  • D. Agrawal, C. C. Aggarwal, "On the Design and Quantification of Privacy Preserving Data Mining Algorithms", In Proceedings of the 20th ACM SIGMOD-SIGACTSIGART Symposium on Principles of Database Systems, pp. 247-255, 2001.
  • G. Loukides, J. H. Shao, "An Efficient Clustering Algorithm for k-Anonymisation", International Journal of Computer Science And Technology, Vol. 23, no. 2, pp. 188-202, 2008.
  • H. Kargupta, S. Datta, Q. Wang, K. Sivakumar, "On the Privacy Preserving Properties of Random Data Perturbation Techniques", In Proceedings of the 3rd International Conference on Data Mining, pp. 99-106, 2003.
  • Jaideep Vaidya , M. Kantarcioglu, and C. Clifton, "Privacy-Preserving Naive Bayes Classification," VLDB J. , vol. 17, pp. 879-898, July 2008.
  • Jaideep Vaidya, Chris Clifton, "Privacy-Preserving Data Mining: Why, How, and When," IEEE Security and Privacy, vol. 2, no. 6, pp. 19-27, November-December, 2004.
  • J. Vaidya, C. Clifton, "Privacy Preserving Naive Bayes Classifier for Vertically Partitioned Data", In Proceedings of the 2004 SIAM International Conference on Data Mining, pp. 522–526, 2004.
  • J. Vaidya, C. Clifton, "Privacy-Preserving k-Means Clustering over Vertically Partitioned Data", In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 206–215, 2003.
  • L. Guo, S. Guo, X. Wu, "Privacy Preserving Market Basket Data Analysis", In Proceedings the 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, pp. 103-114, 2007.
  • Lindell, Yehuda, Pinkas, "Privacy preserving data mining", In Proceedings of the Advances in Cryptology–CRYPTO, pp. 36–54,2000.
  • Li Liu , Murat Kantarcioglu and Bhavani Thuraisingham "Privacy Preserving Decision Tree Mining from Perturbed Data",In Proceedings of the 42nd Hawaii International Conference on System Sciences – 2009.
  • M. Kantarcioglu and O. Kardes, "Privacy-Preserving Data Mining in the Malicious Model," Int'l J. Information and Computer Security, vol. 2, pp. 353-375, Jan. 2009.
  • M. Kantarcioglu, C. Clifton, "Privacy-Preserving Distributed Mining of Association Rules on Horizontally Partitioned Data", IEEE Transactions on Knowledge and Data Engineering, Vol. 16,No. 9, pp. 1026-1037, 2004.
  • Murat Kantarcioglu and Wei Jiang, "Incentive Compatible Privacy-Preserving Data Analysis", IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 25, NO. 6, JUNE 2013.
  • Rakesh Agrawal and Evimaria Terzi , "On Honesty in Sovereign Information Sharing," Proc. Int'l Conf. Advances in Database Technology, pp. 240-256, 2006.
  • Rakesh Agrawal, R. Srikant, "Privacy-Preserving Data Mining", ACM SIGMOD Record, New York, Vol. 29, no. 2, pp. 439-450,2000.
  • S. J. Rizvi, J. R. Haritsa, "Maintaining Data Privacy in Association Rule Mining", In Proceedings the 28th VLDB conference, pp. 1-12, 2002.
  • Wei , J. L. Lin and M. C. , "Genetic Algorithm-Based Clustering Approach for k-Anonymization", International Journal of Expert Systems with Applications, Vol. 36, no. 6, pp. 9784-9792, 2009.
  • Wenliang Du and Zhijun Zhan , "Building Decision Tree Classifier on Private Data," Proc. IEEE Int'l Conf. Data Mining Workshop Privacy,Security, and Data Mining, C. Clifton and V. Estivill-Castro, eds. ,vol. 14, pp. 1-8, Dec. 2002.
  • W. Jiang, C. Clifton, and M. Kantarco_glu, "Transforming Semi-Honest Protocols to Ensure Accountability," Data and Knowledge Eng. , vol. 65, no. 1, pp. 57-74, 2008.
  • W. Jiang, M. Murugesan, C. Clifton, and L. Si, "Similar Document Detection with Limited Information Disclosure," Proc. 24th Int'l Conf. Data Eng. (ICDE '08), Apr. 2008.
  • W. Jiang and B. K. Samanthula, "A Secure and Distributed Framework to Identify and Share Needed Information," Proc. IEEE Int'l Conf. Privacy, Security, Risk and Trust (PASSAT '11), Oct. 2011.
  • X. K. Xiao, Y. F. Tao, "Personalized Privacy Preservation", In Proceedings of the ACM Conference on Management of Data (SIGMOD), pp. 229-240, 2006.
  • X. Lin, C. Clifton, and M. Zhu, "Privacy Preserving Clustering with Distributed EM Mixture Modeling," Knowledge and Information Systems, vol. 8, no. 1, pp. 68-81, July 2005.
  • Yao, C. Andrew, "How to Generate and Exchange Secrets", In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pp. 162-167, 1986.