Explore the intricacies of verifiable mix nets in electronic voting systems through this 15-minute IEEE conference talk. Delve into the importance of machine-checked cryptographic properties and the challenges of implementing cryptography in voting systems. Learn about software independence, common mix net types, and the interactive theorem proving approach. Examine the formalization process, its limitations, and the Virginia Transformer. Gain insights into the future of formally verifying mix nets to enhance the security and reliability of electronic voting.
Did You Mix Me? Formally Verifying Verifiable Mix Nets in Electronic Voting
Overview
Syllabus
Introduction
Clarification
What are verifiable mix nets
Machine checking cryptographic properties
What are mix nets
Implementing cryptography is hard
Software independence
Most common mix nets
Interactive Theorem
Background
Formalization
Limitations
Virginia Transformer
Future Work
Taught by
IEEE Symposium on Security and Privacy
