The vector-ballot e-voting approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3110, Issue , 2004, Pages 72-89

  Kiayias, Aggelos ^a   Yung, Moti ^b  

^a UNIVERSITY OF CONNECTICUT   (United States)

^b Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; HIERARCHICAL SYSTEMS; VECTORS;

BLIND SIGNATURES; DESIGN PARADIGM; E-VOTING PROTOCOLS; FLEXIBLE TECHNOLOGIES; GENERIC DESIGN; HO-MOMORPHIC ENCRYPTIONS; UNIVERSAL VERIFIABILITY; VOTING TECHNOLOGY;

USER INTERFACES;

EID: 35048869794     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27809-2_9     Document Type: Article

References (35)

1. Masayuki Abe and Fumitaka Hoshino, Remarks on Mix-Networks Based on Permutation Networks, PKC 2001.
2. Olivier Baudron, Pierre-Alain Fouque, David Pointcheval, Guillaume Poupard and Jacques Stern, Practical Multi-Candidate Election system, In the Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), 2001.
3. Josh Benaloh, Verifiable Secret-Ballot Elections, PhD Thesis, Yale University, 1987.
4. Josh Benaloh and Moti Yung, Distributing the Power of a Government to Enhance the Privacy of Voters, In the proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), 1986.
5. Josh Benaloh and Dwight Tuinstra, Receipt-Free Secret-Ballot Elections, STOC 1994.
6. Dan Boneh and Philippe Golle, Almost Entirely Correct Mixing With Applications to Voting, 9th ACM-CCS Conference, 2002.
7. David Chaum, Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms, Communications of the ACM 24(2): 84-88, 1981.
8. David Chaum, Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA, Eurocrypt 1988.
9. Josh D. Cohen (Benaloh) and Michael J. Fischer, A Robust and Verifiable Cryptographically Secure Election Scheme, FOCS 1985.
10. Ronald Cramer, Rosario Gennaro and Berry Schoenmakers, A Secure and Optimally Efficient Multi-Authority Election Scheme, Eurocrypt 1997.
11. Ronald Cramer, Ivan Damgård and Berry Schoenmakers, Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols, Crypto 1994.
12. Ronald Cramer, Matthew K. Franklin, Berry Schoenmakers and Moti Yung, Multi-Autority Secret-Ballot Elections with Linear Work, Eurocrypt 1996.
13. Ivan Damgård and Mats Jurik, A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System, PKC 2001, pp. 119-136.
14. Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, Moti Yung, On Monotone Formula Closure of SZK, FOCS 1994.
15. Amos Fiat and Adi Shamir, How to Prove Yourself: Practical Solutions to Identification and Signature Problems, Crypto 1986.
16. Pierre-Alain Fouque, Guillaume Poupard and Jacques Stern, Sharing Decryption in the Context of Voting or Lotteries, Financial Cryptography 2000.
17. Atsushi Fujioka, Tatsuaki Okamoto and Kazuo Ohta: A Practical Secret Voting Scheme for Large Scale Elections, ASIACRYPT 1992.
18. Jun Furukawa and Kazue Sako, An Efficient Scheme for Proving a Shuffle, CRYPTO 2001, pp. 368-387.
19. Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk and Tal Rabin, Secure Distributed Key Generation for Discrete-Log Based Cryptosystems Eurocrypt 1999.
20. P. Golle, S. Zhong, D. Boneh, M. Jakobsson and A. Juels, Optimistic Mixing for Exit-Polls, Asiacrypt 2002.
21. Dimitris Gritzalis (Ed.), Secure Electronic Voting, Advances in Information Security, Volume 7, Kluwer 2002.
22. Martin Hirt and Kazue Sako, Efficient Receipt-Free Voting Based on Homomorphic Encryption, Eurocrypt 2000.
23. Martin Hirt, Multi-Party Computation: Efficient Protocols, General Adversaries, and Voting, Ph.D. Thesis, ETH Zurich, 2001.
24. Markus Jakobsson, Ari Juels and Ronald L. Rivest Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking, USENIX Security Symposium 2002, pp. 339-353.
25. Byoungcheon Lee and Kwangjo Kim, Receipt-Free Electronic Voting Scheme with Tamper-Resistant Randomizer. ICISC 2001.
26. C. Andrew Neff, A verifiable secret shuffle and its application to e-voting, ACM Conference on Computer and Communications Security 2001, pp. 116-125.
27. Tatsuaki Okamoto, Receipt-Free Electronic Voting Schemes for Large Scale Elections, Workshop on Security Protocols, 1997.
28. Pascal Paillier, Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, Eurocrypt 1999.
29. Choonsik Park, Kazutomo Itoh and Kaoru Kurosawa, Efficient Anonymous Channel and All/Nothing Election Scheme, Eurocrypt 1993.
30. Torben P. Pedersen, A threshold Cryptosystem without a Trusted Third Party, Eurocrypt 1991.
31. Torben P. Pedersen, Distributed Provers and Verifiable Secret Sharing Based on the Discrete Logarithm Problem, PhD Thesis, Aarhus University 1992.
32. Michael Rabin, Transactions protected by beacons, Journal of Computer and System Sciences, Vol. 27, pp 256-267, 1983.
33. Kazue Sako and Joe Kilian, Secure Voting Using Partially Compatible Homomorphisms, Crypto 1994.
34. Kazue Sako and Joe Kilian, Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth, Eurocrypt 1995.
35. Berry Schoenmakers, A Simple Publicly Verifiable Secret Sharing Scheme and its Applications to Electronic Voting, Crypto 1999.