Lecture

E-voting: individual verifiability

Description

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.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.