Verifiable Internet Voting Solving Secure Platform Problem

  • Mirosław Kutyłowski
  • Filip Zagórski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4752)


We present a voter verifiable Internet voting scheme which provides anonymity and eliminates the danger of vote selling even if the computer used by the voter cannot be fully trusted. The ballots cast remain anonymous - even the machine does not know the choice of the voter. It makes no sense to buy votes - the voter can cheat the buyer even if his machine cooperates with the buyer. Nevertheless, the voter can verity that his vote has been counted.


electronic voting vote selling coercion resistance anonymity 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chaum, D.: Secret-Ballot Receipts and Transparent Integrity. Better and less-costly Electronic Voting and Polling Places. In: IEEE S&P 2004Google Scholar
  2. 2.
    Chaum, D.: Punch Scan. In: Workshop on Frontiers in Electronic Elections (2005),
  3. 3.
    Chaum, D.: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. CACM 24(2), 84–88 (1981)Google Scholar
  4. 4.
    Chaum, D., Ryan, P.Y.A., Schneider, S.: A Practical Voter-Verifiable Election Scheme. In: di Vimercati, S.d.C., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 118–139. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  5. 5.
    Furukawa, J., Sako, K.: An Efficient Scheme for Proving a Shuffle. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 368–387. Springer, Heidelberg (2001)Google Scholar
  6. 6.
    Golle, P.: Reputable Mix Networks. In: Martin, D., Serjantov, A. (eds.) PET 2004. LNCS, vol. 3424, pp. 51–62. Springer, Heidelberg (2005)Google Scholar
  7. 7.
    Golle, P., Jakobsson, M., Juels, A., Syverson, P.: Universal Re-encryption for Mixnets. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol. 2964, pp. 163–178. Springer, Heidelberg (2004)Google Scholar
  8. 8.
    Juels, A., Catalano, D., Jakobsson, M.: Coercion-Resistant Electronic Elections. In: WPES 2005, pp. 61–70 (2005)Google Scholar
  9. 9.
    Hirth, M.: Receipt-Free K-out-of-L Voting based on ElGamal Encryption. In: Workshop on Frontiers in Electronic Elections (2005)Google Scholar
  10. 10.
    Jakobsson, M., Juels, A., Rivest, R.L.: Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking. In: USENIX Security Symposium 2002, pp.339–353 (2002)Google Scholar
  11. 11.
    Klonowski, M., Kutyłowski, M., Lauks, A., Zagórski, F.: Universal Re-encryption of Signatures and Controlling Anonymous Information Flow. In: Wartacrypt (2004)Google Scholar
  12. 12.
    Klonowski, M., Kutyłowski, M., Lauks, A., Zagórski, F.: A Practical Voting Scheme with Receipts. In: Zhou, J., Lopez, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol. 3650, pp. 380–393. Springer, Heidelberg (2005)Google Scholar
  13. 13.
    Lee, B., Kim, K.: Receipt-Free Electronic Voting Scheme with a Tamper-Resistant Randomizer. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol. 2587, pp. 389–406. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  14. 14.
    Moran, T., Naor, M.: Receipt-Free Universally-Verifiable Voting with Everlasting Privacy. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 373–392. Springer, Heidelberg (2006)Google Scholar
  15. 15.
    Neff, C.A.: A Verifiable Secret Shuffle and its Application to E-Voting. In: ACM Conference on Computer and Communications Security, pp. 116–125 (2001)Google Scholar
  16. 16.
  17. 17.
    Smith, W.D.: Cryptography Meets Voting,

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Mirosław Kutyłowski
    • 1
  • Filip Zagórski
    • 1
  1. 1.Institute of Mathematics and Computer Science, Wrocław University of Technology 

Personalised recommendations