Multi-recastable ticket schemes for electronic voting

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E81-A, Issue 5, 1998, Pages 940-949

  Fan, Chun I ^a   Lei, Chin Laung ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Blind signatures; Cryptography; Multi recastable electronic votings; Quadratic residues; Security and privacy

Indexed keywords

COMPUTER NETWORKS; DATA COMMUNICATION SYSTEMS; SECURITY OF DATA; TELECOMMUNICATION SERVICES; TELECOMMUNICATION TRAFFIC;

BLIND SIGNATURE; MULTIRECASTABLE ELECTRONIC VOTING;

CRYPTOGRAPHY;

EID: 0032066843     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (37)

1. M. Abe and E. Fujisaki, "How to date blind signatures," Advances in Cryptology-ASIACRYPT'96, LNCS 1163, pp.244-251, Springer-Verlag, 1996.
2. J.C. Benaloh and D. Tuinstra, "Receipt-free secret-ballot elections," Proceedings of the 26th ACM Symposium on the Theory of Computing, pp.544-553, 1994.
3. J. Borrell and J. Rifa, "An implementable secure voting scheme," Computers & Security, vol.15, no.4, pp.327-338, 1996.
4. C.A. Boyd, "A new multiple key ciphers and an improved voting scheme," Advances in CryptologyEUROCRYPT'89, LNCS 434, pp.617-625, Spring"erVerlag, 1990.
5. J.L. Camenisch, J.M. Piveteau, and M.A. Stadler, "Blind signatures based on the discrete logarithm problem," Advances in CryptoIogy-EUROCRYPT'94, LNCS 950, pp.428-432, Springer-Verlag, 1995.
6. D. Chaum, "Untraceable electronic mail, return addresses, and digital pseudonyms," Communications of the ACM, vol.24, no.2, pp.84-88, 1981.
7. D. Chaum, "Blind signatures systems," Advances in Cryptology-CRYPTO'83, p.153, Plenum, 1983.
8. D. Chaum, "The dining cryptographers problem: Unconditional sender and recipient untraceability," Journal of Cryptology, vol.1, no.l, pp.65-75, 1988.
9. J.D. Cohen and M.J. Fisher," A robust and verifiable cryptographically secure election scheme," Proceedings of the 26th IEEE Symp. on Foundations of Computer Science, pp.372-382, 1985.
10. R. Cramer, M. Franklin, B. Schoenmakers, and M. Yumg, "Multi-authority secret-ballot elections with linear work," Advances in Cryptology-EUROCRYPT'96, pp.72-83, Springer-Verlag, 1996.
11. A. Evans, W. Kantrowitz, Jr., and E. Weiss, "A user authentication scheme not requiring secrecy in the computer," Communications of the ACM, vol.17, no.8, pp.437-442, 1974.
12. C.I. Fan and C.L. Lei, "User efficient blind signatures," Electronics Letters, vol.34, no.6, pp.544-546, 1998.
13. C.I. Fan and C.L. Lei, "A multi-recastable ticket scheme for electronic elections," Advances in CryptologyASIACRYPT'96, LNCS 1163, pp.116-124, SpringerVerlag, 1996.
14. N. Ferguson, "Single term off-line coins," Advances in Cryptology-EUROCRYPT'93, LNCS 765, pp.318-328, Springer-Verlag, 1994.
15. A. Fujioka, T. Okamoto, and K.Ohta, "A practical secret voting scheme for large scale elections," Advances in Cryptology-AUSCRYPT'92, LNCS 718, pp.244-251, Springer-Verlag, 1992.
16. K.R. Iversen, "A cryptographic scheme for computerized general elections," Advances in Cryptology-CRYPTO'91, LNCS 576, pp.405-419, Springer-Verlag, 1991.
17. W.S. Juang and C.L. Lei, "A collision free secret ballot protocol for computerized general elections," Computers & Security, vol.15, no.4, pp.339-348, 1996.
18. W.S. Juang, C.L. Lei, and C.I. Fan, "Anonymous channel and authentication in wireless communications," Proc. International Conference on Networking and Multimedia, International Computer Symposium, Taiwan, R.O.C., pp.227-234, 1996.
19. VV.J. LeVeque, "Fundamentals of Number Theory," Addison-Wesley, Reading, Mass., 1977.
20. M. Michels and P. Horster, "Some remarks on a receiptfree and universally verifiable mix-type voting scheme," Advances in Cryptology-ASIACRYPT'96, LNCS 1163, pp.125-132, Springer-Verlag, 1996.
21. H. Nurmi, A. Salomaa, and L. Santean, "Secret ballot elections in computer networks," Computers & Security, vol. 10, pp.553-560, 1991.
22. C. Park, K. Itoh, and K. Kurosawa, "All/nothing election scheme and anonymous channel," Advances in Cryptology-EUROCRYPT'93, LNCS 765, pp.248-259, Springer-Verlag, 1993.
23. R.C. Peralta, "A simple and fast probabilistic algorithm for computing square roots modulo a prime number," IEEE Transactions on Information Theory, vol.32, no.6, pp.846-847, 1986.
24. S. Pohlig and M.E. Hellman, "An improved algorithm for computing logarithms over GF(p) and its cryptographic significance," IEEE Trans. Inf. Theory, vol.24, pp. 106-110, 1978.
25. D. Pointcheval and J. Stern, "Provably secure blind signature schemes," Advances in Cryptology-ASIACRYPT'96, LNCS 1163, pp.252-265, Springer-Verlag, 1996.
26. D. Pointcheval and J. Stern, "New blind signatures equivalent to factorization," Proc. 4th ACM Conference on Computer and Communication Security, pp.92-99, 1997.
27. J.M. Pollard and C.P. Schnorr, "An efficient solution of the congruence x2 + ky2 = m (mod n)," IEEE Trans. Inf. Theory, vol.33, no.5, pp.702-709, 1987.
28. O.P. Purdy, "A high security log-in procedure," Communications of the ACM, vol.17, no.8, pp.442-445, 1974.
29. M.O. Rabin, "Digitalized signatures and public-key functions as intractable as factorization," Technical Report, MIT/LCS/TR212, MIT Lab., Computer Science, Cambridge, Mass. Jan. 1979.
30. R.L. Rivest, A. Shamir, and L. Adleman, "A method for obtaining digital signatures and public key cryptosystems," Communications of the ACM, vol.21, no.2, pp.120-126, 1978.
31. K. Sako, "Electronic voting schemes allowing open objection to the tally," IEICE Trans. Fundamentals, vol.E77-A, no.l, pp.24-30, Jan. 1994.
32. K. Sako and J. Kilian, "Secure voting using partially compatible homomorphisms," Advances in CryptologyCRYPTO'94, LNCS 839, pp.411-424, Springer-Verlag, 1994.
33. K. Sako and J. Kilian, "Receipt-free mix-type voting scheme," Advances in Cryptology-EUROCRYPT'95, pp.393-403, Springer-Verlag, 1995.
34. A. Shamir and C.P. Schnorr, "Cryptanalysis of certain variants of Rabin's signature scheme," Information Processing Letters, vol.19, pp.113-115, 1984.
35. G.J. Simmons, "Contemporary Cryptology: The Science of Information Integrity," IEEE Press, N.Y., 1992.
36. P.H. Slessenger, "Socially secure cryptographic election scheme," Electronics Letters, vol.27, no. 11, pp.955-957, 1991.
37. H.C. Williams, "A modification of the RSA public-key encryption procedure," IEEE Trans. Inf. Theory, vol.26, no.6, pp.726-729, 1980.