Privacy-Preserving Mining of Association Rule on Outsourced Cloud Data from Multiple Parties

It has been widely recognized as a challenge to carry out data analysis and meanwhile preserve its privacy in the cloud. In this work, we mainly focus on a well-known data analysis approach namely association rule mining. We found that the data privacy in this mining approach have not been well considered so far. To address this problem, we propose a scheme for privacy-preserving association rule mining on outsourced cloud data which are uploaded from multiple parties in a twin-cloud architecture. In particular, we mainly consider the scenario where the data owners and miners have different encryption keys that are kept secret from each other and also from the cloud server. Our scheme is constructed by a set of well-designed two-party secure computation algorithms, which not only preserve the data confidentiality and query privacy but also allow the data owner to be offline during the data mining. Compared with the state-of-art works, our scheme not only achieves higher level privacy but also reduces the computation cost of data owners.

[1]  Stefan Katzenbeisser,et al.  Efficiently Outsourcing Multiparty Computation Under Multiple Keys , 2013, IEEE Transactions on Information Forensics and Security.

[2]  Oded Goldreich,et al.  Foundations of Cryptography: Volume 2, Basic Applications , 2004 .

[3]  Ming Li,et al.  Toward Practical Privacy-Preserving Frequent Itemset Mining on Encrypted Cloud Data , 2020, IEEE Transactions on Cloud Computing.

[4]  Changyu Dong,et al.  A Fast Secure Dot Product Protocol with Application to Privacy Preserving Association Rule Mining , 2014, PAKDD.

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

[6]  Ximeng Liu,et al.  An Efficient Privacy-Preserving Outsourced Calculation Toolkit With Multiple Keys , 2016, IEEE Transactions on Information Forensics and Security.

[7]  T. Elgamal A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[8]  Robert H. Deng,et al.  Towards semantically secure outsourcing of association rule mining on categorical data , 2014, Inf. Sci..

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

[10]  Xiaohong Jiang,et al.  Secure k-NN Query on Encrypted Cloud Data with Multiple Keys , 2017 .

[11]  Sunita Sarawagi,et al.  Data mining models as services on the internet , 2000, SKDD.

[12]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

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

[14]  Kim-Kwang Raymond Choo,et al.  Privacy-Preserving-Outsourced Association Rule Mining on Vertically Partitioned Databases , 2016, IEEE Transactions on Information Forensics and Security.

[15]  Changyu Dong,et al.  When private set intersection meets big data: an efficient and scalable protocol , 2013, CCS.

[16]  Chris Clifton,et al.  Privacy-preserving distributed mining of association rules on horizontally partitioned data , 2004, IEEE Transactions on Knowledge and Data Engineering.

[17]  Dan Boneh,et al.  Evaluating 2-DNF Formulas on Ciphertexts , 2005, TCC.

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

[19]  Jaideep Vaidya,et al.  Privacy preserving association rule mining in vertically partitioned data , 2002, KDD.

[20]  Emmanuel Bresson,et al.  A Simple Public-Key Cryptosystem with a Double Trapdoor Decryption Mechanism and Its Applications , 2003, ASIACRYPT.