Voting Systems

Wednesday, October 03, 2018
12:00 PM to 1:00 PM
EER 0.904 (Mulva auditorium)
Free and open to the public

Elections must satisfy a variety of seemingly contradictory properties. We need convincing evidence that the election tallies are correct, while we cannot keep evidence that might link voters to their votes. Voting systems must be simple and easy to use for the entire voting population and cheap to purchase and operate for voting officials. And, on top of all that, they must be resistant to attacks from the most talented nation-state adversaries, without requiring the same sophistication on the part of the defenders. This talk will describe some of our efforts to understand vulnerabilities in existing voting systems and to build sophisticated alternatives with state of the art technologies.

x x


Dan Wallach

Rice University

Dan S. Wallach is a Professor in the Departments of Computer Science and Electrical and Computer Engineering and a Rice Scholar at the Baker Institute for Public Policy at Rice University. His research considers a variety of topics in computer security, including electronic voting systems security, where he served as the director of an NSF-funded multi-institution research center, ACCURATE (A Center for Correct, Usable, Reliable, Auditable, and Transparent Elections), from 2005-2011. He has also served as a member of the Air Force Science Advisory Board (2011-2015) and the USENIX Association Board of Directors (2011-2013).

Wallach earned his M.A. (1995) and PhD (1999) from Princeton University, advised by Profs. Edward Felten and Andrew Appel. He earned his B.S. EE/CS from the University of California, at Berkeley (1993).