Use case of Paillier Homomorphic Algorithm for Electronic-Voting Systems
K. Roopa, B S Gokul, S Kaushik Arakalgud · 2021 5th International Conference on Electrical, Electronics, Communication, Computer Technologies and Optimization Techniques (ICEECCOT) · 2021
In modern age, there are requirements for not only sending and receiving confidential data over the public network or for storing them in an online server but also to process such data in the open without compromising the confidentiality of the data or its originator. This calls for cryptographic algorithms with special features like homomorphic properties. Paillier cryptosystem is an example of such an algorithm. A use case of e-voting system using Paillier cryptosystem is discussed in this paper. Algorithm execution and analysis are done using Python programming language. A few useful properties of the implemented Paillier algorithm are verified and found satisfactory. A new voting scheme based on two stages of encryption and a digital envelope is also proposed for critical security requirements.