A framework and taxonomy for comparison of electronic voting schemes

Computers and Security

Volumn 25, Issue 2, 2006, Pages 137-153

  Sampigethaya, Krishna ^a,b,c   Poovendran, Radha ^a,b,c,d  

^a University of Washington   (United States)

^b Department of Electrical Engineering ^*  (United States)

^c UNIVERSITY OF WASHINGTON   (United States)

^d UW Center for Information Assurance and Cyber Security   (United States)

Author keywords

Cryptography; Elections; Electronic voting; Mixnets; Number theory; Protocols; Secret ballot

Indexed keywords

ELECTIONS; ELECTRONIC VOTING; MIXNETS; SECRET BALLOT;

CRYPTOGRAPHY; NETWORK PROTOCOLS; NUMBER THEORY; SECURITY OF DATA;

VOTING MACHINES;

EID: 33644765913     PISSN: 01674048     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cose.2005.11.003     Document Type: Article

References (57)

1. M. Abe Universally verifiable mix-net with verification work independent of the number of mix-servers IEICE Transactions on Fundamentals E83-A 7 July 2000 p. 1431-40
2. A. Acquisti Receipt-free homomorphic elections and write-in ballots Cryptology ePrint Archive, Report 2004/105 2004
3. A. Baraani-Dastjerdi, J. Pieprzyk, and R. Safavi-Naini A practical electronic voting protocol using threshold schemes Proceedings of the 11th annual computer security applications conference 1995 143 148
4. O. Baudron, P.A. Foque, D. Pointcheval, G. Poupard, and J. Stern Practical multi-candidate election system Proceedings of the 20th ACM symposium on principles of distributed computing 2001 ACM Press 274 283
5. Benaloh J. Verifiable secret-ballot elections, Ph.D. thesis, Yale University; 1987.
6. J. Benaloh, and D. Tuinstra Receipt-free secret-ballot elections Proceedings of the 26th ACM Symposium on the Theory of Computing (STOC) 1994 ACM 544 553
7. M. Blum, A. De Santis, S. Micali, and G. Persiano Non-interactive zero-knowledge SIAM Journal of Computing 20 6 1991 1084 1118
8. C. Boyd A new multiple key cipher and an improved voting scheme Advances in cryptology - EUROCRYPT '89 1990 Springer-Verlag 617 625
9. Cal Tech-MIT Voting: what is, what could be Voting Technology Project Report 2001
10. D. Chaum Untraceable electronic mail, return addresses, and digital pseudonyms Communications of the ACM 24 2 1981 84 88
11. D. Chaum Blind signature system Advances in cryptology - CRYPTO '83 1984 Plenum Press 153
12. D. Chaum Elections with unconditionally-secret ballots and disruption equivalent to breaking RSA Advances in cryptology - EUROCRYPT '88 LNCS vol. 330 1988 Springer Verlag 177 182
13. D. Chaum The dining cryptographers problem: unconditional sender and recipient untraceability Journal of Cryptology 1 1 1988 65 75
14. D. Chaum Secret-ballot receipts: true voter-verifiable elections IEEE Security & Privacy Magazine Feb 2004
15. D. Chaum, A. Fiat, and M. Naor Untraceable electronic cash [Extended Abstract] Advances in cryptology - CRYPTO '88 LNCS vol. 403 1990 Springer-Verlag 319 327
16. B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch Verifiable secret sharing and achieving simultaneous broadcast Proceedings of IEEE foundation of computer science 1985 335 344
17. J.D. Cohen (Benaloh), and M.J. Fischer A robust and verifiable cryptographically secure election scheme Proceedings of 26th symposium on foundation of computer science 1985 372 382
18. J.D. Cohen (Benaloh), and M. Yung Distributing the power of a Government to enhance the privacy of voters ACM symposium on principles of distributed computing 1986 52 62
19. R. Cramer, M. Franklin, B. Schoenmakers, and M. Yung Multi-authority secret ballot elections with linear work Advances in cryptology - EUROCRYPT '96 LNCS vol. 1070 1996 Springer Verlag 72 83
20. Ronald Cramer, Rosario Gennaro, and Berry Schoenmakers A secure and optimally efficient multi-authority election scheme Advances in cryptology - EUROCRYPT '97 LNCS vol. 1233 1997 Springer-Verlag 103 118
21. I. Damgård, and M. Jurik A generalisation, a simplification and some applications of Paillier's probabilistic public-key system Proceedings of public key cryptography, fourth international workshop on practice and theory in public key cryptography, PKC 2001, LNCS, vol. 1992 2002 Springer-Verlag 119 136
22. T. ElGamal A public-key cryptosystem and a signature scheme based on discrete logarithms IEEE Transactions on Information Theory 31 4 July 1985 469 472
23. A. Fiat, and A. Shamir How to prove yourself: practical solutions to identification and signature problems Advances in cryptology - CRYPTO '86 LNCS vol. 263 1987 Springer-Verlag 186 194
24. A. Fujioka, T. Okamoto, and K. Ohta A practical secret voting scheme for large scale elections Advances in cryptology - AUSCRYPT '92 LNCS vol. 718 1993 Springer-Verlag 248 259
25. J. Furukawa, and K. Sako An efficient scheme for proving a shuffle Advances in cryptology - CRYPTO '01 LNCS vol. 2139 2001 Springer-Verlag 368 387
26. S. Goldwasser, S. Micali, and C. Rackoff The knowledge complexity of interactive proof systems SIAM Journal on Computing 18 1989 186 208
27. P. Golle, and A. Juels Dining cryptographers revisited Advances in cryptology - EUROCRYPT '04 vol. 3027 2004 Springer-Verlag 456 473
28. P. Golle, S. Zhong, D. Boneh, M. Jakobsson, and A. Juels Optimistic mixing for exit-polls ASIACRYPT '02 LNCS vol. 2501 2002 Springer-Verlag 451 465
29. D. Gritzalis Secure electronic voting Advances in information security vol. 7 2002 Kluwer Academic Publishers
30. D. Gritzalis Principles and requirements for a secure e-voting system Computers & Security 21 6 2002 539 556
31. J. Groth A verifiable secret shuffle of homomorphic encryptions Proceedings of public key cryptography, sixth international workshop on practice and theory in public key cryptosystems, PKC 2003 LNCS vol. 2567 2003 145 160
32. M. Hirt, and K. Sako Efficient receipt-free voting based on homomorphic encryption Advances in cryptology - EUROCRYPT '00 LNCS vol. 1807 2000 Springer-Verlag 539 556
33. K.R. Iverson A cryptographic scheme for computerized general elections Advances in cryptology - CRYPTO '91 LNCS vol. 576 1992 Springer-Verlag 405 419
34. M. Jakobsson A practical mix Advances in cryptology - EUROCRYPT '98 LNCS vol. 1403 1998 Springer-Verlag 449 461
35. M. Jakobsson, K. Sako, and R. Impagliazzo Designated verifier proofs and their applications Advances in cryptology - EUROCRYPT '96 LNCS vol. 1070 1996 Springer-Verlag 143 154
36. M. Jakobsson, A. Juels, and R. Rivest Making mix nets robust for electronic voting by randomized partial checking Proceedings of USENIX security '02 2002 339 353
37. D. Jefferson, A.D. Rubin, B. Simons, and D. Wagner A security analysis of the secure electronic registration and voting experiment (SERVE) Technical Report 2004
38. W. Juang, C. Lei, and H. Liaw A verifiable multi-authority secret election allowing abstention from voting The Computer Journal 45 6 2002 672 682
39. A. Juels, and M. Jakobsson Coercion-resistant electronic elections Cryptology ePrint Archive, Report 2002/165 2002
40. Aggelos Kiayias, and Moti Yung Self-tallying elections and perfect ballot secrecy Proceedings of public key cryptography, fifth international workshop on practice and theory in public key cryptosystems, PKC 2002 LNCS vol. 2274 2002 Springer-Verlag 141 158
41. Aggelos Kiayias, and Moti Yung The vector-ballot e-voting approach Financial cryptography LNCS vol. 3110 2004 Springer-Verlag 72 89
42. Kohno T, Stubblefield A, Rubin AD, Wallach DS. Analysis of an electronic voting system. IEEE symposium on security and privacy; May 9-12, 2004.
43. B. Lee, and K. Kim Receipt-free electronic voting scheme with a tamper-resistant randomizer ICISC '02 LNCS vol. 2587 2002 Springer-Verlag 389 406
44. B. Lee, C. Boyd, E. Dawson, K. Kim, J. Yang, and S. Yoo Providing receipt-freeness in mixnet-based voting protocols Proceedings of the ICISC '03 2003 261 274
45. C.A. Neff A verifiable secret shuffle and its application to e-voting Proceedings of the eighth ACM conference on computer and communications security 2001 ACM Press 116 125
46. W. Ogata, K. Kurosawa, K. Sako, and K. Takatani Fault-tolerant anonymous channel Proceedings of the ICICS '97 LNCS vol. 1334 1997 440 444
47. T. Okamoto Receipt-free electronic voting schemes for large scale elections Proceedings of the workshop on security protocols '97 LNCS vol. 1361 1997 Springer-Verlag 25 35
48. P. Paillier Public-key cryptosystems based on composite degree residue classes Advances in cryptology - EUROCRYPT '99 LNCS vol. 1592 1999 223 238
49. C. Park, K. Itoh, and K. Kurosawa Efficient anonymous channel and all/nothing election scheme Advances in cryptology - EUROCRYPT '93 LNCS vol. 765 1994 Springer Verlag 248 259
50. T. Pedersen A threshold cryptosystem without a trusted party Advances in cryptology - EUROCRYPT '91 LNCS vol. 547 1991 Springer-Verlag 522 526
51. B. Pfitzmann Breaking an efficient anonymous channel Advances in cryptology - EUROCRYPT '94 LNCS vol. 950 1994 Springer-Verlag 332 340
52. R. Rivest, A. Shamir, and L. Adleman A method for obtaining digital signatures and public key cryptosystems Communications of the ACM 21 1978 120 126
53. K. Sako, and J. Killian Secure voting using partially compatible homomorphisms Advances in cryptology - CRYPTO '94 LNCS vol. 839 1994 Springer-Verlag 411 424
54. K. Sako, and J. Killian Receipt-free mix-type voting scheme - a practical solution to the implementation of a voting booth Advances in cryptology - EUROCRYPT '95 LNCS vol. 921 1995 Springer-Verlag 393 403
55. B. Schoenmakers A simple publicly verifiable secret sharing scheme and its applications to electronic voting Advances in cryptology - CRYPTO '99 LNCS vol. 1666 1999 Springer-Verlag 148 164
56. A. Shamir How to share a secret Communications of the ACM 22 11 1979 612 613
57. D.R. Stinson Cryptography: theory and practice 2nd ed. 2002 CRC Press