Skip to main content

Pretty Good Democracy

  • Conference paper
Security Protocols XVII (Security Protocols 2009)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 7028))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adida, B.: Advances in Cryptographic Voting Systems. PhD thesis. MIT Cambridge (July 2006)

    Google Scholar 

  2. Adida, B.: Helios: Web-based Open-Audit Voting (2008)

    Google Scholar 

  3. 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. Benaloh, J.: Simple verifiable elections. In: Proc. 1st USENIX Accurate Electronic Voting Technology Workshop (2006)

    Google Scholar 

  5. 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. 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. 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. 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. 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. Chaum, D.: SureVote: Technical Overview. In: Proceedings of the Workshop on Trustworthy Elections, WOTE 2001 (2001)

    Google Scholar 

  11. 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. 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)

    Chapter  Google Scholar 

  13. 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. Helbach, J., Schwenk, J., Schräge, S.: Code Voting with Linkable Group Signatures. In: Proceedings of Electronic Voting 2008 (2008)

    Google Scholar 

  15. 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. Jakobsson, M., Juels, A.: Mix and Match: Secure Function Evaluation via Ciphertexts (2000)

    Google Scholar 

  17. 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. Krivoruchko, T.: Robust coercion-resistant registration for remote e-voting. In: Proc. IAVoSS Workshop on Trustworthy Elections, WOTE (2007)

    Google Scholar 

  19. 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. 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. Peters, R.A.: A Secure Bulletin Booard. Master’s thesis, Technische Universiteit Eindhoven (2005)

    Google Scholar 

  22. 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)

    Chapter  Google Scholar 

  23. 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. 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. Ryan, P.Y.A.: The computer ate my vote. Technical Report CS-TR-988, University of Newcastle upon Tyne (2007)

    Google Scholar 

  26. Ryan, P.Y.A.: Prêt à Voter with Paillier encryption. Mathematical and Computer Modelling 48(9-10), 1646–1662 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  27. 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. Volkamer, M., Grimm, R.: Multiple Casts in Online Voting: Analyzing Chances. In: Proceedings of Electronic Voting 2006 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ryan, P.Y.A., Teague, V. (2013). Pretty Good Democracy. In: Christianson, B., Malcolm, J.A., Matyáš, V., Roe, M. (eds) Security Protocols XVII. Security Protocols 2009. Lecture Notes in Computer Science, vol 7028. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36213-2_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36213-2_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36212-5

  • Online ISBN: 978-3-642-36213-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics