Fully homomorphic encryption based two-party association rule mining

详细信息	查看全文 | 推荐本文 |

• 作者：Mohammed Golam Kaosar ; ^{glmksr@live.com} ; Russell Paulet ^{russell.paulet@live.vu.edu.au} ; Xun Yi ^{Xun.Yi@vu.edu.au}
• 关键词：Data mining ; Security ; Association rules ; Homomorphic encryption ; Privacy preservation
• 刊名：Data and Knowledge Engineering
• 出版年：2012
• 期刊代码：44_0169023x
• 类别：cp
• 出版时间：June-August, 2012
• 卷：76-78
• 期：Complete
• 页码：1-15
• 文件大小：626 K

摘要

Association rule mining (ARM) is one of the popular data mining methods that discover interesting correlations amongst a large collection of data, which appears incomprehensible. This is known to be a trivial task when the data is owned by one party. But when multiple data sites collectively engage in ARM, privacy concerns are introduced. Due to this concern, privacy preserving data mining algorithms have been developed to attain the desired result, while maintaining privacy. In the case of two party privacy preserving ARM for horizontally partitioned databases, both parties are required to compare their itemset counts securely. This problem is comparable to the famous millionaire problem of Yao. However, in this paper, we propose a secure comparison technique using fully homomorphic encryption scheme that provides a similar level of security to the Yao based solution, but promotes greater efficiency due to the reuse of resources.