{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T05:18:21Z","timestamp":1736227101192,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540607595"},{"type":"electronic","value":"9783540493631"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0032351","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:40:51Z","timestamp":1134283251000},"page":"115-124","source":"Crossref","is-referenced-by-count":3,"title":["How to fairly reconstruct a shared secret"],"prefix":"10.1007","author":[{"given":"Jingmin","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ed","family":"Dawson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,28]]},"reference":[{"key":"9_CR1","unstructured":"D.Beaver and S.Goldwasser, Multiparty computation with faulty majority, FOCS89, pp.468\u2013473."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"J.C.Benaloh and J.Leichter, Generalized secret sharing and monotone functions, CRYPTO'88, pp.27\u201335.","DOI":"10.1007\/0-387-34799-2_3"},{"key":"9_CR3","first-page":"313","volume":"48","author":"G.R. Blakley","year":"1979","unstructured":"G.R.Blakley, Safeguarding cryptographic keys, Proc. AFIPS 1979 Natl. Computer Conf., vol. 48, 1979, pp 313\u2013317.","journal-title":"Proc. AFIPS 1979 Natl. Computer Conf."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"E.F.Brickell and D.R.Stinson, The detection of cheaters in threshold schemes, Crypto'88, pp 564\u2013577.","DOI":"10.1007\/0-387-34799-2_40"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"D.Chaum, I.Damgard and J.van de Graaf, Multiparty computations ensuring privacy of each party's input and correctness of the result, CRYPTO'87, pp.87\u2013119.","DOI":"10.1007\/3-540-48184-2_7"},{"key":"9_CR6","unstructured":"B.Chor, S.Goldwasser, S.Micali and B.Awerbuch, Verifiable secret sharing and achieving simultaneity in the presence of faults, FOCS 85, pp 383\u2013395."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"S.Goldwasser and L.Levin, Fair computation of general functions in presence of immoral majority, CRYPTO' 90, pp.77\u201393.","DOI":"10.1007\/3-540-38424-3_6"},{"key":"9_CR8","unstructured":"M.Ito, A.Saito and T.Nishizeki, Secret sharing scheme realizing general access structure, Proc. IEEE Global Telecommunications Conf., Globecom 87, Tokyo, Japan, 1987, pp.99\u2013102."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"M.Luby, S.Micali and C.Rackoff, How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin, FOCS 83, pp 11\u201321.","DOI":"10.1109\/SFCS.1983.25"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"T.Rabin and M.Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority, STOC 89, pp 73\u201385.","DOI":"10.1145\/73007.73014"},{"key":"9_CR11","volume-title":"Probability Theory","author":"A. Renyi","year":"1970","unstructured":"A.Renyi, Probability Theory, North-Holland Publishing Company, Amsterdam, 1970."},{"issue":"no.11","key":"9_CR12","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, CACM, vol. 22, no.11, 1979, pp 612\u2013613.","journal-title":"CACM"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"T.Tedrick, How to exchange half a bit, Crypto'83, pp 147\u2013151.","DOI":"10.1007\/978-1-4684-4730-9_13"},{"key":"9_CR14","unstructured":"T.Tedrick, Fair exchange of secrets, Crypto'84, pp 434\u2013438."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"M.Tompa and H.Woll, How to share a secret with cheaters, Crypto'86, pp 133\u2013138.","DOI":"10.1007\/BF02252871"},{"key":"9_CR16","unstructured":"U.Vazirani and V.Vazirani, Trapdoor pseudo-random number generators with applications to protocol design, FOCS 83, pp.23\u201330."},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"A.Yao, How to generate and exchange secrets, FOCS 86, pp.162\u2013167.","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Cryptography: Policy and Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0032351","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T12:09:31Z","timestamp":1736165371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032351"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540607595","9783540493631"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0032351","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}