Was YOUR vote counted? (feat. homomorphic encryption) - Numberphile
5 人推荐 · 跨 5 个月 · 2016–2024
中文导读
科普频道 Numberphile 专访密码学图灵奖得主 Ron Rivest（RSA 中的 R），深入浅出地讲解「端到端可验证电子投票系统」：如何利用同态加密与防篡改凭证，让选民既能独立验证自己的选票已被计入总票数，又无法向第三方证明自己投给了谁（杜绝买票受贿与强迫投票）。
为什么 HN 推它
HN 讨论选举安全与密码学机制时的经典科普，完美阐明了如何做到「选票可验证，但不可出卖」。
「密码学家们极其聪明，想出了一种既能让你确认自己选票已被计入、又没办法向第三方证明你到底投了谁的精妙机制！」HN 网友原话：Cryptographers are clever and have figured out a way to let you know your vote was counted without being able to prove it to a third party!
英文原摘要（HackerTube / Claude 整理）
Numberphile interviews cryptographer Ron Rivest about end-to-end verifiable voting. He explains how homomorphic encryption and receipts let a voter confirm their ballot was counted without being able to prove how they voted to anyone else.
HN commenters point to it in election-security threads as an accessible explainer of how a vote can be verifiable but not sellable.
HN 上的提及
Ron Rivest was recently on Numberphile, where he talked about using homomorphic encryption to enable end-to-end verifiable voting.
Explains homomorphic encryption for vote tallying
There are a few mathematical possibilities but they don't seem particularly practical to me
I find Rivest's video( ) on homomorphic encryption as voting mechanism quite interesting.
describes one electronic voting system that's supposed to have those important properties