{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:00:48Z","timestamp":1725494448001},"publisher-location":"New York, NY","reference-count":10,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9780387973173"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-387-34805-0_51","type":"book-chapter","created":{"date-parts":[[2007,11,9]],"date-time":"2007-11-09T02:05:53Z","timestamp":1194573953000},"page":"589-590","source":"Crossref","is-referenced-by-count":14,"title":["Multiparty Computation with Faulty Majority"],"prefix":"10.1007","author":[{"given":"Donald","family":"Beaver","sequence":"first","affiliation":[]},{"given":"Shaft","family":"Goldwasser","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"51_CR1","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson. \u201cCompleteness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation.\u201d Proc. of 20th STOC (1988), 1\u201310.","DOI":"10.1145\/62212.62213"},{"key":"51_CR2","unstructured":"M. Ben-Or, T. Rabin. \u201cVerifiable Secret Sharing and Multiparty Protocols with Honest Majority.\u201d Proc. of 21st STOC (1989)."},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, I. Damg\u00e5rd. \u201cMultiparty Unconditionally Secure Protocols.\u201d Proc. of 20th STOC (1988), 11\u201319.","DOI":"10.1145\/62212.62214"},{"key":"51_CR4","unstructured":"D. Chaum. \u201cMulti Party Protocols with Disruptors and Colluders.\u201d CRYPTO88 Rump Session."},{"key":"51_CR5","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., A. Wigderson. \u201cHow to Play Any Mental Game, or A Completeness Theorem for Protocols with Honest Majority.\u201d Proc. of 19th STOC (1987), 218\u2013229.","DOI":"10.1145\/28395.28420"},{"key":"51_CR6","doi-asserted-by":"crossref","unstructured":"Z. Galil, S. Haber, M. Yung. \u201cCryptographic Computation: Secure Faulty-Tolerant Protocols and the Public Key Model.\u201d Proc. of CRYPTO 1989.","DOI":"10.1007\/3-540-48184-2_10"},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"J. Kilian. \u201cFounding Cryptography on Oblivious Transfer.\u201d Proc. of 20th STOC (1988), 20\u201329.","DOI":"10.1145\/62212.62215"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"M. Luby, S. Micali, C. Rackoff. \u201cHow to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically Biased Coin.\u201d Proc. of 24th FOCS (1983).","DOI":"10.1109\/SFCS.1983.25"},{"key":"51_CR9","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir. \u201c","year":"1979","unstructured":"A. Shamir. \u201cHow to Share a Secret.\u201d CACM 22 (1979), 612\u2013613.","journal-title":"CACM"},{"key":"51_CR10","doi-asserted-by":"crossref","unstructured":"A. Yao. \u201cHow to Generate and Exchange Secrets.\u201d Proc. of 27th FOCS (1986), 162\u2013167.","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-34805-0_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:28:29Z","timestamp":1619501309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-34805-0_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387973173"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/0-387-34805-0_51","relation":{},"subject":[]}}