Cryptographic Methods for Storing Ballots on a Voting Machine

Proceedings of the Symposium on Network and Distributed System Security, NDSS 2007

Volumn , Issue , 2007, Pages

  Bethencourt, John ^a   Boneh, Dan ^b   Waters, Brent ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b STANFORD UNIVERSITY   (United States)

^c SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; NETWORK SECURITY;

CRYPTOGRAPHIC METHODS; CRYPTOGRAPHIC PRIMITIVES; CRYPTOGRAPHIC TECHNIQUES; DIRECT RECORDING ELECTRONICS; ELECTRONIC VOTING MACHINES; PROPERTY; SPECIAL HARDWARE; STORAGE SYSTEMS; TAMPER EVIDENCE; VOTER PRIVACIES;

VOTING MACHINES;

EID: 85180542603     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. M. Bellare and S. Miner. A forward-secure digital signature scheme. In Proceedings of Crypto, 1999.
2. D. Boneh, C. Gentry, B. Lynn, and H. Shacham. Aggregate and verifiably encrypted signatures from bilinear maps. In Proceedings of Eurocrypt, 2003.
3. D. Boneh, C. Gentry, B. Lynn, and H. Shacham. A survey of two signature aggregation techniques. CryptoBytes, 6(2), 2003.
4. N. Buchbinder and E. Petrank. Lower and upper bounds on obtaining history independence. In Proceedings of Crypto, 2003.
5. J. Chow, B. Pfaff, T. Garfinkel, K. Christopher, and M. Rosenblum. Understanding data lifetime via whole system simulation. In Proceedings of the USENIX Security Symposium, 2004.
6. J.-S. Coron and D. Naccache. Boneh et al.’s k-element aggregate extraction assumption is equivalent to the Diffie-Hellman assumption. In Proceedings of Asiacrypt, 2003.
7. P. Gutmann. Secure deletion of data from magnetic and solid-state memory. In Proceedings of the USENIX Security Symposium, 1996.
8. J. D. Hartline, E. S. Hong, A. E. Mohr, W. R. Pentney, and E. Rocke. Characterizing history independent data structures. Algorithmica, 42(1):57–74, 2005.
9. G. Itkis and L. Reyzin. Forward-secure signatures with optimal signing and verifying. In Proceedings of Crypto, 2001.
10. A. M. Keller, D. Mertz, J. L. Hall, and A. Urken. Privacy issues in an electronic voting machine. In Proceedings of the ACM Workshop on Privacy in the Electronic Society (WPES), 2004.
11. E. Kiltz, A. Mityagin, S. Panjwani, and B. Raghavan. Append-only signatures. In Proceedings of ICALP, 2005.
12. T. Kohno, A. Stubblefield, A. Rubin, and D. Wallach. Analysis of an electronic voting system. In Proceedings of IEEE Symposium on Security and Privacy, pages 27–40, 2004.
13. B. Lynn. The pairing-based cryptography (PBC) library. http://crypto.stanford.edu/pbc.
14. D. Micciancio. Oblivious data structures: Applications to cryptography. In Proceedings of the ACM Symposium on Theory of Computing (STOC), 1997.
15. D. Molnar, T. Kohno, N. Sastry, and D. Wagner. Tamper-evident, history-independent, subliminal-free data structures on PROM storage -or- how to store ballots on a voting machine. In Proceedings of the IEEE Symposium on Security and Privacy, 2006.
16. M. Naor and V. Teague. Anti-presistence: history independent data structures. In Proceedings of the ACM Symposium on Theory of Computing (STOC), 2001.
17. N. Sastry, T. Kohno, and D. Wagner. Designing voting machines for verification. In Proceedings of the USENIX Security Symposium, 2006.
18. K.-P. Yee, D. Wagner, M. Hearst, and S. M. Bellovin. Prerendered user interfaces for higher-assurance electronic voting. In Proceedings of the USENIX/ACCURATE Electronic Voting Technology Workshop (EVT), 2006.