Skip to main content
SpringerLink
Log in

On the Security of Condorcet Electronic Voting Scheme

  • Conference paper
Book cover Computational Intelligence and Security (CIS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3802))

Included in the following conference series:

Abstract

In this paper, we focus on the Condorcet voting scheme in which each voter votes with the full order of the candidates according to preference, and the result of the election is determined by one-on-one comparisons between each candidate. We propose the Condorcet electronic voting scheme that is secure, universally verifiable and satisfying one-on-one comparison privacy. Furthermore the result of the election can be determined without revealing the order of the candidates which each voter specified. We use a matrix to represent the order of all the candidates according to preference, and satisfy one-on-one comparison privacy using homomorphic property.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Benaloh, J.: Verifiable Secret-Ballot Elections. PhD thesis, Yale University, Department of Computer Science Department, New Haven, CT (September 1987)

    Google Scholar 

  2. 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–83. Springer, Heidelberg (1996)

    Google Scholar 

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

  4. Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM 24(2), 84–88 (1981)

    Article  Google Scholar 

  5. Desmedt, Y.: Threshold cryptography. European Transactions on Telecommunications 5(4), 449–457 (1994)

    Article  MathSciNet  Google Scholar 

  6. Dasgupta, P., Maskin, E.: The Fairest Vote of all. SCIENTIFIC AMERICAN 290, 64–69 (2004)

    Article  Google Scholar 

  7. Duncan, B.: The Theory of Committees and Election. Cambridge University Press, Cambridge (JF1001, B49, ISBN 0-89838-189-4) (1986)

    Google Scholar 

  8. ElGamal, T.: A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, IT 31(4), 469–472 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  9. Fishburn, P.: Condorcet Social Choice Functions. SIAM Journal of Applied Mathematics 33, 469–489 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  10. Furukawa, J., Miyauchi, H., Mori, K., Obana, S., Sako, K.: An Implementation of a Universally Verifiable Electronic Voting Scheme based on Shuffling. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, pp. 16–30. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Fujioka, A., Okamoto, T., Ohta, K.: A Practical secret Voting Scheme for Large Scale Elections. In: AUSCRYPTO 1992, pp. 244–251. Springer, Heidelberg (1992)

    Google Scholar 

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

    Chapter  Google Scholar 

  13. Hirt, M., Sako, K.: Efficient receipt-free voting based on homomorphic encryption. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 539–556. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  14. Iain, M., Fiona, H.: Condorcet:Foundations of Social Choice and Political Theory. Nuffield College. Edward Elgar Publishing Limited (1994)

    Google Scholar 

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

    Chapter  Google Scholar 

  16. Okamoto, T.: Receipt-free electronic voting schemes for large scale elections. In: Christianson, B., Lomas, M. (eds.) Security Protocols 1997. LNCS, vol. 1361, pp. 25–35. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  17. Taylor, A.: Mathematics and politics: strategy, voting, power and proof. Springer, New York (ISBN 0-387-94500-8) (1995)

    MATH  Google Scholar 

  18. Wang, C.J., Leung, H.F.: A Secure and Fully Private Borda Voting Protocol with Universal Verifiability. 28th COMPSAC 1, 224–229 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information and System Engineering, Chuo University, 1-13-27 Kasuga, Bunkyo-ku, Tokyo, Japan

    Yoon Cheol Lee

  2. Institute of Information Security, 2-14-1 Tsuruya-cho Kanagawa-ku, Yokohama, Japan

    Hiroshi Doi

Authors
  1. Yoon Cheol Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hiroshi Doi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microelectronic Instiute, Xidian University, 710071, Xi’an, China

    Yue Hao

  2. Department of Computer Science, Hong Kong Baptist University, Kowloon Tong, Hong Kong

    Jiming Liu

  3. School of Computer Science and Technology, Xidian University, Xi’an, China

    Yu-Ping Wang

  4. Department of Computer Science, Hong Kong Baptist University, Hong Kong,  

    Yiu-ming Cheung

  5. School of Electrical and Electronic Engineering, University of Manchester, UK

    Hujun Yin

  6. Life Science Research Center, School of Electronic Engineering, Xidian University, 710071, Xi’an, Shaanxi, China

    Licheng Jiao

  7. Key Laboratory of Computer Networks and Information Security(Ministry of Education), Xidian University, 710071, Xi’an, China

    Jianfeng Ma

  8. National Laboratory of Antennas and Microwave Technology, Xidian University, 710071, Xi’an, Shanxi, P.R. China

    Yong-Chang Jiao

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, Y.C., Doi, H. (2005). On the Security of Condorcet Electronic Voting Scheme. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596981_5

Download citation

  • DOI: https://doi.org/10.1007/11596981_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30819-5

  • Online ISBN: 978-3-540-31598-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation