Advertisement

Annals of Operations Research

, Volume 51, Issue 4, pp 185–194 | Cite as

Conducting secret ballot elections in computer networks: Problems and solutions

  • Hannu Nurmi
  • Arto Salomaa
Section IV Group Decision Making Through Voting

Abstract

We discuss problems related to devising a secret balloting system with the following properties: (1) all eligible voters and they only may vote, (2) all ballots are secret, i.e. do not reveal the identity of the voter, (3) all voters may check whether their ballots have been correctly assigned, (4) the voters may revise their ballots within a predetermined time, and (5) errors in ballot assignment can be corrected within a predetermined time.

Keywords

Cryptographic protocols secret ballot public-key cryptosystems voting 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J.D.C. Benaloh, Verifiable secret-ballot elections, Technical Report 561, Computer Science Department, Yale University (1987).Google Scholar
  2. [2]
    D. Chaum, Election with unconditionally-secret ballots and disruption equivalent to breaking RSA, in:Lecture Notes in Computer Science, Vol. 330, ed. C.G. Gunther (Springer, Berlin/Heidelber/New York, 1988) pp. 177–182.Google Scholar
  3. [3]
    W. Diffie and M. Hellman, New directions in cryptography, IEEE Trans. Inf. Theory IT-22(1976)644–654.Google Scholar
  4. [4]
    K.R. Iversen, A cryptographic scheme for computerized general elections (extended abstract),Crypto '91, Session 9: Secure Computation Protocols.Google Scholar
  5. [5]
    H. Nurmi and A. Salomaa, A cryptographic approach to the secret ballot, Behavioral Sci. 36(1991)34–40.Google Scholar
  6. [6]
    H. Nurmi and A. Salomaa, Secret ballot elections and public-key cryptosystems, Eur. J. Political Econ. 8(1992)295–303.Google Scholar
  7. [7]
    H. Nurmi and A. Salomaa, Cancellation and reassignment of votes in secret ballot elections, Eur. J. Political Econ. 9(1993)427–435.Google Scholar
  8. [8]
    H. Nurmi, A. Salomaa and L. Santean, Secret ballot elections in computer networks, Comp. Security 10(1991)553–560.Google Scholar
  9. [9]
    A. Renvall, ANDOS: A simple protocol for secret selling of secrets, EATCS Bull. 47(1992)200–205.Google Scholar
  10. [10]
    R. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, ACM Commun. 21(1978)120–126.Google Scholar
  11. [11]
    A. Salomaa,Public-Key Cryptography (Springer, Berlin/Heidelberg/New York, 1990).Google Scholar
  12. [12]
    A. Salomaa and L. Santean, Secret selling of secrets with many buyers, EATCS Bull. 42(1990)178–186.Google Scholar

Copyright information

© J.C. Baltzer AG, Science Publishers 1994

Authors and Affiliations

  • Hannu Nurmi
    • 1
  • Arto Salomaa
    • 2
  1. 1.Department of PhilosophyUniversity of TurkuTurkuFinland
  2. 2.Academy of Finland and Department of MathematicsUniversity of TurkuTurkuFinland

Personalised recommendations