A Privacy-Preserving Framework for Collaborative Association Rule Mining in Cloud

Collaborative Data Mining facilitates multiple organizations to integrate their datasets and extract useful knowledge from their joint datasets for mutual benefits. The knowledge extracted in this manner is found to be superior to the knowledge extracted locally from a single organization's dataset. With the rapid development of outsourcing, there is a growing interest for organizations to outsource their data mining tasks to a cloud environment to effectively address their economic and performance demands. However, due to privacy concerns and stringent compliance regulations, organizations do not want to share their private datasets neither with the cloud nor with other participating organizations. In this paper, we address the problem of outsourcing association rule mining task to a federated cloud environment in a privacy-preserving manner. Specifically, we propose a privacy-preserving framework that allows a set of users, each with a private dataset, to outsource their encrypted databases and the cloud returns the association rules extracted from the aggregated encrypted databases to the participating users. Our proposed solution ensures the confidentiality of the outsourced data and also minimizes the users' participation during the association rule mining process. Additionally, we show that the proposed solution is secure under the standard semihonest model and demonstrate its practicality.

[1]  Wei Jiang,et al.  Secure k-nearest neighbor query over encrypted data in outsourced environments , 2013, 2014 IEEE 30th International Conference on Data Engineering.

[2]  Setsuo Ohsuga,et al.  INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES , 1977 .

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

[4]  Wei Jiang,et al.  An efficient and probabilistic secure bit-decomposition , 2013, ASIA CCS '13.

[5]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[6]  John Gantz,et al.  The Digital Universe in 2020: Big Data, Bigger Digital Shadows, and Biggest Growth in the Far East , 2012 .

[7]  Elisa Bertino,et al.  Homomorphic Encryption and Applications , 2014, SpringerBriefs in Computer Science.

[8]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

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

[10]  Bharath K. Samanthula,et al.  Privacy-preserving outsourced collaborative frequent itemset mining in the cloud , 2017, 2017 IEEE International Conference on Big Data (Big Data).

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

[12]  Rajarshi Shahu,et al.  K-Nearest Neighbor Classification over Semantically Secure Encrypted Relational Data , 2016 .

[14]  Elisa Bertino,et al.  Privacy-Preserving Association Rule Mining in Cloud Computing , 2015, AsiaCCS.

[15]  Minoru Kuribayashi,et al.  Fingerprinting protocol for images based on additive homomorphic property , 2005, IEEE Transactions on Image Processing.

[16]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[17]  Ashwin Machanavajjhala,et al.  Big privacy: protecting confidentiality in big data , 2012, XRDS.