A multi-recastable ticket scheme for electronic elections

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1163, Issue , 1996, Pages 116-124

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

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; CRYPTOGRAPHY; NETWORK SECURITY;

BLIND SIGNATURES; CASTABLE; ELECTRONIC ELECTION; NETWORK TRAFFIC; QUADRATIC RESIDUES; SQUARE ROOTS;

ELECTRONIC VOTING;

EID: 84955622732     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0034840     Document Type: Conference Paper

References (20)

1. Boyd, C. A., 'A new multiple key ciphers and an improved voting scheme,' Advances in Cryptology-EUROCRYPT'89, LNCS 434, Springer-Verlag, 1990, pp. 617-625.
2. Benaloh, J. C. and Tuinstra, D., 'Receipt-free secret-ballot elections,' Proc. 26th ACM Symp. on the Theory of Computing, 1994, pp. 544-553.
3. Chaum, D., 'Untraceable electronic mail, return addresses, and digital pseudonyms,' Communications of the ACM, vol. 24, no. 2, 1981, pp. 84-88.
4. Chaum, D., Fiat, A., and Naor, M., 'Untraceable electronic cash,' Advances in Cryptology-CRYPTO'88, LNCS 403, Springer-Verlag, 1982, pp. 319-327.
5. Chaum, D., 'The dining cryptographers problem: unconditional sender and recipient untraceability,' Journal of Cryptology, vol. 1, 1988, pp. 65-75.
6. Cohen, J. D. and Fisher, M. J., 'A robust and verifiable cryptographically secure election scheme,' Proc. 26th IEEE Symp. on Foundations of Computer Science, 1985, pp. 372-382.
7. Fan, C. I. and Lei, C. L., 'Efficient blind signature scheme based on quadratic residues,' Electronics Letters, vol. 32, no. 9, 1996, pp. 811-813.
8. Fan, C. I. and Lei, C. L., 'Low-computation blind signature schemes based on quadratic residues,' Technical Reports, Department of Electrical Engineering, National Taiwan University, R. O. C., 1996.
9. Fujioka, A., Okamoto, T. and Ohta, K., 'A practical secret voting scheme for large scale elections,' Advances in Cryptology-AUSCRYPT'92, LNCS 718, Springer-Verlag, 1992, pp. 244-251.
10. Iversen, K. R., 'A cryptographic scheme for computerized general elections,' Advances in Cryptology-CRYPTO'91, LNCS 576, Springer-Verlag, 1991, pp. 405-419.
11. Juang, W. S., Lei, C. L. and Fan, C. I., 'A collision free secret ballot protocol for computerized general elections,' International Computer Symposium, Taiwan, R. O. C., 1994. (A revised version will appear in Computers & Security.).
12. Nurmi, H., Salomaa, A. and Santean, L., 'Secret ballot elections in computer networks,' Computers & Security, vol. 10, 1991, pp. 553-560.
13. Peralta, R. C., 'A simple and fast probabilistic algorithm for computing square roots modulo a prime number,' IEEE Trans. Inform. Theory, vol. 32, no. 6, 1986, pp. 846-847.
14. Pohlig, S. and Heilman, M. E., 'An improved algorithm for computing logarithms over GF(p) and its cryptographic significance,' IEEE Trans, on Inform. Theory, vol. 24, 1978, pp. 106-110.
15. Park, C., Itoh, K. and Kurosawa, K., 'All/nothing election scheme and anonymous channel,' Advances in Cryptology-EUROCRYPT'93, LNCS 765, Springer-Verlag, 1993, pp. 248-259.
16. 2 = m (mod n),' IEEE Trans. Inform. Theory, vol. 33, no. 5, 1987, pp. 702-709.
17. Rabin, M. O., 'Digitalized signatures and public-key functions as intractable as factorization,' Techhhhnical Report, MIT/LCS/TR212, MIT Lab., Computer Science, Cambridge, Mass. Jan. 1979.
18. Rivest, R. L., Shamir, A. and Adleman, L., 'A method for obtaining digital signatures and public key cryptosystems,' Communications of the ACM, vol. 21, no. 2, 1978, pp. 120-126.
19. Sako, K. and Kilian, J., 'Secure voting using partially compatible homomorphisms,' Advances in Cryptology-CRYPTO'94, LNCS 839, Springer-Verlag, 1994, pp. 411-424.
20. Slessenger, P. H., 'Socially secure cryptographic election scheme,' Electronics Letters, vol. 27, no. 11, 1991, pp. 955-957.