The Scantegrity Voting System and Its Use in the Takoma Park Elections
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Engineering Practical End-To-End Verifiable Voting Systems
ABSTRACT Title of Dissertation: Engineering Practical End-to-End Verifiable Voting Systems Richard T. Carback III, Doctor of Philosophy, 2010 Dissertationdirected by: Alan T. Sherman, Associate Professor Department of Computer Science and Electrical Engineering We designed, built, tested, and fielded a vote counting system called Scantegrity. Scan- tegrity is part of a new class of end-to-end (E2E) verifiable voting systems. E2E verifiable systems are designed to solve chain of custody problems in elections by providing a privacy-preserving receipt to each voter. The voter can use the receipt to check a public record and verify that his or her ballot is counted without revealing the selected candidate. The public record gives election officials the ability to provide a strong, universally-accessible audit of the results, enabling transparent, verifiable elections that maintain privacy expectations. E2E systems offer radical improvements to integrity and transparency of election systems, and the adoption of E2E systems in public-sector elections can improve outcome integrity. In our design, we carefully considered the balance between usability and security issues, and we discuss the changes we made to implement the system. We examined the implementation through the results of a practical test of Scantegrity in a mock election in April 2009, which evaluated the system’s performance and surveyed the election participants about their experience with the system. We describe a number of changes we made to the system as a result of this test. For example, Scantegrity required better printing technology and a tally reconciliation system. We evaluated the modified system a second time by fielding it in the Takoma Park, Maryland, November 2009 municipal election, where we were able to survey voters and observe events throughout election day. -
Caltech/Mit Voting Technology Project
CALTECH/MIT VOTING TECHNOLOGY PROJECT A multi-disciplinary, collaborative project of the California Institute of Technology – Pasadena, California 91125 and the Massachusetts Institute of Technology – Cambridge, Massachusetts 02139 ADVANCES IN CRYPTOGRAPHIC VOTING SYSTEMS BEN ADIDA MIT Key words: voting systems, cryptographic, election administration, secret- ballot elections VTP WORKING PAPER #51 September 2006 Advances in Cryptographic Voting Systems by Ben Adida Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY August 2006 c Massachusetts Institute of Technology 2006. All rights reserved. Author . .................................................................. Department of Electrical Engineering and Computer Science August 31st, 2006 Certified by . ............................................................. Ronald L. Rivest Viterbi Professor of Electrical Engineering and Computer Science Thesis Supervisor Accepted by . ............................................................ Arthur C. Smith Chairman, Department Committee on Graduate Students 2 Advances in Cryptographic Voting Systems by Ben Adida Submitted to the Department of Electrical Engineering and Computer Science on August 31st, 2006, in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science Abstract Democracy depends on the proper administration of popular -
Software Independence Revisited
Chapter 1 Software Independence Revisited Ronald L. Rivest Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology (MIT) Cambridge, MA 02139 [email protected] Madars Virza Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology (MIT) Cambridge, MA 02139 [email protected] CONTENTS 1.1 Introduction ....................................................... 4 1.2 Problem: Software complexity of voting systems .................... 4 1.2.1 The difficulty of evaluating complex software for errors ..... 5 1.2.2 The need for software-independent approaches ............. 6 1.3 Definition and rationale for software-independence .................. 6 1.3.1 Refinements and elaborations of software-independence .... 7 1.3.2 Examples of software-independent approaches ............. 8 1.4 How does one test for software-independence? ...................... 9 1.5 Discussion ......................................................... 10 1.5.1 Implications for testing and certification .................... 10 1.5.2 Related issues ............................................. 10 3 4 ⌅ Real-World Electronic Voting: Design, Analysis and Deployment 1.6 Evidence-based elections ........................................... 11 1.7 The use of a public ledger .......................................... 11 1.8 End-to-end verifiable voting systems ............................... 12 1.9 Program verification ............................................... 15 1.10 Verifiable computation and zero-knowledge proofs ................. -
Alan T. Sherman
Alan T. Sherman Office: Dept. of CSEE, UMBC, 1000 Hilltop Circle, Baltimore, MD 21250. Tele: 410-455-2666, fax: 410-455-3969, [email protected], www.csee.umbc.edu/~sherman. Home: 3618 Ordway St., NW, Washington, DC, 20016. Tele: 202-966-7204, fax: 202-362-4838, [email protected]. US citizen (born in Cambridge, MA). Married with two children under fifteen years old. Research Interests. Security of voting systems, information assurance, cryptology, discrete algorithms. Education. PhD, computer science, MIT, 1987 (dissertation advisor: Ronald L. Rivest). SM, electrical engineering and computer science, MIT, 1982. ScB, mathematics, magna cum laude, Brown University, 1978. Experience in Higher Education. Associate Professor of Computer Science (with tenure), University of Maryland, Baltimore County (UMBC), July 1, 95–present. Assistant Professor, UMBC, August 89–June 95. Assistant Professor of Computer Science, Tufts, September 86–August 89. Instructor, Tufts, September 85–August 86. Research Affiliations. Member, National Center for the Study of Elections at UMBC, 06-09. Joint Appointment, University of Maryland Institute for Advanced Computer Studies (UMIACS), University of Maryland College Park, Maryland, August 89–August 95. Research Affiliate (in Theory of Computation Research Group), MIT Laboratory for Computer Science, Massachusetts Institute of Technology, September 85–August 88. Consulting (selected). Expert witness for Fish & Richardson, Maryland State Board of Elections (05, 06-07), and WilmerHale representing RSA (06-07). Performed DARPA- and other government-sponsored research through Cryptographic Technologies Group, NAI Labs, Network Associates, Inc., Rockville, MD, Aug. 97–04 (including my 97– 98 sabbatical year). Security review of products for ID2P, 2factor (05), LuxSAT (02), Infoscape, Corp., Redmond, WA (02), and Phoenix Technologies, San Jose, CA (01). -
Curriculum Vitae Alan Theodore Sherman
Curriculum Vitae July 3, 2016 Alan Theodore Sherman Personal Data Date of birth: February 26, 1957 Place of birth: Cambridge, Massachusetts Citizenship: USA Marital status: married, children born 1996 and 2003 Research Areas Security of voting systems, cryptology, information assurance, discrete algorithms, cybersecurity education. Education Ph.D. Feb. 1987 MIT, computer science S.M. June 1981 MIT, electrical engineering and computer science Sc.B. June 1978 Brown University, mathematics, magna cum laude H.S. Diploma June 1974 Lafayette High School, salutatorian, Williamsburg, Va. Experience in Higher Education July 2014{present. University of Maryland, Baltimore County (UMBC), Baltimore, Maryland. Professor of Computer Science (with tenure), Depart- ment of Computer Science and Electrical Engineering. July 1995{June 2014. University of Maryland, Baltimore County (UMBC), Baltimore, Maryland. Associate Professor of Computer Science (with tenure), Department of Computer Science and Electrical Engineering. August 1989{July 1995. University of Maryland, Baltimore County (UMBC), Bal- timore, Maryland. Assistant Professor of Computer Science, Computer Sci- ence Department. September 1986{August 1989. Tufts University, Medford, Massachusetts. Assis- tant Professor of Computer Science, Department of Computer Science. September 1985{August 1986. Tufts University, Medford, Massachusetts. Instruc- tor of Computer Science, Department of Computer Science. January 1979{January 1982. Massachusetts Institute of Technology (MIT), Cam- bridge, Massachusetts. Teaching Assistant, Department of Electrical Engi- neering and Computer Science. 1 Alan T. Sherman, Curriculum Vitae|July 3, 2016 2 Experience Outside of Higher Education A. Consulting and Contracting August 2015{date. Wood Law, LLP, Kansas City, MO. Serving as cryptologic ex- pert witness for plaintiff in Alexander and Symington vs. BF Labs, a class- action consumer protection case.