{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:01Z","timestamp":1772283541922,"version":"3.50.1"},"publisher-location":"New York, NY","reference-count":14,"publisher":"Springer New York","isbn-type":[{"value":"9780387973173","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-387-34805-0_49","type":"book-chapter","created":{"date-parts":[[2007,11,9]],"date-time":"2007-11-09T02:05:53Z","timestamp":1194573953000},"page":"560-572","source":"Crossref","is-referenced-by-count":36,"title":["Multiparty Protocols Tolerating Half Faulty Processors"],"prefix":"10.1007","author":[{"given":"Donald","family":"Beaver","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"crossref","unstructured":"D. Beaver, J. Bar-Han. \u201cNon-Cryptographic Fault-Tolerant Computing in a Constant Expected Number of Rounds of Interaction.\u201d Proc. of 21st STOC (1989), 201\u2013209.","DOI":"10.1145\/72981.72995"},{"key":"49_CR2","unstructured":"D. Beaver. \u201cSecure Multiparty Protocols Tolerating Half Faulty Processors.\u201d Technical Report TR-19-88 (September, 1988), Harvard University."},{"key":"49_CR3","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":"49_CR4","first-page":"79","volume-title":"Proceedings of the 1980 Symposium on Security and Privacy","author":"G. R. Blakley","year":"1981","unstructured":"G. R. Blakley, \u201cSecurity Proofs for Information Protection Systems.\u201d Proceedings of the 1980 Symposium on Security and Privacy, IEEE Computer Society Press, NY (1981), 79\u201388."},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, T. Rabin. \u201cVerifiable Secret Sharing and Multiparty Protocols with Honest Majority.\u201d 21st STOC (1989), 73\u201385.","DOI":"10.1145\/73007.73014"},{"key":"49_CR6","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":"49_CR7","doi-asserted-by":"crossref","unstructured":"B. Chor, S. Goldwasser, S. Micali, B. Awerbuch. \u201cVerifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults.\u201d Proc. of 17th STOC (1985), 383\u2013395.","DOI":"10.1109\/SFCS.1985.64"},{"issue":"1","key":"49_CR8","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, C. Rackoff. \u201cThe Knowledge Complexity of Interactive Proof Systems.\u201d SIAM Journal on Computing 18, no. 1 (1989), 186\u2013208.","journal-title":"SIAM Journal on Computing"},{"key":"49_CR9","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":"49_CR10","unstructured":"J. Kilian, personal communication."},{"key":"49_CR11","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":"49_CR12","unstructured":"T. Rabin. \u201cRobust Sharing of Secrets When the Dealer is Honest or Cheating.\u201d Masters Thesis, Hebrew University, 1988."},{"key":"49_CR13","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":"49_CR14","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_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T05:28:27Z","timestamp":1737523707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-34805-0_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387973173"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/0-387-34805-0_49","relation":{},"subject":[]}}