{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:01:06Z","timestamp":1777964466106,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540551881","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-46766-1_9","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T11:03:27Z","timestamp":1186830207000},"page":"129-140","source":"Crossref","is-referenced-by-count":1312,"title":["Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing"],"prefix":"10.1007","author":[{"given":"Torben Pryds","family":"Pedersen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum, and C. Cr\u00e9peau. Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences, 37:156\u2013189, 1988.","journal-title":"Journal of Computer and System Sciences"},{"key":"9_CR2","unstructured":"J. Bos, D. Chaum, and G. Purdy. A voting scheme. Preliminary draft."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"E. F. Brickell and D. M. Davenport. On the classification of ideal secret sharing schemes. In Advances in Cryptology-proceedings of CRYPTO 89, pages 278\u2013285, 1990.","DOI":"10.1007\/0-387-34805-0_25"},{"key":"9_CR4","series-title":"Lect Notes Comput Sci","first-page":"251","volume-title":"Advances in Cryptology-proceedings of CRYPTO 86","author":"J. C. Benaloh","year":"1987","unstructured":"J. C. Benaloh. Secret sharing homomorphisms: Keeping shares of a secret secret. In Advances in Cryptology-proceedings of CRYPTO 86, Lecture Notes in Computer Science, pages 251\u2013260. Springer-Verlag, 1987."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"G. R. Blakley. Safeguarding cryptographic keys. In Proceedings AFIPS 1979 Nat. Computer Conf., pages 313\u2013319, 1979.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal of Computation, 13:850\u2013864, 1984.","journal-title":"SIAM Journal of Computation"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Widgerson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 1\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, and I. Damg\u00e5rd. Multiparty unconditionally secure protocols. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 11\u201319, 1988.","DOI":"10.1145\/62212.62214"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"P. Feldman. A practical scheme for non-interactive verifiable secret sharing. In Proceedings of the 28th IEEE Symposium on the Foundations of Computer Science, pages 427\u2013437, 1987.","DOI":"10.1109\/SFCS.1987.4"},{"key":"9_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/3-540-46877-3_24","volume-title":"Advances in Cryptology \u2014 proceedings of EUROCRYPT 90","author":"I. Ingemarsson","year":"1991","unstructured":"I. Ingemarsson and G. J. Simmons. A protocol to set up shared secret schemes without the assistance of a mutually trusted party. In Advances in Cryptology \u2014 proceedings of EUROCRYPT 90, Lecture Notes in Computer Science, pages 266\u2013282. Springer-Verlag, 1991."},{"key":"9_CR11","unstructured":"T. P. Pedersen. Distributed provers with applications to undeniable signatures, 1991. To appear in the proceedings of Eurocrypt\u201991."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proceedings of the 21st Annual ACM Symposium on the Theory of Computing, pages 73\u201385, 1989.","DOI":"10.1145\/73007.73014"},{"key":"9_CR13","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:612\u2013613, 1979.","journal-title":"Communications of the ACM"},{"key":"9_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/0-387-34799-2_30","volume-title":"Advances in Cryptology-proceedings of CRYPTO 88","author":"G. J. Simmons","year":"1990","unstructured":"G. J. Simmons. How to (really) share a secret. In Advances in Cryptology-proceedings of CRYPTO 88, Lecture Notes in Computer Science, pages 390\u2013448. Springer-Verlag, 1990."},{"issue":"147","key":"9_CR15","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.2307\/2006082","volume":"33","author":"S. S. Wagstaff Jr.","year":"1979","unstructured":"S. S. Wagstaff Jr. Greatest of the least primes in arithmetic progression having a given modulus. Mathematics of Computation, 33(147):1073\u20131080, July 1979.","journal-title":"Mathematics of Computation"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201991"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46766-1_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:13:37Z","timestamp":1605629617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46766-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540551881"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-46766-1_9","relation":{},"subject":[]}}