Trustworthy Elections

### The Imperative for Mathematically Verifiable Elections At 00:00, Dr. Joseph Kiniry, Chief Scientist at Galois and Free & Fair, presents on building provably trustworthy, verifiable voting systems at the Voting Village. Kiniry argues that public confidence in election outcomes requires mathematical proof rather than blind institutional trust.

### Dissecting Government and Vendor Reassurances At 05:10, Kiniry evaluates public statements issued by government organizations such as NASS, NASED, DHS, and voting machine vendors. He contrasts claims that election systems are secure with empirical findings demonstrating widespread software flaws across commercial voting terminals.

### Moving From Blind Trust to Verifiable Systems At 10:25, the speaker addresses the architectural dilemma of election security. While financial systems rely on identity tracking and transactional audit trails, voting systems must maintain absolute ballot secrecy while simultaneously providing universal verification that ballots were tallied accurately.

### End-to-End Verifiable (E2E-V) Cryptographic Voting At 15:56, Kiniry details the design of End-to-End Verifiable (E2E-V) voting protocols. Under an E2E-V system, voters receive cryptographic proofs that allow them to independently verify that their ballot was recorded as intended and tallied as recorded, without revealing their candidate selection to anyone.

### Formal Verification and Open-Source Election Hardware Concluding between 21:12 and 27:24, Kiniry showcases formally verified, open-source election hardware and software designs. He emphasizes that utilizing mathematically verified microkernels and open-source specifications ensures election infrastructure remains transparent, secure, and resilient against tampering.

(AI summary — Gemini Flash)