Verifiable Voting With Homomorphic Encryption

HN commenters point to it in election-security threads as an accessible explainer of how a vote can be verifiable but not sellable.

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.