Receipt-free electronic voting schemes for large scale elections

  • Tatsuaki Okamoto
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1361)


This paper proposes practical receipt-free voting schemes which are suitable for (nation wide) large scale elections. One of the proposed scheme requires the help of the voting commission, and needs a physical assumption, the existence of an untappable channel. The other scheme does not require the help of the commission, but needs a stronger physical assumption, the existence of a voting booth. We define receipt-freeness, and prove that the proposed schemes satisfy receipt-freeness under such physical assumptions.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. BGW88.
    M. Ben-Or, S. Goldwasser, and A. Wigderson, “Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation”, Proc. of STOC'88, pp.1–10 (1988).Google Scholar
  2. BT94.
    J. Benaloh and D. Tuinstra, “Receipt-Free Secret-Ballot Elections”, Proc. of STOC'94, pp.544–553 (1994).Google Scholar
  3. BY86.
    J. Benaloh and M. Yung, “Distributing the Power of a Government to Enhance the Privacy of Votes”, Proc. of PODC'86, pp.52–62 (1986).Google Scholar
  4. Cha81.
    D. Chaum, “Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms”, Communications of the ACM, Vol. 24, No. 2, pp. 84–88 (1981).CrossRefGoogle Scholar
  5. Cha85.
    D. Chaum, “Security without Identification: Transaction systems to Make Big Brother Obsolete”, Communications of the ACM, Vol.28, No.10, pp.1030–1044 (1985).CrossRefGoogle Scholar
  6. Cha88.
    D. Chaum, “Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA”, Proceedings of Eurocrypt'88, LNCS 330, Springer-Verlag, pp.177–182 (1988).Google Scholar
  7. CCD88.
    D. Chaum, C. Crépeau, and 1. Damgård, “Multiparty Unconditionally Secure Protocols”, Proc. of STOC'88, pp.11–19 (1988).Google Scholar
  8. CF85.
    J. Cohen and M. Fisher, “A Robust and Verifiable Cryptographically Secure Election Scheme”, Proc. of FOCS, pp.372–382 (1985).Google Scholar
  9. CFSY96.
    R. Cramer, M. Franklin, B. Schoenmakers, and M. Yung, “Multi-Authority Secret-Ballot Elections with Linear Work”, Proc. of Eurocrypt'96, LNCS 1070, Springer-Verlag, pp.72–82 (1996).Google Scholar
  10. Fe187.
    P. Feldman, “A Practical Scheme for Non-interactive Verifiable Secret Sharing”, Proc. of FOCS, pp. 427–437 (1987).Google Scholar
  11. FFS88.
    Feige, U., Fiat, A. and Shamir, A.: Zero-Knowledge Proofs of Identity, Journal of CRYPTOLOGY, Vol. 1, Number 2 pp.77–94 (1988)Google Scholar
  12. FOO92.
    A. Fujioka, T. Okamoto, and K. Ohta, “A Practical Secret Voting Scheme for Large Scale Elections”, Proc. of Auscrypt '92, LNCS, Springer-Verlag, pp. 244–251 (1992).Google Scholar
  13. GMW87.
    O. Goldreich, S. Micali, and A. Wigderson, “How to Play Any Mental Game, or a Completeness Theorem for Protocols with Honest Majority”, Proc. of STOC, pp.218–229 (1987).Google Scholar
  14. Ive92.
    K. R. Iversen, “A Cryptographic Scheme for Computerized General Elections”, Proc. of Crypto'91, LNCS 576, Springer-Verlag, pp.405–419 (1992).Google Scholar
  15. JSI96.
    M. Jakobsson, K. Sako, and R. Impagliazzo, “Designated Verifier Proofs and Their Applications”, Proc. of Eurocrypt '96, LNCS 1070, Springer-Verlag, pp.143–154 (1996).Google Scholar
  16. Mic97.
    M. Michels, “Comments on a receipt-free voting scheme”, manuscript (Jan. 1997).Google Scholar
  17. Oka96.
    T. Okamoto, “An Electronic Voting Scheme”, Proc. of IFIP'96, Advanced IT Tools, Chapman & Hall, pp.21–30 (1996).Google Scholar
  18. TW87.
    Tompa, M. and Woll, H.: Random SelfReducibility and Zero Knowledge Interactive Proofs of Possession of Information, Proc. of FOCS'87, pp.472–482 (1987).Google Scholar
  19. Ped91a.
    Pedersen, T. P., “Distributed Provers with Applications to Undeniable Signatures”, Proceedings of Eurocrypt 91 (1992).Google Scholar
  20. Ped91b.
    Pedersen, T. P., “Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing”, Proceedings of Crypto 91, pp. 129–140 (1992).Google Scholar
  21. Sch91.
    Schnorr, C.P., “Efficient Signature Generation by Smart Cards”, Journal of Cryptology, Vol. 4, No. 3, pp.161–174 (1991).CrossRefGoogle Scholar
  22. SK94.
    K. Sako, and J. Kilian, “Secure Voting Using Partially Compatible Homomorphisms”, Proc. of Crypto'94, LNCS 839, Springer-Verlag, pp.411–424 (1994)Google Scholar
  23. SK95.
    K. Salvo, and J. Kilian, “Receipt-Free Mix-type Voting Scheme”, Proc. of Eurocrypt'95, LNCS 921, Springer-Verlag, pp393–403 (1995)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Tatsuaki Okamoto
    • 1
  1. 1.NTT LaboratoriesNippon Telegraph and Telephone CorporationKanagawa-kenJapan

Personalised recommendations