A universal single-authority election system

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E81-A, Issue 10, 1998, Pages 2186-2193

  Lei, Chin Laung ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Blind signatures; Cryptography; Electronic election systems; Security privacy

Indexed keywords

CRYPTOGRAPHY; DATA PRIVACY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; ERROR CORRECTION;

BLIND SIGNATURES; ELECTRONIC ELECTION SYSTEMS;

SECURITY OF DATA;

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

References (20)

1. J. Benaloh Verifiable secret-ballot elections YALEU/ DCS/TR-561, Ph. D. Thesis, Yale University, New Haven, CT, 1987.
2. J. Benaloh and D. Tuinstra Receipt-free secret-ballot elections Proc. 26th ACM Symposium on the Theory of Computing, pp. 544-553, 1994.
3. J. Benaloh Dense probabilistic encryption Proc. SAC'94-Workshop on Selected Areas of Cryptography, Kingston, 1994.
4. C. Boyd Some applications of multiple key ciphers Advances in Cryptology-EUROCRYPT'88, LNCS 403, Springer-Verlag, pp. 455-467, 1988.
5. C. Boyd A new multiple key ciphers and an improved voting scheme Advances in CryptologyEUROCRYPT'89, LNCS 434, Springer-Verlag, pp. 617625, 1990.
6. D. Chaum Untraceable electronic mail, return addresses, and digital pseudonyms Communications of the ACM, pp. 84-88, 1981.
7. D. Chaum Blind signatures for untraceable payments Advances in Cryptology-CRYPTO'82, Springer-Verlag, pp. 199-203, 1983.
8. D. Chaum The dining cryptographers problem: Unconditional sender and recipient untraceability Journal of Cryptology, vol. 1, pp. 65-75, 1988.
9. J. D. Cohen and M. J. Fischer A robust and verifiable cryptographic ally secure election scheme Proc. 26th IEEE Symposium on Foundations of Computer Science, pp. 372-382, 1985.
10. J. Evertse and E. V. Heyst Which new RSA-signatures can be computed from certain given RSA-signatures? Journal of Cryptology, vol. 5, no. l, pp. 41-52, 1992.
11. C. I. Fan and C. L. Lei User efficient blind signatures Electron. Lett. , vol. 34, no. 6, pp. 544-546, 1998.
12. C. I. Fan and C. L. Lei A multi-recastable ticket scheme for electronic elections Advances in CryptologyASIACRYPT'96, LNCS 1163, Springer-Verlag, pp. 116124, 1996. (A complete version is in IEICE Trans. Fundamentals, vol. ESl-A, no. 5, pp. 940-949, 1998. )
13. N. Ferguson Single term off-line coins Advances in Cryptology-EUROCRYPT'93, LNCS 765, SpringerVerlag, pp. 318-328, 1993.
14. VV. 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.
15. W. S. Juang and C. L. Lei A secure and practical electronic voting scheme for real world environments IEICE Trans. Fundamentals, vol. E80-A, no. l, pp. 64-71, 1997.
16. H. Nurmi, A. Salomaa, and L. Santean Secret ballot elections in computer networks Computers & Security, vol. 10, pp. 553-560, 1991.
17. 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.
18. M. Rabin Transaction protection by beacons Journal of Computer and System Sciences, vol. 27, no. 2, pp. 256-267, 1983.
19. R. L. Rivest, A. Shamir, and L. Adleman A method for obtaining digital signatures and public key cryptosystems Commun. ACM, pp. 120-126, 1978.
20. P. M. Slessenger Socially secure cryptographic election scheme Electron. Lett. , vol. 27, no. ll, pp. 955-957, 1991.