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

Secure Two-Party association rule mining based on One-Pass FP-Tree

Kaosar, M.G. and Yi, X. (2011) Secure Two-Party association rule mining based on One-Pass FP-Tree. International Journal of Information Security and Privacy, 5 (2). pp. 13-32.

Link to Published Version:
*Subscription may be required


Frequent Path tree (FP-tree) is a popular method to compute association rules and is faster than Apriori-based solutions in some cases. Association rule mining using FP-tree method cannot ensure entire privacy since frequency of the itemsets are required to share among participants at the first stage. Moreover, FP-tree method requires two scans of database transactions which may not be the best solution if the database is very large or the database server does not allow multiple scans. In addition, one-pass FP-tree can accommodate continuous or periodically changing databases without restarting the process as opposed to a regular FP-tree based solution. In this paper, the authors propose a one-pass FP-tree method to perform association rule mining without compromising any data privacy among two parties. A fully homomorphic encryption system over integer numbers is applied to ensure secure computation among two data sites without disclosing any number belongs to themselves.

Item Type: Journal Article
Publisher: IGI Global
Copyright: © 2011 IGI Global
Item Control Page Item Control Page