An internet voting protocol with receipt-free and coercion-resistant

CIT 2007: 7th IEEE International Conference on Computer and Information Technology

Volumn , Issue , 2007, Pages 721-726

  Bo, Meng ^a  

^a SOUTH CENTRAL UNIVERSITY FOR NATIONALITIES   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; INTERNET; KNOWLEDGE ACQUISITION;

CIPHERTEXTS; COERCION-RESISTANT; INTERNET VOTING PROTOCOL; VERIFIER PROOF;

NETWORK PROTOCOLS;

EID: 38049013737     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIT.2007.4385170     Document Type: Conference Paper

References (39)

1. R. A. DeMillo, N. A. Lynch, M. Merritt, Cryptographic Protocols, In the proceeding of of 14th Annual ACM Symposium on Theory of Computing, 1982:383-400.
2. Josh Benaloh, Dwight Tuinstra. Receipt-free secret-ballot elections. In the proceeding of STOC '94, 1994:544-553.
3. Ronald Cramer, Matthew Franklin, Berry Schoenmakers, Moti Yung. Multi-authority secret ballot elections with linear work. In the proceeding of EUROCRYPT '96, Springer-Verlag, LNCS1070, 1996:72-83.
4. Ronald Cramer, Rosario Gennaro, Berry Schoenmakers. A secure and optimally efficient multi-authority election scheme. In the proceeding of EUROCRYPT '97, Springer-Verlag, LNCS 1233, 1997:103-118.
5. Olivier Baudron, Pierre-Alain Fouque, David Pointcheval, Guillaume Poupard, Jacques Stern. Practical multi-candidate election system. In the proceeding of PODC '01, ACM, 2001:274-283.
6. Ivan Damg°ard, Mads Jurik. A generalisation, a simplification and some applications of paillier'sprobabilistic public-key system. In the proceeding of Public Key Cryptography '01, Springer-Verlag, LNCS 1992, 2001: 119-136.
7. Ivan Damg°ard, Mads Jurik, Jesper Buus Nielsen. A generalization of paillier's public-key system with applications to electronic voting, 2003. http://citeseer.ist.psu.edu/cache/papers/cs/27234/http:zSzzSz www.daimi.au.dkzSz~ivanzSzGenPaillier_finaljour.pdf/dam gard03generalization.pdf
8. Martin Hirt and Kazue Sako. Efficient receipt-free voting based on homomorphic encryption. In the proceeding of EUROCRYPT '00, Springer-Verlag, LNCS 1807, 2000: 539-556.
9. Byoungcheon Lee, Kwangjo Kim. Receipt-free electronic voting scheme with a tamperresistant randomizer. In the proceeding of ICISC2002, 2002:405-422.
10. Alessandro Acquisti. Receipt-Free Homomorphic Elections and Write-in Voter Verified Ballots, Technical Report 2004/105, International Association for Cryptologie Research, May 2, 2004, and Carnegie Mellon Institute for Software Research International, CMU-ISRI-04-116, 2004. http://www.heinz.cmu.edu/ ~acquisti/papers/acquisti-electronic_voting.pdf
11. Jonathan Goulet,Jeffrey Zitelli. Surveying and Improving Electronic Voting Schemes.http://www.seas.upenn.edu/~cse400/CSE400_2004_2005/ senior_design_projects_04_05.htm
12. Ari Juels, Markus Jakobsson. Coercion-resistant electronic elections, 2002. http://www.vote-auction.net/VOTEAUCTION/165.pdf
13. Martin Hirt. Multi-party computation: Efficient protocols, general adversaries, and voting. PhD Thesis, ETH Zurich, 2001.
14. Ari Juels, Dario Catalano, Markus Jakobsson: Coercionresistant electronic elections. One older version was at Cryptology ePrint Archive: Report 2002/165 http://eprint.iacr.org/; latest version on Juels web page: http://www. rsasecurity.com/rsalabs/node.asp?id=2030 as of June 2005.
15. Josh C. Benaloh. Verifiable secret-ballot elections. PhD Thesis, Yale University, Department of Computer Science, 1987. Number 561.
16. Kazue Sako and Joe Kilian. Secure voting using partial compatible homomorphisms. In the proceedings of CRYPTO'94, Springer-Verlag, LNCS 839, 1994:248-259.
17. David Chaum. Secret-ballot receipts and transparent integrity. Draft, 2002. www.vreceipt.com/article.pdf.
18. Tatsuaki Okamoto. Receipt-free electronic voting schemes for large scale elections. In the proceeding of Security Protocols Workshop, Springer-Verlag, LNCS 1361, 1997:25-35.
19. David Chaum. Elections with unconditionally- secret ballots and disruption equivalent to breaking rsa. In the proceeding of EUROCRYPT '98, Springer-Verlag, LNCS 330, 1988:177-182.
20. Atshushi Fujioka, Tatsuaki Okamoto, and Kazuo Ohta. a practical secret voting scheme for large scale elections. In the proceeding of Auscrypt '92, Springer-Verlag, LNCS 718, 1992.244-251.
21. Michael J. Radwin, An untraceable, universally verifiable voting scheme, http://www.radwin.org/michael/projects/voting.html
22. Wen-Sheng Juang, Chin-Laung Lei, Pei-Ling Yu. A verifiable multi-authorities secret elections allowning abstaining from voting. International Computer Symposium, Tainan, Taiwan, 1998.
23. Patrick Horster, Markus Michels, Holger Petersen. Blind multisignature schemes and their relevance to electronic voting. In the proceeding of 11th Annual Computer Security Applications Conference. IEEE Press, 1995:149-156.
24. Lorrie Cranor and Ron Cytron. Sensus: A security-conscious electronic polling system for the Internet. In the proceedings of the Hawaii International Conference on System Sciences, 1997.
25. Miyako Ohkubo, Fumiaki Miura, Masayuki Abe, Atsushi Fujioka, and Tatsuaki Okamoto. An improvement on a practical secret voting scheme. In the proceedings of ISW '99,1999:225-234.
26. Kazue Sako, Joe Kilian. Receipt-free mix-type voting scheme. In the proceeding of EUROCRYPT '95, Springer-Verlag, LNCS 921, 1995:393-403.
27. Choonsik Park, Kazutomo Itoh, Kaoru Kurosawa. Efficient anonymous channel and all/nothing election scheme. In the proceeding of Advances Cryptology -EUROCRYPT'93, Springer-Verlag, 1993:248-259.
28. Markus Jakobsson, Ari Juels, and Ronald L. Rivest. Making mix nets robust for electronic voting by randomized partial checking. In the proceeding of USENIX '02, 2002: 339-353.
29. Emmanouil Magkos, Mike Burmester, and Vassilios Chrissikopoulos. Receipt-freeness in large-scale elections without untappable channels. In the proceeding of I3E, 2001: 683-694.
30. Birgit Pfitzmann. Breaking an efficient anonymous channel. In the proceedings of EUROCRYPT '94. Springer-Verlag, LNCS 950, 1995:332-340.
31. Markus Michels, Patrick Horster. Some remarks on a receipt-free and universally verifiable mix-type voting scheme. In the proceedings of ASIACRYPT '94, Springer-Verlag, LNCS 1163, 1996:125-132.
32. Masayuki Abe. Universally verifiable mix-net with verification work independent of the number of mix-servers. In the proceedings of EUROCRYPT '98, Springer-Verlag, LNCS 1403, 1998:437-447.
33. Andrew Neff. Detecting malicious poll site voting clients, 2003. http://votehere.com/vhti/documentation/psclients.pdf.
34. Aggelos Kiayias, Moti Yung. The vector-ballot e-voting approach. http://theory.lcs.mit.edu/~rivest/voting/papers/KiayiasYung- TheVectorBallotEVotingApproach.pdf
35. Byoungcheon Lee, Kwangjo Kim. Receipt-free electronic voting through collaboration of voter and honest verifier, 2000. hhtp://citeseer.nj.nec.com/ lee00receiptfree.html.
36. David Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2), 1981:84-88.
37. Markus Jakobsson, Kazue Sako, Russell Impagliazzo. Designated verifier proofs and their applications. In the proceeding of EUROCRYPT '96, Springer-Verlag, LNCS 1070, 1996:143-154.
38. Zuzana Rjaskov'a, Electronic Voting Schemes, master thesies. Department of Computer Science Faculty of Mathematics, Physics and Informatics Comenius University, Bratislava, April 2002.
39. G.R. Blakley. Safeguarding cryptographic keys. In the proceedings of AFIPS Conference, 48, 1979: 313-317.