Comparative analysis of Paillier and BFV cryptosystems for building an electronic voting system
2026, vol.18 , no.2, pp. 83-94
Article [2026-02-08]
This study presents a comparative performance evaluation of the Paillier and BFV homomorphic encryption schemes applied to a simplified voting model using one-hot encoded ballots. The experimental setup involved a Python-based implementation of both schemes: a custom implementation of Paillier and the TenSEAL library for BFV. Key performance metrics, including encryption time, homomorphic aggregation time, decryption time, and ciphertext size, were measured across varying voter counts (1,000 to 10,000). Results demonstrate that Paillier has significantly lower aggregation time, while BFV achieves substantially lower encryption and decryption latency, especially under non-batching conditions. However, BFV offers stronger theoretical security guarantees under standard lattice assumptions.
homomorphic encryption, electronic voting, Paillier, BFV, performance comparison
https://doi.org/10.59035/COCC2220
Jalal Alizadeh, Ali Huseynli. Comparative analysis of Paillier and BFV cryptosystems for building an electronic voting system. International Journal on Information Technologies and Security, vol.18 , no.2, 2026, pp. 83-94. https://doi.org/10.59035/COCC2220