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

Changyu Dong, Liqun Chen

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

20 Citations (Scopus)
77 Downloads (Pure)


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.
Original languageEnglish
Title of host publicationAdvances in Knowledge Discovery and Data Mining
Subtitle of host publicationPAKDD 2014
EditorsVincent S. Tseng, Tu Bao Ho , Zhi-Hua Zhou, Arbee L. P. Chen, Hung-Yu Kao
Number of pages12
ISBN (Print)9783319066073
Publication statusPublished - 2014

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


  • data mining
  • knowledge discovery
  • artificial intelligence
  • information storage


Dive into the research topics of 'A fast secure dot product protocol with application to privacy preserving association rule mining'. Together they form a unique fingerprint.

Cite this