A multi-candidate electronic voting scheme based on secure sum protocol

Jisuanji Yanjiu yu Fazhan/Computer Research and Development

Volumn 43, Issue 8, 2006, Pages 1405-1410

  Zhong, Hong ^a,b   Huang, Liusheng ^a   Luo, Yonglong ^a  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b ANHUI UNIVERSITY   (China)

Author keywords

Electronic voting; Multi precision arithmetic; Secure sum

Indexed keywords

BINARY SEQUENCES; CRYPTOGRAPHY; ELECTRONIC COMMERCE;

BALLOT SECRECY; BOOLEAN VOTE; DISPUTE FREENESS; ELECTRONIC VOTING; INFORMATION THEORETICALLY SECURE; MULTI PRECISION ARITHMETIC; RANDOM NUMBER; RECEIPT FREE; SECURE SUM; TRANSFER MATRIX;

SECURITY OF DATA;

EID: 33748703662     PISSN: 10001239     EISSN: None     Source Type: Journal    
DOI: 10.1360/crad20060814     Document Type: Article

References (13)

1. J Benaloh, D Tuinstra. Receipt-free secret-ballot elections [C]. In: Proc of the 26th ACM Symposium on Theory of Computing. New York: ACM Press, 1994. 544-553
2. J Groth. Efficient maximal privacy in boardroom voting and anonymous broadcast [G]. In: Proc of the 8th Int'l Conf on Financial Cryptography (FC2004), LNCS 3110. Berlin: Springer-Verlag, 2004. 90-104
3. R Cramer, M Franklin, B Schoenmakers, et al. Multi-authority secret-ballot elections with linear work [G]. In: Advances in Cryptology-Eurocrypt'96, LNCS 1070. Berlin: Springer-Verlag, 1996. 72-83
4. R Cramer, R Gennaro, B Schoenmakers. A secure and optimally efficient multi-authority election scheme [G]. In: Advances in Cryptology-Eurocrypt'97, LNCS 1223. Berlin: Springer-Verlag, 1997. 103-118
5. I Damgard, M Jurik. A generalisation, a simplication and some applications of Paillier's probabilistic public-key system [G]. In: The 4th Int'l Workshop on Practice and Theory in Public Key Cryptosystems (PKC 2001), LNCS 1992. Berlin: Springer-Verlag, 2001. 119-136
6. O Goldreich. Secure multi-party computation (working draft) [OL]. http://www.wisdom,weizmann.ac.il/home/oded/publichtml/foc.html, 1998
7. K H Rosen. Elementary Number Theory and Its Applications [M]. New York: Addition Wesley, 1984
8. H Cohen. A Course in Computational Algebraic Number Theory [M]. Berlin: Springer, 1993
9. D E Knuth. The Art of Computer Programming: Semi-Numerical Algorithms [M]. Volume 2. New York: Addition Wesley, 1981
10. J C Benaloh. Secret sharing homomorphisms: Keeping shares of a secret secret [G]. In: Advances in Cryptology-Crypto'86, LNCS 263. Berlin: Springer-Verlag, 1986. 251-260
11. B Schneier. Applied Cryptography [M]. New York: John Wiley and Sons, 1996
12. C Clifton, M Kantarcioglu. Tools for privacy preserving distributed data mining [J]. ACM SIGKDD Explorations Newsletter, 2002, 4 (2): 28-34
13. D Boneh, M Franklin. Efficient generation of shared RSA keys [J]. Journal of the ACM, 2001, 48 (4): 702-722