{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T18:06:08Z","timestamp":1776881168120,"version":"3.51.2"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Cryptology"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1007\/bf02252871","type":"journal-article","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T14:07:40Z","timestamp":1132668460000},"page":"133-138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":210,"title":["How to share a secret with cheaters"],"prefix":"10.1007","volume":"1","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":"BF02252871_CR1","doi-asserted-by":"crossref","unstructured":"L. M. Adleman and M.-D. A. Huang, Recognizing primes in random polynomial time,Proc. 19th Annual ACM Symp. Theory Comput., pp. 462\u2013469, May 1987.","DOI":"10.1145\/28395.28445"},{"key":"BF02252871_CR2","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974."},{"key":"BF02252871_CR3","series-title":"Lecture Notes in Computer Science","first-page":"251","volume-title":"Secret sharing homomorphisms: keeping shares of a secret secret,Advances in Cryptology\u2014CRYPTO '86","author":"J. C. Benaloh","year":"1987","unstructured":"J. C. Benaloh, Secret sharing homomorphisms: keeping shares of a secret secret,Advances in Cryptology\u2014CRYPTO '86, pp. 251\u2013260, Lecture Notes in Computer Science, vol. 263, Springer-Verlag, Berlin, 1987."},{"key":"BF02252871_CR4","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 Symp. Found. Comp. Sci., pp. 383\u2013395, October 1985.","DOI":"10.1109\/SFCS.1985.64"},{"key":"BF02252871_CR5","doi-asserted-by":"crossref","unstructured":"P. Feldman, A practical scheme for noninteractive verifiable secret sharing,Proc. 28th Symp. Found. Comp. Sci., pp. 427\u2013437, October 1987.","DOI":"10.1109\/SFCS.1987.4"},{"key":"BF02252871_CR6","series-title":"Lecture Notes in Computer Science","first-page":"171","volume-title":"How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design,Advances in Cryptology\u2014CRYPTO '86","author":"O. Goldreich","year":"1987","unstructured":"O. Goldreich, S. Micali, and A. Wigderson, How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design,Advances in Cryptology\u2014CRYPTO '86, pp. 171\u2013185, Lecture Notes in Computer Science, vol. 263, Springer-Verlag, Berlin, 1987."},{"key":"BF02252871_CR7","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, and R. L. Rivest, A \u201cparadoxical\u201d solution to the signature problem,Proc. 25th Symp. Found. Comp. Sci., pp. 441\u2013448, October 1984.","DOI":"10.1109\/SFCS.1984.715946"},{"key":"BF02252871_CR8","volume-title":"Elements of Algebra and Algebraic Computing","author":"J.D. Lipson","year":"1981","unstructured":"J.D. Lipson,Elements of Algebra and Algebraic Computing, Addison-Wesley, Reading, MA, 1981."},{"key":"BF02252871_CR9","doi-asserted-by":"crossref","unstructured":"M. O. Rabin, Randomized Byzantine generals,Proc. 24th Symp. Found. Comp. Sci., pp. 403\u2013409, November 1983.","DOI":"10.1109\/SFCS.1983.48"},{"issue":"11","key":"BF02252871_CR10","doi-asserted-by":"crossref","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":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02252871.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02252871\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02252871","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02252871.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:36:22Z","timestamp":1586334982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02252871"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["BF02252871"],"URL":"https:\/\/doi.org\/10.1007\/bf02252871","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,10]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}