Client/server tradeoffs for online elections

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2274, Issue , 2002, Pages 125-140

  DamgÅrd, Ivan ^a   Jurik, Mads ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

PUBLIC KEY CRYPTOGRAPHY;

CLIENT /SERVER; CLIENT MACHINE; ONLINE ELECTION; TRADE OFF; VOTING SCHEMES; WORK LOADS;

ECONOMIC AND SOCIAL EFFECTS;

EID: 37149020412     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45664-3_9     Document Type: Conference Paper

References (16)

1. Abe: Universally verifiable MIX net with verification work independent of the number of MIX centers; proceedings of EuroCrypt 98, Springer Verlag LNCS.
2. Ohkubo and Abe: A Length-Invariant Hybrid Mix Proceedings of Asiacrypt 00, Springer Verlag LNCS.
3. Baudron, Fouque, Pointcheval, Poupard and Stern: Practical Multi-Candidate Election Scheme, manuscript, May 2000.
4. R. Cramer, R. Gennaro, B. Schoenmakers: A Secure and Optimally Efficient Multi-Authority Election Scheme, Proceedings of EuroCrypt 97, Springer Verlag LNCS series, pp. 103-118.
5. Damgård and Jurik: A Generalisation, a Simplification and some Applications of Paillier’s Probabilistic Public-Key System, Proc. of Public Key Cryptography 2001, Springer Verlag LNCS series.
6. A. Fujioka, T. Okamoto & K. Otha: A practical secret voting scheme for large scale elections., Advances in Cryptology - Auscrypt’92, pp. 244-251.
7. B. Schoenmakers: A simple publicly verifiable secret sharing scheme and its application to electronic voting, Advances in Cryptology - Crypto’99, vol. 1666 of LNCS, pp. 148-164.
8. R. Cramer, M. Franklin, B. Schoenmakers & M. Yung: Multi-authority secret ballot elections with linear work, Advances in Cryptology - Eurocrypt’96, vol. 1070 of LNCS, pp. 72-83.
9. R. Cramer, I. Damgård and J. Nielsen:Multiparty Computation from Threshold Homomorphic Encryption, Proceedings of EuroCrypt 2001, Springer Verlag LNCS series 2045, pp.280-300.
10. Boudot: Efficient Proof that a Comitted Number Lies in an Interval, Proc. of EuroCrypt 2000, Springer Verlag LNCS series 1807.
11. Damgård and Fujisaki: An Integer Commitment Scheme based on Groups with Hidden Order, Manuscript, 2001, available from the Eprint archive.
12. Fujisaki and Okamoto: Statistical Zero-Knowledg Protocols to prove Modular Polynomial Relations, proc. of Crypto 97, Springer Verlag LNCS series 1294.
13. Oded Goldreich, Silvio Micali, and Avi Wigderson: How to play any mental game or a completeness theorem for protocols with honest majority, in Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pages 218–229, New York City, 25–27 May 1987.
14. M. Hirt and K. Sako: Efficient Receipt-Free Voting based on Homomorphic Encryption, Proceedings of EuroCrypt 2000, Springer Verlag LNCS series, pp. 539-556.
15. P. Pallier: Public-Key Cryptosystems based on Composite Degree Residue Classes, Proceedings of EuroCrypt 99, Springer Verlag LNCS series, pp. 223-238.
16. J. Bar-Ilan, and D. Beaver: Non-Cryptographic Fault-Tolerant Computing in a Constant Number of Rounds, Proceedings of the ACM Symposium on Principles of Distributed Computation, 1989, pp. 201-209.