Privacy Preserving Frequent Pattern Mining on Multi-cloud Environment

As the age of big data evolves, outsourcing of data mining tasks to multi-cloud environments has become a popular trend. To ensure the data privacy in outsourcing of mining tasks, the concept of support anonymity was proposed to hide sensitive information about patterns. Existing methods that tackle the privacy issues, however, do not address the related parallel mining techniques. To fill this gap, we refer to a pseudo-taxonomy based technique, called as k-support anonymity, and improve it into multi-cloud environments. This has several advantages. First, outsourcing to multi-cloud environments can meet the requirement of great computational resources in big data mining, and also parallelize the mining tasks for better efficiency. Second, the data that we send out to a cloud can be partial. An assaulter who gets the data in one cloud can never re-construct the original data. That means it is more difficult for an assailant to violate the privacy in outsourced data. Experimental results also demonstrated that our approaches can achieve good protection and better computation efficiency.

[1]  Jiawei Han,et al.  Discovery of Multiple-Level Association Rules from Large Databases , 1995, VLDB.

[2]  Ming-Syan Chen,et al.  Privacy-preserving outsourcing support vector machines with random transformation , 2010, KDD.

[3]  Jie Wu,et al.  Outsourcing privacy-preserving social networks to a cloud , 2013, 2013 Proceedings IEEE INFOCOM.

[4]  Philip S. Yu,et al.  Mining Colossal Frequent Patterns by Core Pattern Fusion , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[5]  R. Suganya,et al.  Data Mining Concepts and Techniques , 2010 .

[6]  Rajkumar Buyya,et al.  Market-Oriented Cloud Computing: Vision, Hype, and Reality for Delivering IT Services as Computing Utilities , 2008, 2008 10th IEEE International Conference on High Performance Computing and Communications.

[7]  Richard Spillman,et al.  Use of a genetic algorithm in the crypt-analysis of simple substitution ciphers , 1993 .

[8]  Murat Kantarcioglu,et al.  An Efficient Approximate Protocol for Privacy-Preserving Association Rule Mining , 2009, PAKDD.

[9]  K. Liu,et al.  Towards identity anonymization on graphs , 2008, SIGMOD Conference.

[10]  Philip S. Yu,et al.  On static and dynamic methods for condensation-based privacy-preserving data mining , 2008, TODS.

[11]  Cong Wang,et al.  Privacy-Preserving Public Auditing for Data Storage Security in Cloud Computing , 2010, 2010 Proceedings IEEE INFOCOM.

[12]  Ashwin Machanavajjhala,et al.  l-Diversity: Privacy Beyond k-Anonymity , 2006, ICDE.

[13]  Laks V. S. Lakshmanan,et al.  Privacy-Preserving Mining of Association Rules From Outsourced Transaction Databases , 2013, IEEE Systems Journal.

[14]  Philip S. Yu,et al.  Data Mining for Business Applications , 2010, Frontiers in Artificial Intelligence and Applications.

[15]  Taneli Mielikäinen,et al.  Privacy Problems with Anonymized Transaction Databases , 2004, Discovery Science.

[16]  Salve Bhagyashri Salve Bhagyashri,et al.  Privacy-Preserving Public Auditing For Secure Cloud Storage , 2014 .

[17]  Philip S. Yu,et al.  k-Support anonymity based on pseudo taxonomy for outsourcing of frequent itemset mining , 2010, KDD.

[18]  Ninghui Li,et al.  On the (In)Security and (Im)Practicality of Outsourcing Precise Association Rule Mining , 2009, 2009 Ninth IEEE International Conference on Data Mining.

[19]  Joydeep Ghosh,et al.  Privacy-preserving distributed clustering using generative models , 2003, Third IEEE International Conference on Data Mining.

[20]  Ling Qiu,et al.  Preserving privacy in association rule mining with bloom filters , 2006, Journal of Intelligent Information Systems.

[21]  Mikhail J. Atallah,et al.  Privacy-Preserving Business Process Outsourcing , 2012, 2012 IEEE 19th International Conference on Web Services.

[22]  Ramakrishnan Srikant,et al.  Privacy-preserving data mining , 2000, SIGMOD '00.

[23]  Philip S. Yu,et al.  A border-based approach for hiding sensitive frequent itemsets , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[24]  Julien Vayssière,et al.  Privacy-preserving data analytics as an outsourced service , 2008, SWS '08.

[25]  Ramakrishnan Srikant,et al.  Mining generalized association rules , 1995, Future Gener. Comput. Syst..

[26]  Rajkumar Buyya,et al.  Market-Oriented Cloud Computing: Vision, Hype, and Reality of Delivering Computing as the 5th Utility , 2009, 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid.

[27]  Nikos Mamoulis,et al.  Security in Outsourcing of Association Rule Mining , 2007, VLDB.

[28]  Ashutosh Saxena,et al.  A cryptography based privacy preserving solution to mine cloud data , 2010, Bangalore Compute Conf..

[29]  Ninghui Li,et al.  t-Closeness: Privacy Beyond k-Anonymity and l-Diversity , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[30]  Yu Fu,et al.  A privacy protection technique for publishing data mining models and research data , 2010, TMIS.

[31]  Alexandre V. Evfimievski,et al.  Privacy preserving mining of association rules , 2002, Inf. Syst..

[32]  Dino Pedreschi,et al.  Anonymity preserving pattern discovery , 2008, The VLDB Journal.

[33]  Jian Pei,et al.  Preserving Privacy in Social Networks Against Neighborhood Attacks , 2008, 2008 IEEE 24th International Conference on Data Engineering.