Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the e-voting system of Swiss Post, focusing on individual verifiability. It explains the use of verifiable protocols to ensure the integrity of votes, the importance of individual and universal verifiability, and the implementation of ElGamal encryption. The lecture also delves into zero-knowledge proofs, non-interactive zero-knowledge proofs, and their applications in e-voting. It discusses the generation of verification codes, the need for proofs to ensure vote integrity, and the challenges in protocol implementation. The presentation concludes with insights on the creation of secure crypto protocols and the importance of careful implementation to maintain verifiability.