{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T10:09:55Z","timestamp":1763201395771},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540180470"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-47721-7_20","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T10:32:57Z","timestamp":1175769177000},"page":"261-265","source":"Crossref","is-referenced-by-count":14,"title":["How to Share a Secret with Cheaters"],"prefix":"10.1007","author":[{"given":"Martin","family":"Tompa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heather","family":"Woll","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"A. Aho, J. Hopcroft, and J. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974."},{"key":"20_CR2","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. Proc. 26th IEEE Symp. Found. Comp. Sci., pages 383\u2013395, October 1985.","DOI":"10.1109\/SFCS.1985.64"},{"key":"20_CR3","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design. These Proceedings, 1987."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"S. Goldwasser and J. Killian. Almost all primes can be quickly certified. Proc. 18th Annual ACM Symp. Theory Comput., pages 316\u2013329, May 1986.","DOI":"10.1145\/12130.12162"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, and R. Rivest. A \u2018paradoxical\u2019 solution to the signature problem. Proc. 25th IEEE Symp. Found. Comp. Sci., pages 441\u2013448, October 1984.","DOI":"10.1109\/SFCS.1984.715946"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"M. Rabin. Randomized Byzantine generals. Proc. 24th IEEE Symp. Found. Comp. Sci., pages 403\u2013409, November 1983.","DOI":"10.1109\/SFCS.1983.48"},{"issue":"11","key":"20_CR7","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. Comm. ACM, 22(11):612\u2013613, November 1979.","journal-title":"Comm. ACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 86"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47721-7_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:14:14Z","timestamp":1605647654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47721-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540180470"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-47721-7_20","relation":{},"subject":[]}}