{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T16:11:10Z","timestamp":1778256670299,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540611868","type":"print"},{"value":"9783540683391","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-68339-9_7","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:31:14Z","timestamp":1186363874000},"page":"72-83","source":"Crossref","is-referenced-by-count":137,"title":["Multi-Authority Secret-Ballot Elections with Linear Work"],"prefix":"10.1007","author":[{"given":"Ronald","family":"Cramer","sequence":"first","affiliation":[]},{"given":"Matthew","family":"Franklin","sequence":"additional","affiliation":[]},{"given":"Berry","family":"Schoenmakers","sequence":"additional","affiliation":[]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"7_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-47721-7_15","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 86","author":"J. Benaloh","year":"1987","unstructured":"J. Benaloh. Cryptographic capsules: A disjunctive primitive for interactive protocols. In Advances in Cryptology\u2014CRYPTO\u2019 86, volume 263 of Lecture Notes in Computer Science, pages 213\u2013222, Berlin, 1987. Springer-Verlag."},{"key":"7_CR2","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":"7_CR3","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":"7_CR4","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":"7_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":"7_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"},{"issue":"2","key":"7_CR7","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":"7_CR8","volume-title":"Witness Hiding Proofs and Applications","author":"L. Chen","year":"1994","unstructured":"L. Chen. Witness Hiding Proofs and Applications. PhD thesis, Aarhus University, Computer Science Department, Aarhus, Denmark, August 1994."},{"key":"7_CR9","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."},{"key":"7_CR10","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":"7_CR11","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":"7_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/3-540-45961-8_11","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u2019 88","author":"L. C. Guillou","year":"1988","unstructured":"L. C. Guillou and J.-J. Quisquater. A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. In Advances in Cryptology\u2014EUROCRYPT\u2019 88, volume 330 of Lecture Notes in Computer Science, pages 123\u2013128, Berlin, 1988. Springer-Verlag."},{"key":"7_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-48071-4_3","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 92","author":"T. Okamoto","year":"1993","unstructured":"T. Okamoto. Provably secure and practical identification schemes and corresponding signature schemes. In Advances in Cryptology\u2014CRYPTO\u2019 92, volume 740 of Lecture Notes in Computer Science, pages 31\u201353, Berlin, 1993. Springer-Verlag."},{"key":"7_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 91","author":"T. P. Pedersen","year":"1992","unstructured":"T. P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Advances in Cryptology\u2014CRYPTO\u2019 91, volume 576 of Lecture Notes in Computer Science, pages 129\u2013140, Berlin, 1992. Springer-Verlag."},{"issue":"3","key":"7_CR15","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"},{"key":"7_CR16","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":"7_CR17","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 \u201996"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68339-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:32:56Z","timestamp":1556739176000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68339-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540611868","9783540683391"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-68339-9_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1996]]}}}