On coercion-resistant electronic elections with linear work

Proceedings - Second International Conference on Availability, Reliability and Security, ARES 2007

Volumn , Issue , 2007, Pages 908-916

  Weber, Stefan G ^a   Araújo, Roberto ^a   Buchmann, Johannes ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNET; RELIABILITY THEORY; SECURITY OF DATA;

COERCION; ELECTRONIC ELECTIONS; ELECTRONIC VOTING SYSTEMS; REGULAR ELECTIONS;

LINEAR SYSTEMS;

EID: 34548150987     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ARES.2007.108     Document Type: Conference Paper

References (26)

1. O. Baudron, P.-A. Fouque, D. Pointcheval, J. Stern, and G. Poupard. Practical multi-candidate election system. In PODC: 20th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 274-283, 2001.
2. J. C. Benaloh. Verifiable Secret-Ballot Elections. PhD thesis, Yale University, Department of Computer Science, September 1987.
3. F. Breuer and A. H. Trechsel. E-Voting in the 2005 local elections in Estonia. Technical report, Council Of Europe, 2006.
4. D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84-88, 1981.
5. D. Chaum and T. P. Pedersen. Wallet databases with observers. In Advances in Cryptology - CRYPTO 92, volume 740 of LNCS, pages 89-105. Springer-Verlag, 1993.
6. T. H. Cormen, C. E. Leierson, R. L. Rivest, and C. Stein. Introduction to Algorithms, second edition. MIT Press, Cambridge, Massachusetts - London, England, 2001.
7. R. Cramer, I. Damgard, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Advances in Cryptology - CRYPTO 94, volume 839 of LNCS, pages 174-187. Springer-Verlag, 1994.
8. R. Cramer, R. Gennaro, and B. Schoenmakers. A secure and optimally efficient multi-authority election scheme. In Advances in Cryptology - EUROCRYPT97, volume 1233 of LNCS, pages 103-118. Springer-Verlag, 1997.
9. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31(4):469-472, 1985.
10. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology - CRYPTO 86, volume 263 of LNCS, pages 186-194. Springer-Verlag, August 1986.
11. J. Furukawa and K. Sako. An efficient scheme for proving a shuffle. In Advances in Cryptology - CRYPTO 01, volume 2139 of LNCS, pages 368-387. Springer-Verlag, 2001.
12. M. Hirt and K. Sako. Efficient receipt-free voting based on homomorphic encryption. In Advances in Cryptology - EUROCRYPT 00, volume 1807 of LNCS, pages 539-556. Springer-Verlag, 2000.
13. M. Jakobsson and A. Juels. Mix and match: Secure function evaluation via ciphertexts (extended abstract). In ASIACRYPT 00, volume 1976 of LNCS, pages 162-177. Springer-Verlag, 2000.
14. A. Juels and J. G. Brainard. Client puzzles: A cryptographic countermeasure against connection depletion attacks. In NDSS. The Internet Society, 1999.
15. A. Juels, D. Catalano, and M. Jakobsson. Coercion-resistant electronic elections (extended abstract). In ACM Workshop On Privacy In The Electronic Society 2005 (WPES '05), pages 61-70, November 2005.
16. B. Lee. Zero-knowledge Proofs, Digital Signature Variants, and Their Applications. PhD thesis, School of Engineering, Information and Communications University, Daejeon, Korea, December 2001.
17. B. Lee and K. Kim. Receipt-free electronic voting scheme with a tamper-resistant randomizer. In P. J. Lee and C. H. Lim, editors, ICISC, volume 2587 of LNCS, pages 389-406. Springer, 2002.
18. C. A. Neff. A verifiable secret shuffle and its application to e-voting. In SIGSAC: 8th ACM Conference on Computer and Communications Security. ACM SIGSAC, 2001.
19. T. Okamoto. Receipt-free electronic voting schemes for large scale elections. In B. Christianson, B. Crispo, T. M. A. Lomas, and M. Roe, editors, Security Protocols Workshop, volume 1361 of LNCS, pages 25-35. Springer, 1997.
20. C. Park, K. Itoh, and K. Kurosawa. Efficient anonymous channel and all/nothing election scheme. In Advances in Cryptology - EUROCRYPT 93, volume 765 of LNCS, pages 248-259. Springer-Verlag, 1993.
21. T. P. Pedersen. A threshold cryptosystem without a trusted party (extended abstract). In Advances in Cryptology EUROCRYPT 91, volume 547 of LNCS, pages 522-526. Springer-Verlag, April 1991.
22. C. P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4(3):161-174, 1991.
23. B. Schoenmakers. Fully auditable electronic secret-ballot elections. Xootic Magazine, Juli 2000.
24. A. Shamir. How to share a secret. Communications of the ACM, 22(11):612-613, 1979.
25. W. D. Smith. New cryptographic voting scheme with best-known theoretical properties. In Workshop on Frontiers in Electronic Elections (FEE 2005), Milan, Italy, September 2005.
26. L. von Ahn, M. Blum, and J. Langford. Telling humans and computers apart automatically. Communications of the ACM, 47(2):56-60, 2004.