Abstract
Internet voting is an example where advanced cryptography is required, and deployed in practice, to guarantee good security properties. In this talk, we will present this context of electronic voting, as well as the (simplified) Belenios voting protocol, to illustrate the need for zero-knowledgeproofs (ZKPs).
Next, we'll describe how these ZKPs useful for voting work, starting with the most basic, and progressing to complex constructions that are more akin to multiparty computation. We'll explain how this allows us to go further than conventional voting in terms of vote secrecy, thanks to the notion oftally-hiding.
