Kaosar, Md. Golam, Paulet, Russell and Yi, Xun (2011) Optimized Two Party Privacy Preserving Association Rule Mining Using Fully Homomorphic Encryption. In: Algorithms and Architectures for Parallel Processing: 11th International Conference, ICA3PP, Melbourne, Australia, October 24-26, 2011, Proceedings, Part I. Xiang, Yang, Cuzzocrea, Alfredo, Hobbs, Michael and Zhou, Wanlei, eds. Lecture Notes in Computer Science, Vol. 7016 . Springer, Heidelberg, pp. 360-370.

Abstract

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 et.al. 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 et.al.’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 et.al. The performance analysis shows that this proposed solution achieves a significant improvement.

Search Google Scholar

Repository staff login