Affiliation:
1. State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an 710071, China
2. Henan Key Laboratory of Network Cryptography Technology, Zhengzhou 450001, China
3. School of Cyber Science and Engineering, Southeast University, Nanjing 211189, China
Abstract
In the data era, to simultaneously relieve the heavy computational burden of mining data information from data owners and protecting data privacy, privacy-preserving frequent itemset mining (PPFIM) is presented and has attracted much attention. In PPFIM, data owners and miners outsource the complex task of data mining to the cloud server, which supports strong storage and computing power, and the cloud server cannot extract additional data privacy other than that which is shown by data owners or miners. However, most existing solutions assume that cloud servers will honestly perform the mining process and return the correct results, whereas cloud services are usually provided by a charging third party that may in practice return incorrect results due to computation errors, malicious or criminal activities, etc. To solve this problem, in this paper, we present a verifiable PPFIM protocol on vertically partitioned databases to support the verifiability of the integrity of the mining results, where data owners can authorize the cloud server to perform federated mining on vertically partitioned databases without leaking data information and detect dishonest behaviors in the cloud server from the returned results. We adopt a dual cloud setting to enable data owners to be offline after uploading their encrypted databases to the cloud server, which further relieves the burden on data owners. We implement our protocol and give a detailed analysis in terms of verification accuracy, which shows that the dishonest behaviors of the cloud server can be detected with a probability close to 1 and a sacrifice of only a 1% increase in database size.
Funder
National Natural Science Foundation of China
Henan Key Laboratory of Network Cryptography Technology
Fundamental Research Funds for the Central Universities
Youth Innovation Team of Shaanxi Universities
Subject
Electrical and Electronic Engineering,Computer Networks and Communications,Hardware and Architecture,Signal Processing,Control and Systems Engineering
Reference26 articles.
1. Agrawal, R., and Srikant, R. (1994, January 12–15). Fast Algorithms for Mining Association Rules in Large Databases. Proceedings of the VLDB’94, Santiago de Chile, Chile.
2. Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach;Han;Data Min. Knowl. Discov.,2004
3. Scalable Algorithms for Association Mining;Zaki;IEEE Trans. Knowl. Data Eng.,2000
4. Brijs, T., Swinnen, G., Vanhoof, K., and Wets, G. (1999, January 15–18). Using Association Rules for Product Assortment Decisions: A Case Study. Proceedings of the SIGKDD, San Diego, CA, USA.
5. Research Paper: Association Rules and Data Mining in Hospital Infection Control and Public Health Surveillance;Brossette;J. Am. Med. Inform. Assoc.,1998