PickVidsWas YOUR vote counted? (feat. homomorphic encryption) - Numberphile
推荐理由
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!
说明
这是2016年由Numberphile发布的一部讲解，主题归在Cryptography。它讲的是verifiable voting这一支里的具体问题，而不是把整个领域扫一遍。适合按兴趣直接看、不打算先补课的人。内容上可以概括成：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.讲法不绑某一条新闻，过几年仍然可以当材料看。从2016年到2024年，有5位不同的读者在5个不同月份把它推荐出来，其中明确叫别人去看的有0次。适合用一集把一个概念补上的人。抓住它用的那个图像或类比，比背公式重要。如果已经会了基本定义，就把注意力放在它怎么把verifiable voting变成能跟着复述的例子。
视频信息
- 频道
- Numberphile
- 时长
- 8 分 34 秒
- 发布年份
- 2016