
Efficient paillier cryptoprocessor for privacy‐preserving data mining
Author(s) -
San Ismail,
At Nuray,
Yakut Ibrahim,
Polat Huseyin
Publication year - 2016
Publication title -
security and communication networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.446
H-Index - 43
eISSN - 1939-0122
pISSN - 1939-0114
DOI - 10.1002/sec.1442
Subject(s) - paillier cryptosystem , computer science , cryptosystem , homomorphic encryption , encryption , modular exponentiation , interleaving , scheme (mathematics) , computer security , hybrid cryptosystem , theoretical computer science , public key cryptography , mathematical analysis , mathematics , operating system
Paillier cryptosystem is extensively utilized as a homomorphic encryption scheme to ensure privacy requirements in many privacy‐preserving data mining schemes. However, overall performance of the applications employing Paillier cryptosystem intrinsically degrades because of modular multiplications and exponentiation operations performed by the cryptosystem. In this study, we investigate how to tackle with such performance degradation because of Paillier cryptosystem. We first exploit parallelism among the operations in the cryptosystem and interleaving among independent operations. Then, we develop hardware realization of our scheme using field‐programmable gate arrays. As a case study, we evaluate our cryptoprocessor for a well‐known privacy‐preserving set intersection protocol. We demonstrate how the proposed cryptoprocessor responds promising performance for hard real‐time privacy‐preserving data mining applications. Copyright © 2016 John Wiley & Sons, Ltd.