Privacy Preserving Mining Association Rule from Outsourced Transaction

Authors

  • Thiruvenkatasamy  Department of Computer Science and Engineering, Anna University, Anna University, Chennai, India
  • Deverajsamy. S  Department of Computer Science and Engineering, Anna University, Anna University, Chennai, India
  • Dhanraj. M  Department of Computer Science and Engineering, Anna University, Anna University, Chennai, India

Keywords:

Rule Mining Task, Outsourced Mining, Direct Mail Marketing, Privacy Preserving.

Abstract

Reproached by developments such as cloud computing, there has been considerable recent interest in paradigm of data mining-as-a-service. The company (data owner) lacking in expertise or computational resources can outsource it’s to the third revelry service worker (server). However, both items and association rules of outsourced database are considered private property of corporation (data owner). To protect corporate privacy, data owner transforms its data and ships it to server, sends mining queries to server, and recovers true patterns from extracted patterns received from server. In these paper, we study problem of outsourcing association rule mining task within the corporate privacy-preserving outline. We recommend an attack model based on background knowledge and devise the scheme for privacy preserving outsourced mining. Our scheme ensures that each transformed item was indistinguishable, w.r.t. attacker’s background knowledge, from at minimum k-1 other transformed items. Our comprehensive experiments on the very large and real transaction database establish that our systems are effective, scalable, and protect privacy.

References

  1. R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules in Large Databases,” Proc 20th Int’l Conf. Very Large Data Bases (VLDB), pp. 487-499, 1994.
  2. R. Agrawal and R. Srikant, “Privacy-Preserving Data Mining,” Proc. ACM SIGMOD Conf., pp. 439-450, 2000.
  3. D. Beaver, S. Micali, and P. Rogaway, “The Round Complexity of Secure Protocols,” Proc. 22nd Ann. ACM Symp. Theory of Computing (STOC), pp. 503-513, 1990.
  4. M. Bellare, R. Canetti, and H. Krawczyk, “Keying Hash Functions for Message Authentication,” Proc. 16th Ann. Int’l Cryptology Conf. Advances in Cryptology (Crypto), pp. 1-15, 1996.
  5. A. Ben-David, N. Nisan, and B. Pinkas, “FairplayMP - the System for Secure Multi-Party Computation,” Proc. 15th ACM Conf. Computer and Comm. Security (CCS), pp. 257-266, 2008.
  6. J.C. Benaloh, “Secret Sharing Homomorphisms: Keeping Shares of the Secret Secret,” Proc. Advances in Cryptology (Crypto), pp. 251-260, 1986.
  7. J. Brickell and V. Shmatikov, “Privacy-Preserving Graph Algorithms in Semi-Honest Model,” Proc. 11th Int’l Conf. Theory and Application of Cryptology and Information Security (ASIACRYPT), pp. 236-252, 2005.

Downloads

Published

2017-12-31

Issue

Section

Research Articles

How to Cite

[1]
Thiruvenkatasamy, Deverajsamy. S, Dhanraj. M, " Privacy Preserving Mining Association Rule from Outsourced Transaction, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 2, Issue 2, pp.189-193, March-April-2016.