A fast secure dot product protocol with application to privacy preserving association rule mining

Tools

Dong, Changyu and Chen, Liqun; Tseng, Vincent S. and Ho, Tu Bao and Zhou, Zhi-Hua and Chen, Arbee L. P. and Kao, Hung-Yu, eds. (2014) A fast secure dot product protocol with application to privacy preserving association rule mining. In: Advances in Knowledge Discovery and Data Mining. Lecture Notes in Computer Science . Springer, pp. 606-617. ISBN 9783319066073 (http://link.springer.com/chapter/10.1007%2F978-3-3...)

[thumbnail of Dong-Chen-PAKDD2014-privacy-preserving-association-rule-mining] PDF. Filename: Dong_Chen_PAKDD2014_privacy_preserving_association_rule_mining.pdf
Accepted Author Manuscript
Download (302kB)

Abstract

Data mining often causes privacy concerns. To ease the concerns, various privacy preserving data mining techniques have been proposed. However, those techniques are often too computationally intensive to be deployed in practice. Efficiency becomes a major challenge in privacy preserving data mining. In this paper we present an efficient secure dot product protocol and show its application in privacy preserving association rule mining, one of the most widely used data mining techniques. The protocol is orders of magnitude faster than previous protocols because it employs mostly cheap cryptographic operations, e.g. hashing and modular multiplication. The performance has been further improved by parallelization. We implemented the protocol and tested the performance. The test result shows that on moderate commodity hardware, the dot product of two vectors of size 1 million can be computed within 1 minute. As a comparison, the currently most widely used protocol needs about 1 hour and 23 minutes.

ORCID iDs

Dong, Changyu ORCID logoORCID: https://orcid.org/0000-0002-8625-0275 and Chen, Liqun; Tseng, Vincent S., Ho, Tu Bao, Zhou, Zhi-Hua, Chen, Arbee L. P. and Kao, Hung-Yu
CORE (COnnecting REpositories)