Evaluating security of voting schemes in the universal composability framework

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

Volumn 3089, Issue , 2004, Pages 46-60

  Groth, Jens ^a,b  

^a AARHUS UNIVERSITY   (Denmark)

^b Cryptomathic AS   (Denmark)

Author keywords

Homomorphic threshold encryption; Universal composability; Voting

Indexed keywords

CRYPTOGRAPHY;

ADAPTIVE ADVERSARY; HOMOMORPHIC THRESHOLD ENCRYPTION; LOSS OF EFFICIENCIES; RANDOM ORACLE MODEL; SECURITY PROPERTIES; SECURITY REQUIREMENTS; UNIVERSAL COMPOSABILITY; VOTING;

NETWORK SECURITY;

EID: 35048844767     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24852-1_4     Document Type: Review

References (24)

1. Burmester, M., Magkos, E.: Towards secure and practical e-elections in the new era. In Gritzalis, D., ed.: Secure Electronic Voting. Kluwer Academic Publishers (2003) 63-72
2. Lambrinoudakis, C., Gritzalis, D., Tsoumas, V., Karyda, M., Ikonomopoulos, S.: Secure electronic voting: The current landscape. In Gritzalis, D., ed.: Secure Electronic Voting. Kluwer Academic Publishers (2003) 101-122
3. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS 2001. (2001) 136-145 Full paper available at http://eprint.iacr.org/2000/67.
4. Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally eficient multiauthority election scheme. In: proceedings of EUROCRYPT '97, LNCS series, volume 1233. (1997) 103-118
5. Damgård, I., Jurik, M.J.: A generalisation, a simplification and some applications of paillier's probabilistic public-key system. In: 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001, LNCS series, volume 1992. (2001)
6. Baudron, O., Fouque, P.A., Pointcheval, D., Poupard, G., Stern, J.: Practical multi-candidate election scheme. In: PODC '01. (2001) 274-283
7. Damgård, I., Groth, J., Salomonsen, G.: The theory and implementation of an electronic voting system. In Gritzalis, D., ed.: Secure Electronic Voting. Kluwer Academic Publishers (2003) 77-100
8. Groth, J.: Evaluating security of voting schemes in the universal composability framework. Cryptology ePrint Archive, Report 2002/002 (2002)
9. Cramer, R., Damgård, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: proceedings of CRYPTO '94, LNCS series, volume 893. (1994) 174-187
10. Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: ACM Conference on Computer and Communications Security 1993. (1993) 62-73
11. Lindell, Y.: Parallel coin-tossing and constant round secure two-party computation. In: proceedings of CRYPTO '01, LNCS series, volume 2139. (2001) 408-432
12. Shoup, V., Gennaro, R.: Securing threshold cryptosystems against chosen ciphertext attack. Journal of Cryptology 15 (2002) 75-96
13. Canetti, R., Dwork, C., Naor, M., Ostrovsky, R.: Deniable encryption. In: proceedings of CRYPTO '97, LNCS series, volume 1294. (1997) 90-104
14. Boneh, D., Franklin, M.K.: Efficient generation of shared rsa keys. In: proceedings of CRYPTO '97, LNCS series, volume 1294. (1997) 425-439
15. Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. In: proceedings of EUROCRYPT '99, LNCS series, volume 1592. (1999) 293-310
16. Fouque, P.A., Stern, J.: Fully distributed threshold rsa under standard assumptions. In: proceedings of ASIACRYPT '01, LNCS series, volume 2248. (2001) 310-330
17. Algesheimer, J., Camenisch, J., Shoup, V.: Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In: proceedings of CRYPTO '02, LNCS series, volume 2442. (2002) 417-432
18. Canetti, R., Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Adaptive security for threshold cryptosystems. In: proceedings of CRYPTO '99, LNCS series, volume 1666. (1999) 98-115
19. Jarecki, S., Lysyanskaya, A.: Adaptively secure threshold cryptography: Introducing concurrency, removing erasures. In: proceedings of EUROCRYPT '00, LNCS series, volume 1807. (2000) 221-242
20. Lysyanskaya, A., Peikert, C.: Adaptive security in the threshold setting: From cryptosystems to signature schemes. In: proceedings of ASIACRYPT '01, LNCS series, volume 2248. (2001) 331-350
21. Damgård, I., Nielsen, J.B.: Universally composable efficient multiparty computation from threshold homomorphic encryption. In: proceedings of CRYPTO '03, LNCS series, volume 2729. (2003) 247-264
22. Damgård, I., Nielsen, J.B.: Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor. In: proceedings of CRYPTO '02, LNCS series, volume 2442. (2002) 581-596
23. Damgård, I., Groth, J.: Non-interactive and reusable non-malleable commitment schemes. In: STOC '03. (2003) 426-437
24. Garay, J.A., MacKenzie, P.D., Yang, K.: Strengthening zero-knowledge protocols using signatures. In: proceedings of EUROCRYPT '03, LNCS series, volume 2656. (2003) 177-194 Full paper available at htpp://eprint.iacr.org/2003/ 037.