An unlinkably divisible and intention attachable ticket scheme for runoff elections

Journal of Network and Computer Applications

Volumn 25, Issue 2, 2002, Pages 93-107

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

^a CHUNGHWA TELECOM CO LTD   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; NETWORK PROTOCOLS; SECURITY OF DATA; THEOREM PROVING; VOTING MACHINES;

ELECTRONIC VOTING;

COMPUTER APPLICATIONS;

EID: 0036555079     PISSN: 10848045     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1084-8045(02)90132-3     Document Type: Article

References (22)

1. M. Bellare & P. Rogaway 1993. Random oracles are practical: A paradigm for designing efficient protocols. Proceedings of the first ACM Conference on Computer and Communications Security 62-73.
2. J. Benaloh & D. Tuinstra 1994. Receipt-free secret-ballot elections. Proceedings of the 26th ACM Symposium on the Theory of Computing 544-553.
3. J. Camenisch, J. Piveteau and M. Stadler 1995. Blind signatures based on the discrete logarithm problem. Advances in Cryptology-EUROCRYPT'94, LNCS 950, Springer-Verlag, 428-432.
4. A. Carstairs 1980. A Short History of Electoral Systems in Western Europe. London: George Allen & Unwin.
5. D. Chaum 1981. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM 24(2), 84-88.
6. D. Chaum 1983. Blind signatures for untraceable payments. Advances in Cryptology-CRYPTO'82, Springer-Verlag, 199-203.
7. D. Chaum 1988. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology 1(1), 65-75.
8. A. Evans, W. Kantrowitz and E. Weiss 1974. A user authentication scheme not requiring secrecy in the computer. Communications of the ACM 17(8), 437-442.
9. C. Fan & C. Lei 1998. User efficient blind signatures. Electronics Letters 34(6), 544-546.
10. C. Fan and W. Chen 2001. An efficient blind signature scheme for information hiding. International Journal of Electronic Commerce 6(1), 93-100.
11. C. Fan, C. Lei & C. Chang 1998. An efficient election scheme for resolving ties. International Computer Symposium, Workshop on Cryptology and Information Security 95-100.
12. N. Ferguson 1994. Single term off-line coins. Advances in Cryptology-EUROCRYPT'93, LNCS 765, Springer-Verlag, 318-328.
13. C. Lei & C. Fan 1998. A universal single-authority election system. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences ESI-A(10), 2186-2193.
14. A. Menezes, P. van Oorschot & S. Vanstone 1997. Handbook of Applied Cryptography, CRC Press LLC.
15. T. Okamoto 1992. Provably secure and practical identification schemes and corresponding signature schemes. Advances in Cryptology-CRYPTO'92, LNCS 740, Springer-Verlag, 31-53.
16. D. Pointcheval & J. Stern 1996. Provably secure blind signature schemes. Advances in Cryptology-ASIACRYPT'96, LNCS 1163, Springer-Verlag, 252-265.
17. D. Pointcheval & J. Stern 1997. New blind signatures equivalent to factorization. Proceedings of the 4th ACM Conference on Computer and Communication Security 92-99.
18. G. Purdy 1974. A high security log-in procedure. Communications of the ACM 17(8), 442-445.
19. M. Rabin 1979. Digitalized signatures and public-key functions as intractable as factorization. Technical Report, MIT/LCS/TR212, MIT Lab., Computer Science, Cambridge, MA.
20. K. Sako 1994. Electronic voting schemes allowing open objection to the tally. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E77-A(1), 24-30.
21. C. Schnorr 1990. Efficient identification and signatures for smart cards. Advances in Cryptology-CRYPTO'89, LNCS 435, Springer-Verlag, 235-251.
22. G. Simmons 1992. Contemporary Cryptology: The Science of Information Integrity, NY: IEEE Press.