Elliptic Curve Cryptography Based Mining of Privacy Preserving Association Rules in Unsecured Distributed Environment

TLDR: An elliptic curve cryptography based algorithm is proposed to mine privacy-preserving association rules on horizontal partitioned data and provides privacy and security against involving parties and other parties (adversaries) who can reveal information by reading unsecured channel between involving parties.

Abstract: Distributed data mining techniques are often used for various applications. In terms of privacy and security issues, these techniques are recently investigated with a conclusion that they reveal data or information to each other parties involved to find global valid results. But because of privacy issues, involving parties do not want to reveal such type of data. Recently many cryptography techniques have been found to address privacy problems in distributed mining. In this paper, we propose an elliptic curve cryptography based algorithm to mine privacy-preserving association rules on horizontal partitioned data. Moreover, we have also considered unsecured communication channels in distributed environment. Proposed algorithm provides privacy and security against involving parties and other parties (adversaries) who can reveal information by reading unsecured channel between involving parties. Finally, we analyze the privacy and security provided by proposed algorithm and also discuss the communication and computation cost of proposed algorithm. Keywords-Data Mining; Association Rules; Distributed Databases; Privacy; Security; Eliptic Curve Cryptography;