Advanced e-voting system using Paillier homomorphic encryption algorithm

The increase of technology usage, especially in online storage data with cloud system, makes data security become one of the most important requirements for the user. One of the ways to protect the data is with encryption process, it as a process to change a data form into a new one that can only be read by the chosen recipient. This technology has been carried out in the election process with e-voting system. The high risk of security problem makes data encryption applied in the e-voting system. Thus, the ballot won't be interrupted by the insider or the outsider. The purpose of this research is to prove the effectiveness of the Paillier algorithm and its homomorphic property that implemented in an e-voting system. With homomorphic property, the system can calculate the sum of votes in ciphertext form without revealing the choice of the voters. The resulting ciphertext values will be different each other even though the same plaintext is encrypted, with a size of 4 times larger than the plaintext size. The success ratio for the system is 100% with the maximum number of messages that can be processed is 3.287.937.778 messages.