{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:45Z","timestamp":1766281005024},"publisher-location":"Berlin, Heidelberg","reference-count":48,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540741428"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74143-5_16","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T13:51:33Z","timestamp":1186667493000},"page":"284-302","source":"Crossref","is-referenced-by-count":21,"title":["How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?"],"prefix":"10.1007","author":[{"given":"Danny","family":"Harnik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC0 In: 45th FOCS, pp. 166\u2013175 (2004)"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/11535218_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"O. Barkol","year":"2005","unstructured":"Barkol, O., Ishai, Y.: Secure computation of constant-depth circuits with applications to database search problems. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 395\u2013411. Springer, Heidelberg (2005)"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/3-540-44750-4_8","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"D. Beaver","year":"1995","unstructured":"Beaver, D.: Precomputing oblivious transfer. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 97\u2013109. Springer, Heidelberg (1995)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Beaver, D.: Correlated pseudorandomness and the complexity of private computations. In: 28th STOC, pp. 479\u2013488 (1996)","DOI":"10.1145\/237814.237996"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/978-3-540-24638-1_14","volume-title":"Theory of Cryptography","author":"A. Beimel","year":"2004","unstructured":"Beimel, A., Malkin, T.: A quantitative approach to reductions in secure computation. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 238\u2013257. Springer, Heidelberg (2004)"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/3-540-48405-1_6","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"A. Beimel","year":"1999","unstructured":"Beimel, A., Malkin, T., Micali, S.: The all-or-nothing nature of two-party secure computation. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 80\u201397. Springer, Heidelberg (1999)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"BenOr, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: 20th STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Berman, P., Garay, J., Perry, K.: Bit optimal distributed consensus. In: Computer Science Research, pp. 313\u2013332. Plenum Publishing Corporation (1992)","DOI":"10.1007\/978-1-4615-3422-8_27"},{"issue":"4","key":"16_CR9","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1145\/31846.42229","volume":"34","author":"G. Bracha","year":"1987","unstructured":"Bracha, G.: An o(logn) expected rounds randomized byzantine generals protocol. Journal of the ACM\u00a034(4), 910\u2013920 (1987)","journal-title":"Journal of the ACM"},{"issue":"1","key":"16_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology\u00a013(1), 143\u2013202 (2000)","journal-title":"Journal of Cryptology"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: 20th STOC, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Coan, B., Welch, J.: Modular construction of a byzantine agreement protocol with optimal message bit complexity. Information and Computation 97(1) (1992)","DOI":"10.1016\/0890-5401(92)90004-Y"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions. In: 29th FOCS, pp. 42\u201352 (1988)","DOI":"10.1109\/SFCS.1988.21920"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/3-540-48910-X_5","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"I. Damg\u00e5rd","year":"1999","unstructured":"Damg\u00e5rd, I., Kilian, J., Salvail, L.: On the (im)possibility of basing oblivious transfer and bit commitment on weakened security assumptions. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 56\u201373. Springer, Heidelberg (1999)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/3-540-48910-X_4","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"Y. Dodis","year":"1999","unstructured":"Dodis, Y., Micali, S.: Lower bounds for oblivious transfer reductions. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 42\u201355. Springer, Heidelberg (1999)"},{"key":"16_CR16","first-page":"51","volume":"1","author":"P. Erdos","year":"1966","unstructured":"Erdos, P., Simonovits, M.: A limit theorem in graph theory. Stud. Sci. Math. Hung\u00a01, 51\u201357 (1966)","journal-title":"Stud. Sci. Math. Hung"},{"issue":"6","key":"16_CR17","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Communications of the ACM\u00a028(6), 637\u2013647 (1985)","journal-title":"Communications of the ACM"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70936-7_17","volume-title":"Theory of Cryptography","author":"M. Fitzi","year":"2007","unstructured":"Fitzi, M., Franklin, M., Garay, J., Vardhan, H.: Towards optimal and efficient perfectly secure message transmission. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, Springer, Heidelberg (2007)"},{"issue":"4","key":"16_CR19","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s001459900013","volume":"9","author":"M. Franklin","year":"1996","unstructured":"Franklin, M., Haber, S.: Joint encryption and message-efficient secure computation. J. Cryptology\u00a09(4), 217\u2013232 (1996)","journal-title":"J. Cryptology"},{"issue":"3","key":"16_CR20","first-page":"407","volume":"22","author":"O. Gabber","year":"1981","unstructured":"Gabber, O., Galil, Z.: Explicit constructions of linear-sized superconcentrators. JCSS\u00a022(3), 407\u2013420 (1981)","journal-title":"JCSS"},{"key":"16_CR21","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography, vol.\u00a02. Cambridge University Press, Cambridge (2004)"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game - a completeness theorem for protocols with honest majority. In: 19th STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"issue":"1","key":"16_CR23","first-page":"691","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity, or all languages in NP have zero-knowledge proof system. Journal of the ACM\u00a038(1), 691\u2013729 (1991)","journal-title":"Journal of the ACM"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/3-540-48184-2_6","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"O. Goldreich","year":"1988","unstructured":"Goldreich, O., Vainish, R.: How to solve any protocol problem - an efficiency improvement. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 73\u201386. Springer, Heidelberg (1988)"},{"issue":"4","key":"16_CR25","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1002\/(SICI)1098-2418(199712)11:4<315::AID-RSA3>3.0.CO;2-1","volume":"11","author":"O. Goldreich","year":"1997","unstructured":"Goldreich, O., Wigderson, A.: Tiny families of functions with random properties: A quality-size trade-off for hashin. Rand. Structs. and Algs.\u00a011(4), 315\u2013343 (1997)","journal-title":"Rand. Structs. and Algs."},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Gradwohl, R., Kindler, G., Reingold, O., Ta-Shma, A.: On the error parameter of dispersers. In: APPROX-RANDOM, pp. 294\u2013305 (2005)","DOI":"10.1007\/11538462_25"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/11426639_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"D. Harnik","year":"2005","unstructured":"Harnik, D., Kilian, J., Naor, M., Reingold, O., Rosen, A.: On tolerant combiners for oblivious transfer and other primitives. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 96\u2013113. Springer, Heidelberg (2005)"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Harnik, D., Naor, M., Reingold, O., Rosen, A.: Completeness in two-party secure computation - a computational view. In: 36th STOC, pp. 252\u2013261 (2004)","DOI":"10.1145\/1007352.1007395"},{"issue":"1","key":"16_CR29","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M. Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U.: Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology\u00a013(1), 31\u201360 (2000)","journal-title":"Journal of Cryptology"},{"key":"16_CR30","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: 21st STOC, pp. 44\u201361 (1989)","DOI":"10.1145\/73007.73012"},{"key":"16_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/978-3-540-45146-4_9","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y. Ishai","year":"2003","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 145\u2013161. Springer, Heidelberg (2003)"},{"key":"16_CR32","doi-asserted-by":"crossref","unstructured":"Kamp, J., Zuckerman, D.: Deterministic extractors for bit-fixing sources and exposure-resilient cryptography. In: 44th FOCS, pp. 92\u2013101 (2003)","DOI":"10.1109\/SFCS.2003.1238184"},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: 20th STOC, pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A general completeness theorem for two-party games. In: 23rd STOC, pp. 553\u2013560 (1991)","DOI":"10.1145\/103418.103475"},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J., Sanwalani, V., Vee, E.: Towards secure and scalable computation in peer-to-peer networks. In: 47th FOCS, pp. 87\u201398 (2006)","DOI":"10.1109\/FOCS.2006.77"},{"issue":"4","key":"16_CR36","first-page":"71","volume":"9","author":"G. Margulis","year":"1973","unstructured":"Margulis, G.: Explicit constructions of concentrators. Problemy peredaci informacii\u00a09(4), 71\u201380 (1973)","journal-title":"Problemy peredaci informacii"},{"key":"16_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70936-7_22","volume-title":"Theory of Cryptography","author":"R. Meier","year":"2007","unstructured":"Meier, R., Przydatek, B., Wullschleger, J.: Robuster combiners for oblivious transfer. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, Springer, Heidelberg (2007)"},{"key":"16_CR38","unstructured":"Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SODA 2001. SIAM Symposium on Discrete Algorithms, pp. 448\u2013457 (2001)"},{"key":"16_CR39","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Rajagopalan, S., Vazirani, U.: Simple and efficient leader election in the full information model. In: 26th STOC, pp. 234\u2013242 (1994)","DOI":"10.1145\/195058.195141"},{"key":"16_CR40","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer. TR-81, Harvard (1981)"},{"issue":"1","key":"16_CR41","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1137\/S0895480197329508","volume":"13","author":"J. Radhakrishnan","year":"2000","unstructured":"Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM J. Discrete Math.\u00a013(1), 2\u201324 (2000)","journal-title":"SIAM J. Discrete Math."},{"key":"16_CR42","doi-asserted-by":"crossref","unstructured":"Reingold, O., Vadhan, S., Wigderson, A.: Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. ECCC 8(18) (2001)","DOI":"10.2307\/3062153"},{"key":"16_CR43","first-page":"67","volume":"77","author":"R. Shaltiel","year":"2002","unstructured":"Shaltiel, R.: Recent developments in explicit constructions of extractors. Bulletin of the EATCS\u00a077, 67\u201395 (2002)","journal-title":"Bulletin of the EATCS"},{"issue":"1","key":"16_CR44","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1008908.1008920","volume":"15","author":"S. Wiesner","year":"1983","unstructured":"Wiesner, S.: Conjugate coding. SIGACT News\u00a015(1), 78\u201388 (1983)","journal-title":"SIGACT News"},{"key":"16_CR45","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-540-72540-4_32","volume-title":"EUROCRYPT 2007","author":"J. Wullschleger","year":"2004","unstructured":"Wullschleger, J.: Oblivious transfer amplification. In: EUROCRYPT 2007, vol.\u00a04515, pp. 555\u2013572. Springer, Heidelberg (2004)"},{"key":"16_CR46","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd FOCS, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"16_CR47","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: 27th FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"16_CR48","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Randomness-optimal sampling, extractors, and constructive leader election. In: 28th STOC, pp. 286\u2013295 (1996)","DOI":"10.1145\/237814.237878"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74143-5_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:18:05Z","timestamp":1605763085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74143-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540741428"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74143-5_16","relation":{},"subject":[]}}