Abstract
The discovery of frequent patterns, association rules, and correlation relationships among huge amounts of data is useful to business intelligence in this big data era. We propose a new scheme which is a secure and efficient association rule mining (ARM) method on horizontally partitioned databases. We enhance the performance of ARM on distributed databases by combining Apriori algorithm and FP-tree in this new situation. To help the implement of combining Apriori algorithm and FP-tree on distributed databases, we originally come up with a method of merging FP-tree in our scheme. We take advantage of Homomorphic Encryption to guarantee the security and efficiency of data operation in our scheme. More speficially, we use Paillier’s homomorphic encryption method which only has addition homogeneity to encrypt items’ supports. At last, we perform experimental analysis for our scheme to show that our proposal outperform the existing schemes.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Cheung, D.W., Han, J., Ng, V.T., et al.: A fast distributed algorithm for mining association rules. In: IEEE International Conference on Parallel, Distributed Information Systems, pp. 31–42 (2011)
Han, J., Pei, J., Yin, Y., et al.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min. Knowl. Discov. 8(1), 53–87 (2004)
Kantarcioglu, M., Clifton, C.: Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Trans. Knowl. Data Eng. 9, 1026–1037 (2004)
Tassa, T.: Secure mining of association rules in horizontally distributed databases. IEEE Trans. Knowl. Data Eng. 26(4), 970–983 (2014)
Kotsiantis, S., Kanellopoulos, D.: Association rules mining: a recent overview. GESTS Int. Trans. Comput. Sci. Eng. 32(1), 71–82 (2006)
Fukasawa, T., Wang, J., Takata, T., Miyazaki, M.: An effective distributed privacy-preserving data mining algorithm. In: Yang, Z.R., Yin, H., Everson, R.M. (eds.) IDEAL 2004. LNCS, vol. 3177, pp. 320–325. Springer, Heidelberg (2004). doi:10.1007/978-3-540-28651-6_47
Luo, D., Xiao, C., Sun, S., et al.: Searching association rules of traditional Chinese medicine on Ligusticum wallichii by text mining. In: IEEE International Conference on Bioinformatics, Biomedicine (BIBM), pp. 162–167. IEEE (2013)
Czibula, G., Marian, Z., Czibula, I.G.: Detecting software design defects using relational association rule mining. Knowl. Inf. Syst. 42(3), 545–577 (2015)
Hu, J., Yang-Li, X.: A fast parallel association rules mining algorithm based on FP-forest. In: Sun, F., Zhang, J., Tan, Y., Cao, J., Yu, W. (eds.) ISNN 2008. LNCS, vol. 5264, pp. 40–49. Springer, Heidelberg (2008). doi:10.1007/978-3-540-87734-9_5
Li, H., Wang, Y., Zhang, D., et al.: PFP: parallel FP-growth for query recommendation. In: Proceedings of the 2008 ACM Conference on Recommender Systems, pp. 107–114. ACM (2008)
Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999). doi:10.1007/3-540-48910-X_16
Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 505–524. Springer, Heidelberg (2011). doi:10.1007/978-3-642-22792-9_29
Gentry, C.: Fully homomorphic encryption using ideal lattices. STOC 9, 169–178 (2009)
Naehrig, M., Lauter, K., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: Proceedings of the 3rd ACM Workshop on Cloud Computing Security Workshop, pp. 113–124. ACM (2011)
Aono, Y., Hayashi, T., Trieu Phong, L., et al.: Scalable and secure logistic regression via homomorphic encryption. In: Data and Application Security and Privacy, pp. 142–144. ACM (2016)
Park, J.S., Chen, M.S., Yu, P.S.: An effective hash-based algorithm for mining association rules. ACM (1995)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. VLDB 1215, 487–499 (1994)
Gomez-Barrero, M., Fierrez, J., Galbally, J.: Variable-length template protection based on homomorphic encryption with application to signature biometrics. In: International Conference on Biometrics and Forensics (IWBF). IEEE (2016)
Acknowledgments
This work is supported by National China 973 Project No. 2015CB352401; Chinese National Research Fund (NSFC) Key Project No. 61532013; JSPS Grant-in-Aid for Young Scientists (15K16005), Shanghai Scientific Innovation Act of STCSM No. 15JC1402400; 985 Project of Shanghai Jiao Tong University with No. WF220103001, and Shanghai Jiao Tong University 211 Fund.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Jin, Y., Su, C., Ruan, N., Jia, W. (2016). Privacy-Preserving Mining of Association Rules for Horizontally Distributed Databases Based on FP-Tree. In: Bao, F., Chen, L., Deng, R., Wang, G. (eds) Information Security Practice and Experience. ISPEC 2016. Lecture Notes in Computer Science(), vol 10060. Springer, Cham. https://doi.org/10.1007/978-3-319-49151-6_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-49151-6_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49150-9
Online ISBN: 978-3-319-49151-6
eBook Packages: Computer ScienceComputer Science (R0)