A collision-free secret ballot protocol for computerized general elections

Computers and Security

Volumn 15, Issue 4, 1996, Pages 339-348

  Juang, Wen Shenq ^a   Lei, Chin Laung ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Distributed systems; Privacy; Secret ballot protocols; Security; Uniquely blind signature schemes

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; NETWORK PROTOCOLS; VOTING MACHINES;

COLLISION FREE SECRET BALLOT PROTOCOL; COMPUTERIZED GENERAL ELECTIONS; UNIQUELY BLIND SIGNATURE TECHNIQUES;

SECURITY OF DATA;

EID: 0030410935     PISSN: 01674048     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-4048(96)00011-9     Document Type: Article

References (25)

1. A. Fujioka, T. Okamoto and K. Ohta, A practical secret voting scheme for large scale elections, in Advances in Cryptology: Proceedings of AusCrypt'92, LNCS 718, pp. 244-251, Springer, Berlin, 1992.
2. K.R. Iversen, A cryptographic scheme for computerized general elections, in Advances in Cryptology: Proceedings of Crypt'91, LNCS 576, pp. 405-419, Springer, Berlin, 1991.
3. H. Nurmi, A. Salomaa and L. Santean, Secret ballot elections in computer networks, Computers & Security, 10 (1991) 553-560.
4. C.P. Pfleeger, Security in Computing, Prentice-Hall, Englewood Cliffs, NJ, 1989.
5. A. Yao, Protocols for secure communications, in Proceedings of the 23rd Annual IEEE Symposium on the Foundations of Computer Science, pp. 160-164, 1982.
6. R. Demillo, N. Lynch and M. Merritt, Cryptographic protocols, in Proceedings of the 14th Annual ACM Symposium on the Theory of Computing, pp. 382-400, 1982.
7. D. Chaum, Elections with unconditionally secret ballots and disruption equivalent to breaking RSA, in Advances in Cryptology: Proceedings of EuroCrypt'88, LNCS 330, pp. 177-182, Springer, Berlin, 1988.
8. C. Boyd, Some applications of multiple key ciphers, in Advances in Cryptology: Proceedings of EuroCrypt'88, LNCS 330, pp. 455-467, Springer, Berlin, 1988.
9. C. Boyd, A new multiple key ciphers and an improved voting scheme, in Advances in Cryptology: Proceedings of EuroCrypt'89, LNCS 434, pp. 617-625, Springer, Berlin, 1990.
10. W.S. Juang, C.L. Lei and C.I. Fan, A collision free secret ballot protocol for computerized general elections, in International Computer Symposium, Taiwan, pp. 309-314, 1994.
11. G. Brassard and C. Crepeau, All-or-nothing disclosure of secrets, in Advances in Cryptology: Proceedings of Crypt'87, LNCS 293, pp. 234-238, Springer, Berlin, 1987.
12. A. Salomaa & L. Santean, Secret selling of secrets with many buyers, EATCS Bulletin, 42 (1990) 178-186.
13. P.H. Slessenger, Socially secure cryptographic election scheme, Electronics Letters 23rd, 27 (11) (1991).
14. K.R. Iversen, A novel probabilistic additive privacy homomorphism, in Proceedings of the International Conference on Finite Fields, Coding Theory, and Advances in Communications and Computing, Lecture Notes in Pure and Applied Mathematics, Dekker, New York, 1991.
15. J. Benaloh and D. Tuinstra, Receipt free secret ballot elections, in Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, pp. 544-553, 1994.
16. D. Chaum, Blind signatures systems, in Advances in Cryptology: Proceedings of Crypt'83, p. 153, Plenum Press, New York, 1983.
17. D. Chaum, Blinding for unanticipated signatures, Advances in Cryptology: Proceedings of EuroCrypt'87, LNCS 304, pp. 227-233, Springer, Berlin, 1987.
18. S. Pohlig and M.E. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Transactions on Information Theory, IT-24 (1978) 106-110.
19. T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithm, IEEE Transactions Information Theory, 31 (1985) 469-472.
20. W. Diffie and M.E. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, IT-22 (1976) 644-654.
21. G.J. Simmons, Contemporary Cryptology - the Science of Information Integrity, pp. 266-268, 1992.
22. D. Chaum, Untraceable electronic mail, return addresses, and digital pseudonyms, Communications of the ACM, 24 (2) (1981) 84-88.
23. D. Chaum, The dining cryptographers problem: unconditional sender and recipient untraceability, Journal of Cryptology, 1 (1988) 65-75.
24. C. Park, K. Itoh and K. Kurosawa, Efficient anonymous channel and all/nothing election scheme, in Advances in Cryptology: Proceedings of EuroCrypt'93, LNCS 765, pp. 248-259, Springer, Berlin, 1994.
25. B. Pfizmann, Breaking an efficient anonymous channel. Advances in Cryptology: Proceedings of EuroCrypt'94, LNCS 950, pp. 332-340, Springer, Berlin, 1995.