Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleSeptember 2014
Election Verifiability for Helios under Weaker Trust Assumptions
AbstractMost electronic voting schemes aim at providing verifiability: voters should trust the result without having to rely on some authorities. Actually, even a prominent voting system like Helios cannot fully achieve verifiability since a dishonest ...
- articleJuly 2010
Secure Electronic Voting: A Framework
We describe a single framework in which to view the end-to-end-independently-verifiable (E2E) polling-place voting systems with a mixnet back-end. We use the framework to invent new systems that combine front and back-ends from existing systems.
- chapterJanuary 2010
Securing optical-scan voting
Towards Trustworthy ElectionsJanuary 2010, Pages 357–369This paper presents a method for adding end-to-end verifiability to any optical-scan vote counting system. A serial number and set of letters, paired with every candidate, are printed on each optical-scan ballot. The letter printed next to the candidate(...
- ArticleAugust 2007
Bare-handed electronic voting with pre-processing
Many electronic voting schemes assume the user votes with some computing device. This raises the question whether a voter can trust the device he is using. Three years ago, Chaum, and independently Neff, proposed what we call bare-handed electronic ...
- ArticleNovember 2001
A verifiable secret shuffle and its application to e-voting
CCS '01: Proceedings of the 8th ACM conference on Computer and Communications SecurityPages 116–125https://doi.org/10.1145/501983.502000We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universally verifiable, multi-authority election schemes. The output of the ...