A secure and optimally efficient multi- authority election scheme

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

Volumn 1233, Issue , 1997, Pages 103-118

  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;

COMMUNICATION COMPLEXITY; ENCRYPTED MESSAGES; MULTI AUTHORITIES; MULTI-AUTHORITY ELECTION SCHEMES; PRIVACY PROTECTION; UNIVERSAL VERIFIABILITY; VOTING SCHEMES;

INFORMATION THEORY;

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

References (36)

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