Talks & Seminars
Title: Independently-Verifiable Secret-Ballot Elections
Prof. Poorvi L. Vora, Dept. of Computer Science, The George Washington University, Washington D. C.
Date & Time: January 5, 2011 14:30
Venue: Seminar Hall, Ground Floor, Old CSE Building
How does one conduct an independently-verifiable election while maintaining ballot secrecy? How does one define desirable properties of voting systems and measure a voting system's deviation from these properties? Can one actually hold a governmental election that is independently-verifiable and provides ballot secrecy? I will describe the use of information theory to understand and measure the limitations of voting systems, and present a general model of the new class of cryptographic "end-to-end" (E2E) independently-verifiable voting systems. I will also describe Scantegrity II, an E2E system that was used for the 2009 municipal election of the City of Takoma Park, MD, the first time in election history that voters were able to independently audit a secret-ballot governmental election. This work is joint with several collaborators: the Scantegrity team -- Rick Carback, David Chaum, Jeremy Clark, Aleks Essex, Stefan Popoveniuc, Ronald L. Rivest, Emily Shen, Alan Sherman -- and also Lillie Coney, Jeroen van de Graaf, Joseph Hall, Ben Hosp, Peter Y. A. Ryan and David Wagner.
Speaker Profile:
Poorvi L. Vora is Associate Professor of Computer Science at The George Washington University (GW). Her current research interests include the areas of secure voting, cryptanalysis and privacy. Before GW, she spent eight years in various positions in Hewlett-Packard Company, in the Laboratories and the product divisions. She has a Phd (1993) and MS (1988) in Electrical Engineering from North Carolina State University, an MS in Mathematics (1990) from Cornell University, and a B. Tech in Electrical Engineering (1986) from IIT-Bombay.
List of Talks


Faculty CSE IT
Forgot Password
    [+] Sitemap     Feedback