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

Optimized two party privacy preserving association rule mining using fully homomorphic encryption

Kaosar, M.G., Paulet, R. and Yi, X. (2011) Optimized two party privacy preserving association rule mining using fully homomorphic encryption. In: Xiang, Y., Cuzzocrea, A., Hobbs, M. and Zhou, W., (eds.) ICA3PP 2011: Algorithms and Architectures for Parallel Processing. Springer, Berlin, Heidelberg, pp. 360-370.

Link to Published Version:
*Subscription may be required


In two party privacy preserving association rule mining, the issue to securely compare two integers is considered as the bottle neck to achieve maximum privacy. Recently proposed fully homomorphic encryption (FHE) scheme by Dijk can be applied in secure computation. Kaosar, Paulet and Yi have applied it in preserving privacy in two-party association rule mining, but its performance is not very practical due to its huge cyphertext, public key size and complex carry circuit. In this paper we propose some optimizations in applying Dijk’s encryption system to securely compare two numbers. We also applied this optimized solution in preserving privacy in association rule mining (ARM) in two-party settings. We have further enhanced the two party secure association rule mining technique proposed by Kaosar The performance analysis shows that this proposed solution achieves a significant improvement.

Item Type: Book Chapter
Publisher: Springer, Berlin, Heidelberg
Copyright: © 2011 Springer-Verlag Berlin Heidelberg
Other Information: Part of the Lecture Notes in Computer Science book series (LNCS, volume 7016) 11th International Conference, ICA3PP, Melbourne, Australia, October 24-26, 2011, Proceedings, Part I
Item Control Page Item Control Page