Skip to main content
SpringerLink
Log in

Divisible Voting Scheme

  • Conference paper
Information Security (ISC 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2851))

Included in the following conference series:

Abstract

Electronic voting is a prime application of cryptographic tools. Many researches are addressing election or confidence voting in this area. We address a new type of voting scheme “Divisible Voting Scheme,” in which each voter has multiple ballots where the number of ballots can be different among the voters. This type of voting is popular, however there is no secure protocol which achieves this type of voting. We first define the divisible voting scheme and show naive protocols based on existing voting schemes. Then we propose two efficient divisible voting schemes. The first scheme uses multisets, the second scheme uses L-adic representation of number of ballots. The total cost for a voter is O(M 2 log(N)) in the first scheme and O(M log(N)) in the second scheme where M is the number of candidates to vote for and N is the number of ballots for a voter.

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

Access this chapter

Log in via an institution
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. Abe, M.: Universally Verifiable Mix-net with Verification Work Independent of the Number of Mix-servers. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 437–447. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  2. Benaloh, J., Tuinstra, D.: Receipt-Free Secret-Ballot Elections. In: Proc. of STOC 1994, pp. 544–553 (1994)

    Google Scholar 

  3. Benaloh, J., Yung, M.: Distributing the Power of a Government to Enhance the Privacy of Voters. In: Proc. of PODC 1986, pp. 52–62 (1986)

    Google Scholar 

  4. Cramer, R., Damgård, I., Schoenmakers, B.: Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174–187. Springer, Heidelberg (1994)

    Google Scholar 

  5. Cohen, J., Fischer, M.: A Robust and Verifiable Cryptographically Secure Election Scheme. In: Proc of FOCS 1985, pp.372–382 (1985)

    Google Scholar 

  6. Cramer, R., Franklin, M., Schoenmakers, B., Yung, M.: Multi-Authority Secret- Ballot Elections with Linear Work. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 72–82. Springer, Heidelberg (1996)

    Google Scholar 

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

  8. Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. In: Proc. of STOC 1991, pp. 542–552 (1991)

    Google Scholar 

  9. Fujioka, A., Okamoto, T., Ohta, K.: A Practical Secret Voting Scheme for Large Scale Elections. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 244–251. Springer, Heidelberg (1993)

    Google Scholar 

  10. Furukawa, J., Sako, K.: An Efficient Scheme for Proving a Shuffle. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2045, pp. 368–387. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Iversen, K.R.: A Cryptographic Scheme for Computerized General Elections. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 405–419. Springer, Heidelberg (1991)

    Google Scholar 

  12. Jakobsson, M., Juels, A.: Mix and Match: Secure Function Evaluation via Ciphertext. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 162–177. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  13. Michels, M., Horster, O.: Some Remarks on a Receipt-Free and Universally Verifiable Mix-Type Voting Scheme. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol. 1163, pp. 125–132. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  14. McKenzie, P., Sorensen, J.: Anonymous Investing. In: Franklin, M.K. (ed.) FC 1999. LNCS, vol. 1648, pp. 212–229. Springer, Heidelberg (2000)

    Google Scholar 

  15. Okamoto, T.: An Electronic Voting Scheme. In: Proc. of IFIP 1996, Advanced IT Tools (1996)

    Google Scholar 

  16. Ohkubo, M., Miura, F., Abe, M., Fujioka, A., Okamoto, T.: An improvement on a Practical Secret Voting Scheme. In: Zheng, Y., Mambo, M. (eds.) ISW 1999. LNCS, vol. 1729, pp. 234–255. Springer, Heidelberg (1999)

    Google Scholar 

  17. Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)

    Google Scholar 

  18. Park, C., Itoh, K., Kurosawa, K.: Efficient Anonymous Channel and All/Nothing Election Scheme. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 248–259. Springer, Heidelberg (1993)

    Google Scholar 

  19. Sako, K.: Electronic Voting Scheme Allowing Open Objection to the Tally. IEICE Trans. on Fundamentals E77-A(1), 24–30 (1994)

    Google Scholar 

  20. Sako, K., Kilian, J.: Secure Voting Using Partially Compatible Homomorphisms. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 411–424. Springer, Heidelberg (1994)

    Google Scholar 

  21. Sako, K., Kilian, J.: Receipt-Free Mix-Type Voting Scheme. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 393–403. Springer, Heidelberg (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tokyo Institute of Technology, 2-12-1 O-okayama, Meguro-ku, Tokyo, 152-8552, Japan

    Natsuki Ishida & Wakaha Ogata

  2. R&D Headquarters, NTT DATA Corporation, 1-21-2, Shinkawa, Chuo-ku, Tokyo, 104-0033, Japan

    Shin’ichiro Matsuo

Authors
  1. Natsuki Ishida
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shin’ichiro Matsuo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wakaha Ogata
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Information Security Institute, Queensland University of Technology, GPO Box 2434, Qld 4001, Brisbane, Australia

    Colin Boyd

  2. Hewlett-Packard Laboratories, Filton Road, Stoke Gifford, BS34 8QZ, Bristol, UK

    Wenbo Mao

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ishida, N., Matsuo, S., Ogata, W. (2003). Divisible Voting Scheme. In: Boyd, C., Mao, W. (eds) Information Security. ISC 2003. Lecture Notes in Computer Science, vol 2851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10958513_11

Download citation

  • DOI: https://doi.org/10.1007/10958513_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20176-2

  • Online ISBN: 978-3-540-39981-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation