A protocol for anonymous and accurate E-polling

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3416, Issue , 2005, Pages 112-121

  Bruschi, Danilo ^a   Fovino, Igor Nai ^a   Lanzi, Andrea ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMMUNICATION SYSTEMS; NETWORK PROTOCOLS; SECURITY OF DATA;

E-POLLING PROTOCOLS; PRIVACY RULES;

INFORMATION TECHNOLOGY;

EID: 26844502461     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-32257-3_11     Document Type: Conference Paper

References (21)

1. Benaloh, J., and Tuinstra, D. "Receipt-free secret-ballot elections." In Proceedings of the Twenty-sixth Annual ACM Symposium on the Theory of Computing, 1994, pp. 544-553.
2. Chaum,D. "Untraceable electronic mail, return addresses, and digital pseudonyms." Communications of the ACM, 24(2), 1981, pp. 84-88.
3. Chaum, D. "Elections with unconditionally-secret ballots and disruption equivalent to breaking RSA." Lecture Notes in Computer Science, N. 330, Springer-Verlag, 1988, pp. 177-182.
4. Cohen, J. D. "Improving privacy in cryptographic elections." Tech. Rep. YALEU/DCS/TR-454, Yale University, February 1986.
5. Cranor, L. F., and Cytron R. K. "Sensus: A security-Conscious Electronic polling system for Internet." In Proceedings of the Hawaii International Conference on System sciences. Hawaii, 1997.
6. Fujioka, A., Okamoto, T., and Ohta, K. "A practical secret voting scheme for large scale elections." In Advances in Cryptology - AUSCRYPT 92, J. Seberry and Y. Zheng, Eds., Lecture Notes in Computer Science, N. 718, Springer-Verlag, 1993, pp. 244-251.
7. Karro J., and Wang J. "Towards a practical, secure and very large scale online Election." In Proceedings of fifteenth Computer Security Applications Conference, 1999, pp. 161-169.
8. Nurmi, H., Salomaa, A., and Santean, L. "Secret ballot elections in computer networks." Computers & Security, 36(10), 1991, pp. 553-560.
9. Michael K. Reiter and Aviel D. Rubin, Anonymous Web transactions with Crowds, Commun. ACM, vol. 42, number 2, 1999,0001-0782, pag. 32-48, ACM Press
10. rfc 2246 T. Dierks C. Allen Certicom January 1999
11. Blind signatures for untraceable payments Advances in criptology Cripto '82. LCNS pp. 199-203
12. D. Chaum, Security without identification: transaction systems to make big brother obsolete Communication of the ACM, 1985, vol. 28, number 10, pages 1030, month October
13. M. Hirt, K. Sako Efficient Receipt-free voting based on homomorphic encryption pages 539-556, LNCS 1807, 2000, Springer-Verlag
14. P. Horster, M. Michels, H. Petersen Blind multi-signature schemes and their relevance to electronic voting Proc. 11th Annual Computer Security Applications Conference, New Orleans, IEEE Press, (1995), pp. 149-155.
15. C. Park, K Itoh, k. Kurusawa. ALL-nothing Election scheme and anonymous channel. Eurocrypt '93, pages 248-259.Springer-Verlag, LNCS 765, 1993
16. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. In Crypto '84, pages 10-18. Springer-Verlag, LNCS 196, 1984
17. K. Sako, J. Kilian. Receipt free mix-type voting scheme. Eurocrypt '95, pages 392-403. Springer-Verlag, LNCS 921, 1995
18. M. Jakobson, A. Juels, R. L. Rivest. Making mix nets robust for electronic voting by randomized partial checking. USENIX '02, D. Boneh editor, pages 339-353, 2002
19. K. Sako, J. Kilian. Secure voting using partial compatible homomorphisms. Crypt'94, pages 248-259. Springer-Verlag, LNCS 839, 1994
20. I. Damgrd, M. Jurik, A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System, PKC 2001, Springer-Verlag, LNCS pg. 119-136, 2001
21. O. Baudron, P. Forque, D. Pointcheval, G Poupard, J. Stern. Practical multi-candidate election system. PODC'01, pages 274-283, ACM 2001