{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T22:33:20Z","timestamp":1775774000896,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540663478","type":"print"},{"value":"9783540484059","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48405-1_10","type":"book-chapter","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T10:24:36Z","timestamp":1178015076000},"page":"148-164","source":"Crossref","is-referenced-by-count":266,"title":["A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic Voting"],"prefix":"10.1007","author":[{"given":"Berry","family":"Schoenmakers","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,12,16]]},"reference":[{"key":"10_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-47721-7_19","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 86","author":"J. Benaloh","year":"1987","unstructured":"J. Benaloh. Secret sharing homomorphisms: Keeping shares of a secret secret. In Advances in Cryptology\u2014CRYPTO\u2019 86, volume 263 of Lecture Notes in Computer Science, pages 251\u2013260, Berlin, 1987. Springer-Verlag."},{"key":"10_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":"10_CR3","first-page":"313","volume":"48","author":"G.R. Blakley","year":"1979","unstructured":"G.R. Blakley. Safeguarding cryptographic keys. In Proceedings of the National Computer Conference 1979, volume 48 of AFIPS Conference Proceedings, pages 313\u2013317, 1979.","journal-title":"Proceedings of the National Computer Conference 1979"},{"key":"10_CR4","first-page":"105","volume":"9","author":"E. F. Brickell","year":"1989","unstructured":"E. F. Brickell. Some ideal secret sharing schemes. Journal of Combinatorial Mathematics and Combinatorial Computing, 9:105\u2013113, 1989.","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"10_CR5","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":"10_CR6","doi-asserted-by":"crossref","unstructured":"R. Cramer, I. Damg\u00e5rd, and U. Maurer. General secure multi-party computation from any linear secret sharing scheme, 1999. Manuscript.","DOI":"10.1007\/3-540-45539-6_22"},{"key":"10_CR7","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":"10_CR8","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":"10_CR9","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 \u2014 EUROCRYPT\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 \u2014 EUROCRYPT\u2019 96, volume 1070 of Lecture Notes in Computer Science, pages 72\u201383, Berlin, 1996. Springer-Verlag."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults. In Proc. 26th IEEE Symposium on Foundations of Computer Science (FOCS\u2019 85), pages 383\u2013395. IEEE Computer Society, 1985.","DOI":"10.1109\/SFCS.1985.64"},{"key":"10_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-69053-0_9","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 97","author":"R. Cramer","year":"1997","unstructured":"R. Cramer, R. Gennaro, and B. Schoenmakers. A secure and optimally efficient multi-authority election scheme. In Advances in Cryptology \u2014 EUROCRYPT\u2019 97, volume 1233 of Lecture Notes in Computer Science, pages 103\u2013118, Berlin, 1997. Springer-Verlag."},{"key":"10_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/3-540-61770-1_26","volume-title":"Computer Security-ESORICS 96","author":"J. Camenisch","year":"1996","unstructured":"J. Camenisch, U. Maurer, and M. Stadler. Digital payment systems with passive anonymity-revoking trustees. In Computer Security-ESORICS 96, volume 1146 of Lecture Notes in Computer Science, pages 33\u201343, Berlin, 1996. Springer-Verlag."},{"key":"10_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/3-540-47555-9_32","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u2019 92","author":"D. Chaum","year":"1993","unstructured":"D. Chaum and T. P. Pedersen. Transferred cash grows in size. In Advances in Cryptology\u2014EUROCRYPT\u2019 92, volume 658 of Lecture Notes in Computer Science, pages 390\u2013407, Berlin, 1993. Springer-Verlag."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"P. Feldman. A practical scheme for non-interactive verifiable secret sharing. In Proc. 28th IEEE Symposium on Foundations of Computer Science (FOCS\u2019 87), pages 427\u2013437. IEEE Computer Society, 1987.","DOI":"10.1109\/SFCS.1987.4"},{"key":"10_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0054115","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u2019 98","author":"E. Fujisaki","year":"1998","unstructured":"E. Fujisaki and T. Okamoto. A practical and provably secure scheme for publicly verifiable secret sharing and its applications. In Advances in Cryptology\u2014EUROCRYPT\u2019 98, volume 1403 of Lecture Notes in Computer Science, pages 32\u201346, Berlin, 1998. Springer-Verlag."},{"key":"10_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/BFb0034855","volume-title":"Advances in Cryptology\u2014ASIACRYPT\u2019 96","author":"Y. Frankel","year":"1996","unstructured":"Y. Frankel, Y. Tsiounis, and M. Yung. \u201cIndirect discourse proofs\u201d: Achieving efficient fair off-line e-cash. In Advances in Cryptology ASIACRYPT\u2019 96, volume 1163 of Lecture Notes in Computer Science, pages 286\u2013300, Berlin, 1996. Springer-Verlag."},{"key":"10_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/3-540-48910-X_21","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u2019 99","author":"R. Gennaro","year":"1999","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Secure distributed key generation for discrete-log based cryptosystems. In Advances in Cryptology\u2014EUROCRYPT\u2019 99, volume 1592 of Lecture Notes in Computer Science, pages 295\u2013310, Berlin, 1999. Springer-Verlag."},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"M. Karchmer and A. Wigderson. On span programs. In Proceedings of the Eighth Annual Structure in Complexity Theory Conference, pages 102\u2013111. IEEE Computer Society Press, 1993.","DOI":"10.1109\/SCT.1993.336536"},{"key":"10_CR19","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":"10_CR20","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":"10_CR21","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":"1","key":"10_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/280559.280563","volume":"32","author":"B. Pfitzmann","year":"1998","unstructured":"B. Pfitzmann and M. Waidner. How to break fraud-detectable key recovery. Operating Systems Review, 32(1):23\u201328, 1998.","journal-title":"Operating Systems Review"},{"issue":"11","key":"10_CR23","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":"10_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/3-540-68339-9_17","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 96","author":"M. Stadler","year":"1996","unstructured":"M. Stadler. Publicly verifiable secret sharing. In Advances in Cryptology \u2014 EUROCRYPT\u2019 96, volume 1070 of Lecture Notes in Computer Science, pages 190\u2013199, Berlin, 1996. Springer-Verlag."},{"key":"10_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-69053-0_10","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u2019 97","author":"E. Verheul","year":"1997","unstructured":"E. Verheul and H. van Tilborg. Binding ElGamal: A fraud-detectable alternative to key-escrow proposals. In Advances in Cryptology\u2014EUROCRYPT\u2019 97, volume 1233 of Lecture Notes in Computer Science, pages 119\u2013133, Berlin, 1997. Springer-Verlag."},{"key":"10_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BFb0054114","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u2019 98","author":"A. Young","year":"1998","unstructured":"A. Young and M. Yung. Auto-recoverable auto-certifiable cryptosystems. In Advances in Cryptology\u2014EUROCRYPT\u2019 98, volume 1403 of Lecture Notes in Computer Science, pages 17\u201331, Berlin, 1998. Springer-Verlag."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 99"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48405-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T16:35:38Z","timestamp":1556382938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48405-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540663478","9783540484059"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-48405-1_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}