Visible to the public Fast Decryption Algorithm for Paillier Homomorphic Cryptosystem

TitleFast Decryption Algorithm for Paillier Homomorphic Cryptosystem
Publication TypeConference Paper
Year of Publication2020
AuthorsOgunseyi, T. B., Bo, T.
Conference Name2020 IEEE International Conference on Power, Intelligent Computing and Systems (ICPICS)
Date Publishedjul
KeywordsAlgorithm, Cathode ray tubes, Complexity theory, computational cost, Computational efficiency, cryptography, data privacy, decryption, decryption speed, encrypted data, Encryption, fast decryption algorithm, fast decryption process, homomorphic encryption, human factors, improved decryption process, Metrics, modular multiplicative arithmetic, paillier cryptosystem, Paillier homomorphic cryptosystem, Paillier homomorphic encryption scheme, pubcrawl, public-key cryptosystem, Resiliency, Scalability, storage paradigm
AbstractWith the shift in storage paradigm, there is an increasing need for privacy of dataset and also for an encryption scheme that permits computation on encrypted data. Paillier cryptosystem is a good example of such a homomorphic encryption scheme. To improve the efficiency of the Paillier homomorphic encryption scheme in terms of its decryption speed and overall computational cost, we propose an improved decryption process. Specifically, the inclusion of a variable k to reduce the modular multiplicative arithmetic. The variable k is combined with the L function and CRT recombination method, to arrive at a fast and improved decryption process, showing the mathematical correctness of the decryption algorithm. Experimental results validate that our scheme is significantly efficient in its decryption speed.
Citation Keyogunseyi_fast_2020