A verifiable multi-authority secret election allowing abstention from voting

Computer Journal

Volumn 45, Issue 6, 2002, Pages 672-682

  Juang, Wen Shenq ^a   Lei, Chin Laung ^b   Liaw, Horng Twu ^a  

^a SHIH HSIN UNIVERSITY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CRYPTOGRAPHY; DATA PRIVACY; ROBUSTNESS (CONTROL SYSTEMS);

ELECTRONIC VOTES;

VOTING MACHINES;

EID: 0036453755     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/45.6.672     Document Type: Article

References (35)

1. Chaum, D. (1988) Elections with unconditionally secret ballots and disruption equivalent to breaking RSA. In Gunther, G. (ed.), Advances in Cryptology-EuroCrypt'88. Lecture Notes in Computer Science, 330, 177-182. Springer, New York.
2. Fujioka, A., Okamoto, T. and Ohta, K. (1992) A practical secret voting scheme for large scale elections. In Seberry, J. (ed.), Advances in Cryptology-AusCrypt'92. Lecture Notes in Computer Science, 718, 244-251. Springer, New York.
3. Iversen, K. (1991) A cryptographic scheme for computerized general elections, In Feigenbaum, J. (ed.), Advances in Cryptology-Crypt'91. Lecture Notes in Computer Science, 576, 405-419. Springer, New York.
4. Juang, W. and Lei, C. (1996) A collision free secret ballot protocol for computerized general elections. Computers Security, 15, 339-348.
5. Juang, W. and Lei, C. (1997) A secure and practical electronic voting scheme for real world environments. IEICE Trans. Fundamentals, E80-A, 64-71.
6. Nurmi, H., Salomaa, A. and Santean, L. (1991) Secret ballot elections in computer networks. Computers Security, 10, 553-560.
7. Pfleeger, C. (1989) Security in Computing. Prentice-Hall, Englewood Cliffs, NJ.
8. Sako, K. (1994) Electronic voting scheme allowing open objection to the tally. IEICE Trans. Fundamentals, E77-A, 24-30.
9. Yao, A. (1982) Protocols for secure communications. In Proc. 23rd Ann. Symp. on Foundations of Computer Science, Chicago, IL, November 3-5, pp. 160-164. IEEE Press.
10. Camenisch, J., Pivereau, J. and Stadler, M. (1995) Blind signatures based on the discrete logarithm problem. In Santis, A. (ed.), Advances in Cryptology-EuroCrypt'94. Lecture Notes in Computer Science, 950, 428-432. Springer, New York.
11. Chaum, D. (1983) Blind signatures systems. In Chaum, D. (ed.), Advances in Cryptology-Crypt'83, pp. 153-157. Springer, New York.
12. Fan, C. and Lei, C. (1996) Efficient blind signature scheme based on quadratic residues. Electron. Lett., 32, 811-813.
13. Horster, P., Michels, M. and Petersen, H. (1995) Meta-message recovery and meta-blind signature schemes based on the discrete logarithm problem and their applications. In Pieprzyk, J. (ed.), Advances in Cryptology-AisaCrypt'94. Lecture Notes in Computer Science, 917, 224-237. Springer, New York.
14. Baraani-Dastjerdi, A., Pieprzyk, J. and Safavi-Naini, R. (1995) A practical electronic voting protocol using threshold schemes. In Proc. 11th Ann. Computer Security Applications Conf., New Orleans, LA, December, pp. 143-148. IEEE Computer Security Press.
15. Cramer, R., Gennaro, R. and Schoenmakers, B. (1997) A secure and optimally efficient multi-authority election scheme. In Fumy, W. (ed.), Advances in Cryptology-EuroCrypt'97. Lecture Notes in Computer Science, 1233, 103-118. Springer, New York.
16. Benaloh, J. and Tuinstra, D. (1994) Receipt free secret ballot elections. In Proc. 26th Ann. ACM Symp. on the Theory of Computing, Montreal, Quebec, Canada, May 23-25, pp. 544-553. ACM Press.
17. Niemi, V. and Renvall, A. (1999) Efficient voting with no selling of votes. Theoret. Comp. Sci., 226, 105-116.
18. Sako, K. and Kilian, J. (1995) Receipt-free mix-type voting scheme. In Guillou, C. (ed.), Advances in Cryptology-EuroCrypt'95. Lecture Notes in Computer Science, 921, 393-403. Springer, New York.
19. Pedersen, T. (1991) A threshold cryptosystem without a trusted party. In Davies, W. (ed.), Advances in Cryptology-EuroCrypt'91. Lecture Notes in Computer Science, 547, 522-526. Springer, New York.
20. Feldman, P. (1987) A practical scheme for non-interactive verifiable secret sharing. In Proc. 28th Ann. Symp. on Foundations of Computer Science, Los Angeles, CA, October 12-14, pp. 427-437. IEEE Press.
21. Gennaro, R., Jarecki, S., Krawczyk, H. and Rabin, T. (2000) Secure distributed key generation for discrete-log based cryptosystems. In Stern, J. (ed.), Advances in Cryptology-EuroCrypt'99. Lecture Notes in Computer Science, 1592, 295-310. Springer, New York.
22. Pedersen, T. (1991) Non-interactive and information-theoretic secure verifiable secret sharing. In Feigenbaum, J. (ed.), Advances in Cryptology-Crypt'91. Lecture Notes in Computer Science, 576, 129-140. Springer, New York.
23. Juang, W. and Lei, C. (1996) Blind threshold signatures based on discrete logarithm. In Jaffar, J. (ed.), Second Asian Computing Science Conf. on Programming, Concurrency and Parallelism, Networking and Security. Lecture Notes in Computer Science, 1179, 172-181. Springer, New York.
24. Juang, W. and Lei, C. (1999) Partially blind threshold signatures based on discrete logarithm. Comp. Commun., 22, 73-86.
25. Menezes, A., Oorschot, P. and Vanstone, S. (1997) Handbook of Applied Cryptography. CRC Press, New York.
26. Merkle, R. (1990) One way hash functions and DES. In Brassard, G. (ed.), Advances in Cryptology-Crypt'89. Lecture Notes in Computer Science, 435, 428-446. Springer, New York.
27. Stallings, W. (1999) Cryptography and Network Security (2nd edn). Prentice-Hall International, Englewood Cliffs, NJ.
28. Chaum, D. (1981) Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM, 24, 84-88.
29. Chaum, D. (1988) The dining cryptographers problem: unconditional sender and recipient untraceability. J. Cryptology, 1, 65-75.
30. Juang, W., Lei, C. and Chang, C. (1999) Anonymous channel and authentication in wireless communications. Comp. Commun., 22, 1502-1511.
31. Park, C., Itoh, K. and Kurosawa, K. (1993) Efficient anonymous channel and all/nothing election scheme. In Helleseth, T. (ed.), Advances in Cryptology-EuroCrypt'93. Lecture Notes in Computer Science, 765, 248-259. Springer, New York.
32. Pfitzmann, B. (1995) Breaking an efficient anonymous channel. In Santis, A. (ed.), Advances in Cryptology-EuroCrypt'94. Lecture Notes in Computer Science, 950, 332-340. Springer, New York.
33. Pohlig, S. and Hellman, M. (1978) An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Inform. Theory, 24, 106-110.
34. Rivest, R., Shamir, A. and Adleman, L. (1978) A method for obtaining digital signatures and public key cryptosystems. Commun. ACM, 21, 120-126.
35. ElGamal, T. (1985) A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inform. Theory, 31, 469-472.