Advertisement

Pretty Good Democracy

  • Peter Y. A. Ryan
  • Vanessa Teague
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7028)

Abstract

Code voting seeks to address the issues of privacy and integrity for Remote Internet Voting. It sidesteps many of the inherent vulnerabilities of the Internet and client platforms but it does not provide end-to-end verification that votes are counted as cast. In this paper, we propose a simple technique to enhance the verifiability of code voting by ensuring that the Vote Server can only access the acknowledgement codes if the vote code is correctly registered by a threshold set of Trustees. The mechanism proposed here therefore adds an extra level of verifiability in registering and counting the vote. Voter-verification is simple and direct: the voters need only check that the acknowledgement code returned to them agrees with the value on their code sheet. To ensure receipt-freeness we propose the use of a single acknowledgement code per code sheet, rather than individual acknowledgement codes for each candidate with usual code voting.

Keywords

Serial Number Vote System Cyclic Shift Electronic Vote Alternative Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Adi06]
    Adida, B.: Advances in Cryptographic Voting Systems. PhD thesis. MIT Cambridge (July 2006)Google Scholar
  2. [Adi08]
    Adida, B.: Helios: Web-based Open-Audit Voting (2008)Google Scholar
  3. [AdMPQ09]
    Adida, B., de Marneffe, O., Pereira, O., Quisquater, J.J.: Electing a university president using open audit voting: Analysis of real world use of Helios. In: EVT 2009: Proceedings of the Electronic Voting Technology Workshop (2009)Google Scholar
  4. [Ben06]
    Benaloh, J.: Simple verifiable elections. In: Proc. 1st USENIX Accurate Electronic Voting Technology Workshop (2006)Google Scholar
  5. [BLRS06]
    Bryans, J.W., Littlewood, B., Ryan, P.Y.A., Strigini, L.: E-voting: Dependability Requirements and Design for Dependability. In: Proceedings of the First International Conference on Availability, Reliability and Security, ARES 2006 (2006)Google Scholar
  6. [CCC+08]
    Chaum, D., Carback, R., Clark, J., Essex, A., Popoveniuc, S., Rivest, R.L., Ryan, P.Y.A., Shen, E., Sherman, A.T.: Scantegrity II: end-to-end verifiability for optical scan election systems using invisible ink confirmation codes. In: EVT 2008: Proceedings of the Electronic Voting Technology Workshop, pp. 1–13. USENIX Association, Berkeley (2008)Google Scholar
  7. [CCM07]
    Clarkson, M., Chong, S., Myers, A.C.: Civitas: A secure remote voting system. Technical report, Cornell University Computing and Information Science Technology Report (May 2007)Google Scholar
  8. [CGJ+99]
    Canetti, R., Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Adaptive Security for Threshold Cryptosystems. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 98–116. Springer, Heidelberg (1999)Google Scholar
  9. [CGS97]
    Cramer, R., Gennaro, R., Schoenmakers, B.: A Secure and Optimally Efficient Multi-authority Election Scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 103–118. Springer, Heidelberg (1997)Google Scholar
  10. [Cha01]
    Chaum, D.: SureVote: Technical Overview. In: Proceedings of the Workshop on Trustworthy Elections, WOTE 2001 (2001)Google Scholar
  11. [CP93]
    Chaum, D., Pedersen, T.P.: Wallet Databases with Observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89–105. Springer, Heidelberg (1993)Google Scholar
  12. [CRS05]
    Chaum, D., Ryan, P.Y.A., Schneider, S.: A Practical Voter-Verifiable Election Scheme. In: De Capitani di Vimercati, S., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 118–139. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  13. [ECHA09]
    Essex, A., Clark, J., Hengartner, U., Adams, C.: How to print a secret. In: Proc. 4th USENIX Workshop on Hot Topics in Security, HotSec 2009 (2009)Google Scholar
  14. [HSS08]
    Helbach, J., Schwenk, J., Schräge, S.: Code Voting with Linkable Group Signatures. In: Proceedings of Electronic Voting 2008 (2008)Google Scholar
  15. [JCJ05]
    Juels, A., Catalano, D., Jakobsson, M.: Coercion-resistant Electronic Elections. In: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society, pp. 61–70 (November 2005)Google Scholar
  16. [JJ00]
    Jakobsson, M., Juels, A.: Mix and Match: Secure Function Evaluation via Ciphertexts (2000)Google Scholar
  17. [JJR02]
    Jakobsson, M., Juels, A., Rivest, R.: Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking. In: USENIX Security Symposium, pp. 339–353 (2002)Google Scholar
  18. [Kri07]
    Krivoruchko, T.: Robust coercion-resistant registration for remote e-voting. In: Proc. IAVoSS Workshop on Trustworthy Elections, WOTE (2007)Google Scholar
  19. [Nef01]
    Neff, A.: A verifiable secret shuffle and its application to e-voting. In: Conference on Computer and Communications Security, pp. 116–125. ACM (2001)Google Scholar
  20. [OSH08]
    Oppliger, R., Schwenk, J., Helbach, J.: Protecting Code Voting Against Vote Selling. Lecture Notes in Informatics - Sicherheit, Schutz und Zuverlässigkeit (Sicherheit 2008) (2008)Google Scholar
  21. [Pet05]
    Peters, R.A.: A Secure Bulletin Booard. Master’s thesis, Technische Universiteit Eindhoven (2005)Google Scholar
  22. [RS06a]
    Ryan, P.Y.A., Schneider, S.A.: Prêt à Voter with Re-encryption Mixes. In: Gollmann, D., Meier, J., Sabelfeld, A. (eds.) ESORICS 2006. LNCS, vol. 4189, pp. 313–326. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  23. [RS06b]
    Ryan, P.Y.A., Schneider, S.A.: Prêt à voter with re-encryption mixes. Technical Report CS-TR-956, University of Newcastle upon Tyne (2006)Google Scholar
  24. [RT09]
    Ryan, P.Y.A., Teague, V.: Ballot permutations in Prêt à Voter. In: USENIX/ACCURATE Workshop on Trustworthy Elections (2009), www.usenix.org/event/evtwote09/tech/full_papers/ryan.pdf
  25. [Rya07]
    Ryan, P.Y.A.: The computer ate my vote. Technical Report CS-TR-988, University of Newcastle upon Tyne (2007)Google Scholar
  26. [Rya08]
    Ryan, P.Y.A.: Prêt à Voter with Paillier encryption. Mathematical and Computer Modelling 48(9-10), 1646–1662 (2008)MathSciNetzbMATHCrossRefGoogle Scholar
  27. [TH08]
    Ting, P.-Y., Huang, X.-W.: Distributed Paillier plaintext equivalence test. International Journal of Network Security 6(3), 258–264 (2008), http://ijns.femto.com.tw/contents/ijns-v6-n3/ijns-v6-n3.html Google Scholar
  28. [VG06]
    Volkamer, M., Grimm, R.: Multiple Casts in Online Voting: Analyzing Chances. In: Proceedings of Electronic Voting 2006 (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Peter Y. A. Ryan
    • 1
  • Vanessa Teague
    • 2
  1. 1.Dept. Computer Science and CommunicationsUniversity of LuxembourgLuxembourg
  2. 2.Dept. Computer Science and Software EngineeringUniversity of MelbourneAustralia

Personalised recommendations