A Secure and Optimally Efficient Multi-Authority Election Scheme

European Transactions on Telecommunications

Volumn 8, Issue 5, 1997, Pages 481-490

  Cramer, Ronald ^a   Gennaro, Rosario ^b   Schoenmakers, Berry ^c  

^a ETH ZURICH   (Switzerland)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c DigiCash   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; MATHEMATICAL MODELS;

MULTI AUTHORITY ELECTION SCHEME;

SECURITY OF DATA;

EID: 0031221506     PISSN: 1124318X     EISSN: None     Source Type: Journal    
DOI: 10.1002/ett.4460080506     Document Type: Article

References (38)

1. J. Cohen, M. Fischer: A robust and verifiable cryptographically secure election scheme. In Proc. 26-th IEEE Symposium on Foundations of Computer Science (FOCS '85). IEEE Computer Society, 1985, p. 372-382.
2. J. Benaloh, M. Yung: Distributing the power of a government to enhance the privacy of voters. In Proc. 5-th ACM Symposium on Principles of Distributed Computing (PODC '86), New York, 1986. A.C.M., p. 52-62.
3. J. Benaloh: Verifiable secret-ballot elections. PhD thesis, Yale University, Department of Computer Science Department, New Haven, CT, September 1987.
4. J. Benaloh, D. Tuinstra: Receipt-free secret-ballot elections. In Proc. 26-th Symposium on Theory of Computing (STOC '94), New York, 1994. A.C.M., p. 544-553.
5. D. Chaum: Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, Vol. 24, No. 2, 1981, p. 84-88.
6. K. Sako, J. Kilian: Receipt-free mix-type voting scheme-a practical solution to the implementation of a voting booth. In Advances in Cryptology-EUROCRYPT '95, Vol. 921 of Lecture Notes in Computer Science, Berlin. Springer-Verlag, 1995, p. 393-403.
7. B. Pfitzmann, M. Waidner: Unconditionally untraceable and fault-tolerant broadcast and secret ballot election. Hildesheimer informatik-berichte, Institut für Informatik. May 1992.
8. R. Cramer, M. Franklin, B. Schoenmakers, M. Yung: Multi-authority secret ballot elections with linear work. In Advances in Cryptology EUROCRYPT '96 of Lecture Notes in Computer Science, Berlin, Springer-Verlag, Vol. 1070, 1996, p. 72-83.
9. R. Cramer, I. Damgård, B. Schoenmakers: Proofs of partial knowledge and simplified design of witness hiding protocols. In Advances in Cryptology-CRYPTO '94 of Lecture Notes in Computer Science, Berlin, Springer-Verlag, Vol. 839, 1994, p. 174-187.
10. L. Chen, T.P. Pedersen: New group signature schemes. In Advances in Cryptology EUROCRYPT '94 of Lecture Notes in Computer Science, Berlin, Springer-Verlag, Vol. 950, 1995, p. 171-181.
11. Y. Desmedt: Threshold cryptography. "European Transactions on Telecommunications", Vol. 5, No. 4, 1994, p. 449-457.
12. A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, M. Yung: Proactive public-key and signature schemes, 1995. Manuscript.
13. V. Niemi, A. Renvall: How to prevent buying of votes in computer elections. In Advances in Cryptology-ASIACRYPT '94of Lecture Notes in Computer Science, Berlin, Springer-Verlag, Vol. 739, 1994, p. 141-148.
14. R. Canetti, R. Gennaro: Incoercible multiparty computation. In 37-th IEEE Symposium on Foundations of Computer Science (FOCS' 96), 1996. To appear.
15. M. Reiter: Secure agreement protocols: Reliable and atomic group multicast in Rampart. 2-nd ACM Conference on Computer and Communications Security, Fairfax, November 1994.
16. M. Reiter: The Rampart toolkit for building high-integrity services. In Theory and Practice in Distributed Systems of Lecture Notes in Computer Science, Berlin, Springer-Verlag, Vol. 938, 1995, p. 99-110.
17. W. Diffie, M.E. Hellman: New directions in cryptography. "IEEE Transactions on Information Theory", Vol. 22, No. 6, 1976, p. 644-654.
18. T. ElGamal: A public-key cryptosystem and a signature scheme based on discrete logarithms. "IEEE Transactions on Information Theory", Vol. IT-31, No. 4, 1985, p. 469-472.
19. T. Pedersen: A threshold cryptosystem without a trusted party. In Advances in Cryptology-EUROCRYPT '91 of Lecture Notes in Computer Science6, Berlin, Springer-Verlag, Vol. 547, 1991, p. 522-52.
20. T. P. Pedersen: Distributed Provers and Verifiable Secret Sharing Based on the Discrete Logarithm Problem. PhD thesis, Aarhus University, Computer Science Department, Aarhus, Denmark, March 1992.
21. A. Shamir: How to share a secret. "Communications of the ACM", Vol. 22, No. 11, 1979, p. 612-613.
22. D. Chaum, T. P. Pedersen: Wallet databases with observers. In Advances in Cryptology-CRYPTO '92 of Lecture Notes in Computer Science, Berlin, Springer-Verlag, Vol. 740, 1993, p. 89-105.
23. C. P. Schnorr: Efficient signature generation by smart cards. "Journal of Cryptology", Vol. 4, No. 3, 1991, p. 161-174.
24. M. Rabin: Transaction protection by beacons. "Journal of Computer and System Sciences", Vol. 27, No. 2, 1983, p. 256-267.
25. A. Fiat, A. Shamir: How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology-CRYPTO '86 of Lecture Notes in Computer Science, New York, Springer-Verlag, Vol. 263, 1987, p. 186-194.
26. D. Chaum, J.-H. Evertse, J. van de Graaf: An improved protocol for demonstrating possession of a discrete logarithm and some generalizations. In Advances in Cryptology-EUROCRYPT '87 of Lecture Notes in Computer Science, Berlin, Springer-Verlag, Vol. 304, 1988, p. 127-141.
27. D. Chaum: Zero-knowledge undeniable signatures. In: (Damgård, Editor), Advances in Cryptology-EUROCRYPT '90 of Lecture Notes in Computer Science, Berlin, Springer-Verlag, Vol. 473, 1991, p. 458-464.
28. J. Boyar, D. Chaum, I. Damgård, T. Pedersen: Convertible undeniable signatures. In Advances in Cryptology-CRYPTO '90 of Lecture Notes in Computer Science, Berlin, Springer-Verlag, Vol. 537, 1991, p. 189-205.
29. K. Sako, J. Kilian: Secure voting using partially compatible homomorphisms. In Advances in Cryptology-CRYPTO '94 of Lecture Notes in Computer Science, Berlin, Springer-Verlag, Vol. 839, 1994, p. 411-424.
30. R. Gennaro: Achieving independence efficiently and securely. In Proc. 14-th ACM Symposium on Principles of Distributed Computing (PODC '95), New York, 1995. A.C.M.
31. A. K. Lenstra, H. W. Lenstra: Jr. Algorithms in number theory. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, p. 673-715. Elsevier Science Publishers B.V., Amsterdam, 1990.
32. R. Gennaro, S. Jarecki, H. Krawczyk, T. Rabin: Robust and efficient sharing of RSA functions. In Advances in Cryptology-CRYPTO '96 of Lecture Notes in Computer Science, Berlin, Springer-Verlag, Vol. 1109, 1996, p. 157-172.
33. R. Canetti, C. Dwork, M. Naor, R. Ostrovsky: Deniable encryption, 1996. Manuscript.
34. A. Herzberg, S. Jarecki, H. Krawczyk, M. Yung: Proactive secret sharing, or: How to cope with perpetual leakage. In Advances in Cryptology-CRYPTO '95 of Lecture Notes in Computer Science, Berlin, Springer-Verlag, Vol. 963, 1995, p. 339-352.
35. Y. Frankel, P. Gemmell, P. McKenzie, M. Yung: Proactive RSA, 1996. Manuscript.
36. C. Park, K. Itoh, K. Kurosawa: Efficient anonymous channel and all/nothing election scheme. In Advances in Cryptology-EUROCRYPT '93 of Lecture Notes in Computer Science, Berlin, Springer-Verlag, Vol. 765, 1994, p. 248-259.
37. B. Pfitzmann: Breaking an efficient anonymous channel. In Advances in Cryptology-EUROCRYPT '94 of Lecture Notes in Computer Science, Berlin, Springer-Verlag, Vol. 950, 1995, p. 332-340.
38. M. Michels, P. Horster: Some remarks on a receipt-free and universally verifiable mix-type voting scheme. In Advances in Cryptology-ASIACRYPT '94 of Lecture Notes in Computer Science, Berlin, Springer-Verlag, Vol. 1163, 1996, p. 125-132.