Efficient paillier cryptoprocessor for privacy‐preserving data mining
Authors:
- 21 February 2016
- journal article
- Published by Wiley in Security and Communication Networks
- Vol. 9 (11) , 1535-1546
Abstract
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.Keywords
This publication has 28 references indexed in Scilit:
- Arbitrarily distributed data-based recommendations with privacyData & Knowledge Engineering, 2012
- Compact Keccak Hardware Architecture for Data Integrity and Authentication on FPGAsInformation Security Journal: A Global Perspective, 2012
- A FPGA-BASED RECONFIGURABLE PARALLEL ARCHITECTURE FOR HIGH-PERFORMANCE NUMERICAL COMPUTATIONJournal of Circuits, Systems and Computers, 2011
- A low-area unified hardware architecture for the AES and the cryptographic hash function ECHOJournal of Cryptographic Engineering, 2011
- Utilizing hard cores of modern FPGA devices for high-performance cryptographyJournal of Cryptographic Engineering, 2011
- Montgomery Modular Multiplication on Reconfigurable Hardware: Systolic versus Multiplexed ImplementationInternational Journal of Reconfigurable Computing, 2011
- Accurate and large-scale privacy-preserving data mining using the election paradigmData & Knowledge Engineering, 2009
- High-radix Montgomery modular exponentiation on reconfigurable hardwareIEEE Transactions on Computers, 2001
- Space/time trade-offs for higher radix modular multiplication using repeated additionIEEE Transactions on Computers, 1997
- Modular multiplication without trial divisionMathematics of Computation, 1985