Prerendered user interfaces for higher-assurance electronic voting
EVT'06 Proceedings of the USENIX/Accurate Electronic Voting Technology Workshop 2006 on Electronic Voting Technology Workshop
Transparency and access to source code in electronic voting
EVT'06 Proceedings of the USENIX/Accurate Electronic Voting Technology Workshop 2006 on Electronic Voting Technology Workshop
Refinement: A Constructive Approach to Formal Software Design for a Secure e-voting Interface
Electronic Notes in Theoretical Computer Science (ENTCS)
Casting votes in the auditorium
EVT'07 Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology
Towards tamper-evident storage on patterned media
FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
Are your votes really counted?: testing the security of real-world electronic voting systems
ISSTA '08 Proceedings of the 2008 international symposium on Software testing and analysis
History-Independent Cuckoo Hashing
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Replayable voting machine audit logs
EVT'08 Proceedings of the conference on Electronic voting technology
E-voting and forensics: prying open the black box
EVT/WOTE'09 Proceedings of the 2009 conference on Electronic voting technology/workshop on trustworthy elections
Integrity of electronic voting systems: fallacious use of cryptography
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Deterministic history-independent strategies for storing information on write-once memories
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
HIFS: history independence for file systems
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
| Hi-index | 0.00 |
We enumerate requirements and give constructions for the vote storage unit of an electronic voting machine. In this application, the record of votes must survive even an unexpected failure of the machine; hence the data structure should be durable. At the same time, the order in which votes are cast must be hidden to protect the privacy of voters, so the data structure should be history-independent. Adversaries may try to surreptitiously add or delete votes from the storage unit after the election has concluded, so the storage should be tamper-evident. Finally, we must guard against an adversarial voting machine's attempts to mark ballots through the representation of the data structure, so we desire a subliminal-free representation. We leverage the properties of Programmable Read Only Memory (PROM), a special kind of write-once storage medium, to meet these requirements. We give constructions for data structures on PROM storage that simultaneously satisfy all our desired properties. Our techniques can significantly reduce the need to verify code running on a voting machine.