Murdoch University Research Repository

Welcome to the Murdoch University Research Repository

The Murdoch University Research Repository is an open access digital collection of research
created by Murdoch University staff, researchers and postgraduate students.

Learn more

Fully homomorphic encryption based two-party association rule mining

Kaosar, M.G., Paulet, R. and Yi, X. (2012) Fully homomorphic encryption based two-party association rule mining. Data & Knowledge Engineering, 76-78 . pp. 1-15.

Link to Published Version:
*Subscription may be required


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.

Item Type: Journal Article
Publisher: Elsevier BV
Copyright: © 2012 Elsevier B.V.
Item Control Page Item Control Page