Secure E-Voting: Homomorphic Vote Tallying

Every ballot cast here is individually encrypted under a real Paillier public key before it ever leaves the voter. Instead of decrypting each vote to count it, the simulator multiplies ciphertexts together — the defining property of an additively homomorphic cryptosystem, where multiplying encrypted values produces the encryption of their sum. The 3D ring visualizes the ciphertext ring Z_n²: each vote appears as a small sphere positioned by its encrypted value, and the pulsing sphere at the center is the running homomorphic sum. Only when you press Tally does the private key ever get used, running the genuine Paillier decryption formula on the combined ciphertext to reveal the count — no individual ballot is ever decrypted.