{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:44Z","timestamp":1766281004277,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540545088"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-38424-3_5","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T13:05:56Z","timestamp":1196687156000},"page":"62-76","source":"Crossref","is-referenced-by-count":37,"title":["Security with Low Communication Overhead"],"prefix":"10.1007","author":[{"given":"D.","family":"Beaver","sequence":"first","affiliation":[]},{"given":"J.","family":"Feigenbaum","sequence":"additional","affiliation":[]},{"given":"J.","family":"Kilian","sequence":"additional","affiliation":[]},{"given":"P.","family":"Rogaway","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0022-0000(89)90018-4","volume":"39","author":"M. Abadi","year":"1989","unstructured":"M. Abadi, J. Feigenbaum, and J. Kilian. On Hiding Information from an Oracle, J. Comput. System Sci. 39 (1989), 21\u201350.","journal-title":"J. Comput. System Sci."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"L. Babai, L. Fortnow, and C. Lund. Non-Deterministic Exponential Time has Two-Prover Interactive Proofs, Proc. of FOCS 1990, IEEE.","DOI":"10.1007\/BF01200056"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"J. Bar-Ilan and D. Beaver. Non-Cryptographic Fault-Tolerant Computing in a Constant Number of Rounds, Proc. of PODC 1989, ACM, 201\u2013209.","DOI":"10.1145\/72981.72995"},{"key":"5_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1007\/0-387-34805-0_49","volume-title":"Secure Multiparty Protocols Tolerating Half Faulty Processors","author":"D. Beaver","year":"1990","unstructured":"D. Beaver. Secure Multiparty Protocols Tolerating Half Faulty Processors, to appear in J. Cryptology. Preliminary version in Proc. of CRYPTO 1989, Springer Verlag LNCS 435, 560\u2013572."},{"key":"5_CR5","unstructured":"D. Beaver. Perfect Privacy for Two-Party Protocols, Proc. of DIMACS Workshop on Distributed Computing and Cryptography (Princeton, NJ; October, 1989), AMS, 1990."},{"key":"5_CR6","unstructured":"D. Beaver. Security, Fault-Tolerance, and Communication Complexity for Distributed Systems, PhD Thesis, Harvard University, 1990."},{"key":"5_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-52282-4_30","volume-title":"Proc. of STACS 1990","author":"D. Beaver","year":"1990","unstructured":"D. Beaver and J. Feigenbaum. Hiding Instances in Multioracle Queries, Proc. of STACS 1990, Springer Verlag LNCS 415, 37\u201348."},{"key":"5_CR8","unstructured":"D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Cryptographic Applications of Locally Random Reductions, AT&T Bell Laboratories Technical Memorandum, November 15, 1989."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Micali, and P. Rogaway. The Round Complexity of Secure Protocols, Proc. of STOC 1990, ACM, 503\u2013513.","DOI":"10.1145\/100216.100287"},{"key":"5_CR10","unstructured":"C. Bennett, G. Brassard, and C. Cr\u00e9peau. Private communication."},{"key":"5_CR11","series-title":"Lect Notes Comput Sci","first-page":"37","volume-title":"Proc. of CRYPTO 1988","author":"M. Ben-Or","year":"1988","unstructured":"M. Ben-Or, O. Goldreich, S. Goldwasser, J. Hastad, J. Kilian, S. Micali, and P. Rogaway. Everything Provable is Provable in Zero-Knowledge, Proc. of CRYPTO 1988, Springer Verlag LNCS 403, 37\u201356."},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-Prover Interactive Proofs: How to Remove Intractability, Proc. of STOC 1988, ACM, 113\u2013131.","DOI":"10.1145\/62212.62223"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"M. Ben-Or. S. Goldwasser. and A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, Proc. of STOC 1988, ACM, 1\u201310","DOI":"10.1145\/62212.62213"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"M. Rlum. M. Luby, and R. Rubinfeld. Stronger Checkers and General Techniques for Numerical Problems. Proc. of STOC 1990. ACM. 73\u201383.","DOI":"10.1145\/100216.100225"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"M. Blum. M. Luby, and R. Rubinfeld. Program Result Checking Against Adaptive Programs and in Cryptographic Settings, Proc. of DIMACS Workshop on Distrabuted Computing and Cryptography (Princeton, NJ; October, 1989), AMS, 1990.","DOI":"10.1090\/dimacs\/002\/06"},{"key":"5_CR16","series-title":"Lect Notes Comput Sci","first-page":"591","volume-title":"Proc. of CRYPTO 1989","author":"D. Chaum","year":"1989","unstructured":"D. Chaum. The Spymasters Double-Agent Problem: Multiparty Computations Secure Unconditionally from Minorities and Cryptographically from Majorities, Proc. of CRYPTO 1989, Springer Verlag LNCS 435, 591\u2013604."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, and U. Damg\u0103rd. Mu1ultiparty Unconditionally Secure Protocols, Proc. of STOC 1988, ACM, 11\u201319.","DOI":"10.1145\/62212.62214"},{"key":"5_CR18","series-title":"Lect Notes Comput Sci","first-page":"87","volume-title":"Proc. of CRYPTO 1987","author":"D. Chaum","year":"1987","unstructured":"D. Chaum, I. Damg\u00e5rd, and J. van de Graaf. Multiparty Computations Ensuring Secrecy of Each Party\u2019s Input and Correctness of the Output, Proc. of CRYPTO 1987, Springer Verlag LNCS 293. 87\u2013119."},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"B. Chor, E. Kushilevitz. A Zero-One Law for Boolean Privacy, Proc. of STOC 1989, ACM, 62\u201372.","DOI":"10.1145\/73007.73013"},{"key":"5_CR20","unstructured":"J. Feigenbaum and L. Fortnow. On the Random-Self-Reducibility of Complete Sets, University of Chicago Technical Report 90-22, Computer Science Department, August 20, 1990."},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"J. Feigenbaum, S. Kannan, and N. Nisan. Lower Bounds on Random-Self-Reducibility, Proc. of Structures 1990, IEEE, 100\u2013109.","DOI":"10.1109\/SCT.1990.113959"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"L. Fortnow, J. Rompel, and M. Sipser. On the Power of Multi-Prover Interactive Protocols, Proc. of Structures 1988, IEEE, 156\u2013161.","DOI":"10.1109\/SCT.1988.5275"},{"key":"5_CR23","series-title":"Lect Notes Comput Sci","first-page":"135","volume-title":"Proc. of CRYPTO 1987","author":"Z. Galil","year":"1987","unstructured":"Z. Galil, S. Haber, and M. Yung. Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model. Proc. of CRYPTO 1987, Springer Verlag LNCS 293, 135\u2013155."},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. How to Play ANY Mental Game, Proc. of STOC 1987, ACM, 218\u2013229.","DOI":"10.1145\/28395.28420"},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems, SIAM J. Comput. 18 (1989), 186\u2013208.","journal-title":"SIAM J. Comput."},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"J. Kilian. Founding Cryptography on Oblivious Transfer, Proc. of STOC 1988, ACM, 20\u201331.","DOI":"10.1145\/62212.62215"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz. Privacy and Communication Complexity, Proc. of FOCS 1989, IEEE, 416\u2013421.","DOI":"10.1109\/SFCS.1989.63512"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"R. Lipton. New Directions in Testing, Proc. of DIMACS Workshop on Distributed Computing and Cryptography (Princeton, NJ; October, 1989), AMS, 1990.","DOI":"10.1090\/dimacs\/002\/13"},{"key":"5_CR29","unstructured":"C. Lund, L. Fortnow, H. Karloff, and N. Nisan. Algrebraic Methods for Interactive Proof Systems, Proc. of FOCS 1990, IEEE."},{"key":"5_CR30","unstructured":"T. Rabin. Robust Sharing of Secrets When the Dealer is Honest or Cheating, M.Sc. Thesis, Hebrew University, 1988."},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority, Proc. of STOC 1989, ACM, 73\u201385.","DOI":"10.1145\/73007.73014"},{"key":"5_CR32","unstructured":"S. Rudich. Private communication."},{"key":"5_CR33","first-page":"612","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir. How to Share a Secret, Commun. Assoc. Comput. Muchinery 22 (1979), 612\u2013613.","journal-title":"Commun. Assoc. Comput. Muchinery"},{"key":"5_CR34","unstructured":"A. Shamir. IP = PSPACE, Proc. of FOCS 1990, IEEE."},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"A. C. Yao. Protocols for Secure Computations, Proc. of FOCS 1982, IEEE, 160\u2013164.","DOI":"10.1109\/SFCS.1982.38"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"A. C. Yao. How to Generate and Exchange Secrets, Proc. of FOCS 1986, IEEE, 162\u2013167.","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology-CRYPT0\u2019 90"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-38424-3_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T05:11:42Z","timestamp":1737609102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-38424-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540545088"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/3-540-38424-3_5","relation":{},"subject":[]}}