{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T16:06:56Z","timestamp":1772726816440,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540629757","type":"print"},{"value":"9783540690535","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-69053-0_9","type":"book-chapter","created":{"date-parts":[[2007,8,5]],"date-time":"2007-08-05T21:24:05Z","timestamp":1186349045000},"page":"103-118","source":"Crossref","is-referenced-by-count":281,"title":["A Secure and Optimally Efficient Multi-Authority Election Scheme"],"prefix":"10.1007","author":[{"given":"Ronald","family":"Cramer","sequence":"first","affiliation":[]},{"given":"Rosario","family":"Gennaro","sequence":"additional","affiliation":[]},{"given":"Berry","family":"Schoenmakers","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"9_CR1","volume-title":"Verifiable Secret-Ballot Elections","author":"J. Benaloh","year":"1987","unstructured":"J. Benaloh. Verifiable Secret-Ballot Elections. PhD thesis, Yale University, Department of Computer Science Department, New Haven, CT, September 1987."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"J. Benaloh and D. Tuinstra. Receipt-free secret-ballot elections. In Proc. 26th Symposium on Theory of Computing (STOC\u2019 94), pages 544\u2013553, New York, 1994. A.C.M.","DOI":"10.1145\/195058.195407"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"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\u2019 86), pages 52\u201362, New York, 1986. A.C.M.","DOI":"10.1145\/10590.10595"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"R. Canetti, C. Dwork, M. Naor, and R. Ostrovsky. Deniable encryption, 1996. Manuscript.","DOI":"10.1007\/BFb0052229"},{"key":"9_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 94","author":"R. Cramer","year":"1994","unstructured":"R. Cramer, I. Damg\u00e5rd, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Advances in Cryptology\u2014CRYPTO\u2019 94, volume 839 of Lecture Notes in Computer Science, pages 174\u2013187, Berlin, 1994. Springer-Verlag."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"J. Cohen and M. Fischer. A robust and verifiable cryptographically secure election scheme. In Proc. 26th IEEE Symposium on Foundations of Computer Science (FOCS\u2019 85), pages 372\u2013382. IEEE Computer Society, 1985.","DOI":"10.1109\/SFCS.1985.2"},{"key":"9_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-68339-9_7","volume-title":"Advances in Cryptology \u2014EUROCRYPT\u2019 96","author":"R. Cramer","year":"1996","unstructured":"R. Cramer, M. Franklin, B. Schoenmakers, and M. Yung. Multi-authority secret ballot elections with linear work. In Advances in Cryptology \u2014EUROCRYPT\u2019 96, volume 1070 of Lecture Notes in Computer Science, pages 72\u201383, Berlin, 1996. Springer-Verlag."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"R. Canetti and R. Gennaro. Incoercible multiparty computation. In 37th IEEE Symposium on Foundations of Computer Science (FOCS\u2019 96), 1996. To appear.","DOI":"10.1109\/SFCS.1996.548509"},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84\u201388, 1981.","journal-title":"Communications of the ACM"},{"key":"9_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/3-540-46877-3_41","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u2019 90","author":"D. Chaum","year":"1991","unstructured":"D. Chaum. Zero-knowledge undeniable signatures. In Damg\u00e5rd, editor, Advances in Cryptology\u2014EUROCRYPT\u2019 90, volume 473 of Lecture Notes in Computer Science, pages 458\u2013464, Berlin, 1991. Springer-Verlag."},{"key":"9_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 92","author":"D. Chaum","year":"1993","unstructured":"D. Chaum and T. P. Pedersen. Wallet databases with observers. In Advances in Cryptology\u2014CRYPTO\u2019 92, volume 740 of Lecture Notes in Computer Science, pages 89\u2013105, Berlin, 1993. Springer-Verlag."},{"key":"9_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BFb0053433","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u2019 94","author":"L. Chen","year":"1995","unstructured":"L. Chen and T. P. Pedersen. New group signature schemes. In Advances in Cryptology\u2014EUROCRYPT\u2019 94, volume 950 of Lecture Notes in Computer Science, pages 171\u2013181, Berlin, 1995. Springer-Verlag."},{"issue":"4","key":"9_CR13","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1002\/ett.4460050407","volume":"5","author":"Y. Desmedt","year":"1994","unstructured":"Y. Desmedt. Threshold cryptography. European Transactions on Telecommunications, 5(4):449\u2013457, 1994.","journal-title":"European Transactions on Telecommunications"},{"issue":"6","key":"9_CR14","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22(6):644\u2013654, 1976.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"9_CR15","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"IT-31","author":"T. ElGamal","year":"1985","unstructured":"T. ElGamal. A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, IT-31(4):469\u2013472, 1985.","journal-title":"IEEE Transactions on Information Theory"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Y. Frankel, P. Gemmell, P. McKenzie, and M. Yung. Proactive RSA, 1996. Manuscript.","DOI":"10.1007\/BFb0052254"},{"key":"9_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 86","author":"A. Fiat","year":"1987","unstructured":"A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology\u2014CRYPTO\u2019 86, volume 263 of Lecture Notes in Computer Science, pages 186\u2013194, New York, 1987. Springer-Verlag."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"R. Gennaro. Achieving independence efficiently and securely. In Proc. 14th ACM Symposium on Principles of Distributed Computing (PODC\u2019 95), New York, 1995. A.C.M.","DOI":"10.1145\/224964.224979"},{"key":"9_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/3-540-68697-5_13","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 96","author":"R. Gennaro","year":"1996","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust and efficient sharing of RSA functions. In Advances in Cryptology\u2014CRYPTO\u2019 96, volume 1109 of Lecture Notes in Computer Science, pages 157\u2013172, Berlin, 1996. Springer-Verlag."},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/266420.266442"},{"key":"9_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/3-540-44750-4_27","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 95","author":"A. Herzberg","year":"1995","unstructured":"A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung. Proactive secret sharing, or: How to cope with perpetual leakage. In Advances in Cryptology\u2014CRYPTO\u2019 95, volume 963 of Lecture Notes in Computer Science, pages 339\u2013352, Berlin, 1995. Springer-Verlag."},{"key":"9_CR22","first-page":"673","volume-title":"Handbook of Theoretical Computer Science","author":"A. K. Lenstra","year":"1990","unstructured":"A. K. Lenstra and H. W. Lenstra, Jr. Algorithms in number theory. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 673\u2013715. Elsevier Science Publishers B.V., Amsterdam, 1990."},{"key":"9_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BFb0034841","volume-title":"Advances in Cryptology \u2014 ASIACRYPT\u2019 94","author":"M. Michels","year":"1996","unstructured":"M. Michels and P. Horster. Some remarks on a receipt-free and universally verifiable mix-type voting scheme. In Advances in Cryptology \u2014 ASIACRYPT\u2019 94, volume 1163 of Lecture Notes in Computer Science, pages 125\u2013132, Berlin, 1996. Springer-Verlag."},{"key":"9_CR24","series-title":"Lect Notes Comput Sci","first-page":"141","volume-title":"Advances in Cryptology\u2014ASIACRYPT\u2019 94","author":"V. Niemi","year":"1994","unstructured":"V. Niemi and A. Renvall. How to prevent buying of votes in computer elections. In Advances in Cryptology\u2014ASIACRYPT\u2019 94, volume 739 of Lecture Notes in Computer Science, pages 141\u2013148, Berlin, 1994. Springer-Verlag."},{"key":"9_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1007\/3-540-46416-6_47","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u2019 91","author":"T. Pedersen","year":"1991","unstructured":"T. Pedersen. A threshold cryptosystem without a trusted party. In Advances in Cryptology\u2014EUROCRYPT\u2019 91, volume 547 of Lecture Notes in Computer Science, pages 522\u2013526, Berlin, 1991. Springer-Verlag."},{"key":"9_CR26","volume-title":"Distributed Provers and Verifiable Secret Sharing Based on the Discrete Logarithm Problem","author":"T. P. Pedersen","year":"1992","unstructured":"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."},{"key":"9_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/BFb0053448","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u2019 94","author":"B. Pfitzmann","year":"1995","unstructured":"B. Pfitzmann. Breaking an efficient anonymous channel. In Advances in Cryptology\u2014EUROCRYPT\u2019 94, volume 950 of Lecture Notes in Computer Science, pages 332\u2013340, Berlin, 1995. Springer-Verlag."},{"key":"9_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-48285-7_21","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u2019 93","author":"C. Park","year":"1994","unstructured":"C. Park, K. Itoh, and K. Kurosawa. Efficient anonymous channel and all\/nothing election scheme. In Advances in Cryptology\u2014EUROCRYPT\u2019 93, volume 765 of Lecture Notes in Computer Science, pages 248\u2013259, Berlin, 1994. Springer-Verlag."},{"key":"9_CR29","unstructured":"B. Pfitzmann and M. Waidner. Unconditionally untraceable and faulttolerant broadcast and secret ballot election. Hildesheimer informatikberichte, Institut f\u00fcr Informatik, May 1992."},{"issue":"2","key":"9_CR30","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/0022-0000(83)90042-9","volume":"27","author":"M. Rabin","year":"1983","unstructured":"M. Rabin. Transaction protection by beacons. Journal of Computer and System Sciences, 27(2):256\u2013267, 1983.","journal-title":"Journal of Computer and System Sciences"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"M. Reiter. Secure agreement protocols: Reliable and atomic group multicast in Rampart. 2nd ACM Conference on Computer and Communications Security, Fairfax, November 1994.","DOI":"10.1145\/191177.191194"},{"key":"9_CR32","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/3-540-60042-6_7","volume-title":"Theory and Practice in Distributed Systems","author":"M. Reiter","year":"1995","unstructured":"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\u2013110, Berlin, 1995. Springer-Verlag."},{"issue":"3","key":"9_CR33","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C. P. Schnorr","year":"1991","unstructured":"C. P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4(3):161\u2013174, 1991.","journal-title":"Journal of Cryptology"},{"issue":"11","key":"9_CR34","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir. How to share a secret. Communications of the ACM, 22(11):612\u2013613, 1979.","journal-title":"Communications of the ACM"},{"key":"9_CR35","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/3-540-48658-5_37","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 94","author":"K. Sako","year":"1994","unstructured":"K. Sako and J. Kilian. Secure voting using partially compatible homomorphisms. In Advances in Cryptology\u2014CRYPTO\u2019 94, volume 839 of Lecture Notes in Computer Science, pages 411\u2013424, Berlin, 1994. Springer-Verlag."},{"key":"9_CR36","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/3-540-49264-X_32","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u2019 95","author":"K. Sako","year":"1995","unstructured":"K. Sako and J. Kilian. Receipt-free mix-type voting scheme\u2014a practical solution to the implementation of a voting booth. In Advances in Cryptology\u2014EUROCRYPT\u2019 95, volume 921 of Lecture Notes in Computer Science, pages 393\u2013403, Berlin, 1995. Springer-Verlag."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69053-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T15:31:51Z","timestamp":1556724711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69053-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540629757","9783540690535"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/3-540-69053-0_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1997]]}}}