Unverified50% confidenceFactExact time
In electronic voting, additive homomorphic schemes (such as Paillier encryption) are typically used, where tallying authorities multiply all encrypted ballots and decrypt the result to obtain each candidate's total vote count without decrypting any individual ballot.
1
Sources
50%
Confidence
Long-term
Relevance
11/3/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedEstonia's i-Voting uses a double-envelope scheme based on public-key cryptography that separates vote content from identity.76% similarUnverifiedIn remote voting scenarios, voter verifiability is especially difficult, because malware may tamper with what the voter sees without the voter being able to notice.74% similarUnverifiedEnd-to-end verifiability requires that the system be able to prove that "cast votes are correctly recorded" and that "recorded votes are correctly tallied," without compromising voting privacy.72% similarUnverifiedWithout trustworthy physical backups and a transparent audit process, purely electronic voting should not become the sole method for mainstream elections.71% similarUnverifiedTraditional distributed systems use Byzantine fault-tolerant algorithms (such as PBFT) to reach consensus through multiple rounds of voting and message signatures.63% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1132529API
curl https://kongchang.com/api/v1/knowledge/claims/1132529MCP
get_claim(id=1132529)