Crypto and e-Voting: Homomorphisms, Zero-Knowledge Proofs, and Other Tricks of the Trade

Leuven ICT (LICT) center Distinguished Lecture Program

Lecture by Prof. Dan Wallach, Rice University
Jointly organised by LICT and secappdev.org.

This lecture, which assumes a modest amount of cryptographic knowledge in advance, explains many of the cryptographic techniques necessary to build 'end-to-end' secure cryptographic voting systems, including homomorphic Elgamal encryption, reencryption mixnets, and zero-knowledge proofs.

Speaker Dan Wallach is an associate professor in the Department of Computer Science at Rice University in Houston, Texas and is the associate director of NSF's ACCURATE (A Center for Correct, Usable, Reliable, Auditable and Transparent Elections). His research involves computer security and has touched on issues include web browsers and servers, peer to peer systems, smartphones, and voting machines. He has testified about voting security issues before government bodies in the U.S., Mexico, and the European Union, has served as an expert witness in a number of voting technology lawsuits.

Target Audience:
The lecture is targeting at students, researchers and other interested people with some knowledge of basic cryptography.

Practicalities:
Date: March 2, 2011
Time: 18:00 - 20:00 (Sandwiches are foreseen at 18:00. The actual lecture starts at 18:30)
Location: K.U.Leuven, Dept. Electrical Engineering - ESAT, Aud A, Kasteelpark Arenberg 10, Leuven, Belgium