{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:47:31Z","timestamp":1764132451252},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540785231"},{"type":"electronic","value":"9783540785248"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-78524-8_22","type":"book-chapter","created":{"date-parts":[[2008,2,25]],"date-time":"2008-02-25T09:18:12Z","timestamp":1203931092000},"page":"393-411","source":"Crossref","is-referenced-by-count":54,"title":["OT-Combiners via Secure 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"}]},{"given":"Jesper Buus","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","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":"22_CR2","doi-asserted-by":"crossref","unstructured":"Beaver, D.: Commodity-based cryptography. In: 29th STOC, pp. 446\u2013455 (1997)","DOI":"10.1145\/258533.258637"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, 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":"22_CR4","series-title":"Lecture Notes in Computer Science","first-page":"234","volume-title":"Advances in Cryptology - CRYPTO 1986","author":"G. Brassard","year":"1987","unstructured":"Brassard, G., Cr\u00e9peau, C., Robert, J.-M.: All-or-nothing disclosure of secrets. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 234\u2013238. Springer, Heidelberg (1987)"},{"issue":"4","key":"22_CR5","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00145-002-0146-4","volume":"16","author":"G. Brassard","year":"2003","unstructured":"Brassard, G., Cr\u00e9peau, C., Wolf, S.: Oblivious Transfers and Privacy Amplification. J. Cryptology\u00a016(4), 219\u2013237 (2003)","journal-title":"J. Cryptology"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. of Cryptology\u00a013(1) (2000)","DOI":"10.1007\/s001459910006"},{"key":"22_CR7","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":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/11818175_31","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"H. Chen","year":"2006","unstructured":"Chen, H., Cramer, R.: Algebraic geometric secret sharing schemes and secure multi-party computations over small fields. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 521\u2013536. Springer, Heidelberg (2006)"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-72540-4_17","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"H. Chen","year":"2007","unstructured":"Chen, H., Cramer, R., Goldwasser, S., de Haan, R., Vaikuntanathan, V.: Secure computation from random error correcting codes. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 291\u2013310. Springer, Heidelberg (2007)"},{"issue":"1","key":"22_CR10","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1137\/0404004","volume":"4","author":"B. Chor","year":"1991","unstructured":"Chor, B., Kushilevitz, E.: A zero-one law for boolean privacy. SIAM Journal on Disc. Math.\u00a04(1), 36\u201347 (1991); preliminary version in STOC 1989","journal-title":"SIAM Journal on Disc. Math."},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1007\/978-3-540-30576-7_19","volume-title":"Theory of Cryptography","author":"R. Cramer","year":"2005","unstructured":"Cramer, R., Damg\u00e5rd, I., Ishai, Y.: Share conversion, pseudorandom secret-sharing and applications to secure computation. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 342\u2013362. Springer, Heidelberg (2005)"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"R. Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I., Maurer, U.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 316\u2013334. Springer, Heidelberg (2000)"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","first-page":"306","volume-title":"Advances in Cryptology - EUROCRYPT 1998","author":"C. Cr\u00e9peau","year":"1998","unstructured":"Cr\u00e9peau, C.: Efficient cryptographic protocols based on noisy channels. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 306\u2013317. Springer, Heidelberg (1998)"},{"key":"22_CR14","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":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/3-540-44750-4_9","volume-title":"Advances in Cryptology - CRYPTO 1995","author":"C. Cr\u00e9peau","year":"1995","unstructured":"Cr\u00e9peau, C., van de Graaf, J., Tapp, A.: Committed oblivious transfer and private multi-party computation. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 110\u2013123. Springer, Heidelberg (1995)"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/11818175_30","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"I. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I., Ishai, Y.: Scalable secure multiparty computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 501\u2013520. Springer, Heidelberg (2006)"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Damga\u00e5rd, I., Fehr, S., Morozov, K., Salvail, L.: Unfair Noisy Channels and Oblivious Transfer. In: Proc. first TCC, pp. 355\u2013373 (2004)","DOI":"10.1007\/978-3-540-24638-1_20"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/3-540-48910-X_5","volume-title":"Advances in Cryptology - EUROCRYPT 1999","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)"},{"issue":"6","key":"22_CR19","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":"22_CR20","doi-asserted-by":"crossref","unstructured":"Franklin, M., Yung, M.: Communication complexity of secure computation (extended abstract). In: 24th STOC, pp. 699\u2013710 (1992)","DOI":"10.1145\/129712.129780"},{"key":"22_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":"22_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"},{"key":"22_CR23","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 1987","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)"},{"key":"22_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-540-74143-5_16","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"D. Harnik","year":"2007","unstructured":"Harnik, D., Ishai, Y., Kushilevitz, E.: How many oblivious transfers are needed for secure multiparty computation? In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 284\u2013302. Springer, Heidelberg (2007)"},{"key":"22_CR25","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":"22_CR26","doi-asserted-by":"crossref","unstructured":"Herzberg, A.: On tolerant cryptographic constructions. In: CT-RSA, pp. 172\u2013190 (2005)","DOI":"10.1007\/978-3-540-30574-3_13"},{"key":"22_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-44647-8_6","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"M. Hirt","year":"2001","unstructured":"Hirt, M., Maurer, U.: Robustness for free in unconditional multi-party computation. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 101\u2013118. Springer, Heidelberg (2001)"},{"key":"22_CR28","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":"22_CR29","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":"22_CR30","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: 39th STOC, pp. 21\u201330 (2007)","DOI":"10.1145\/1250790.1250794"},{"key":"22_CR31","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":"22_CR32","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":"22_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-72540-4_4","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"Y. Lindell","year":"2007","unstructured":"Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 52\u201378. Springer, Heidelberg (2007)"},{"key":"22_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/11818175_33","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"R. Meier","year":"2006","unstructured":"Meier, R., Przydatek, B.: On robust combiners for private information retrieval and other primitives. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 555\u2013569. Springer, Heidelberg (2006)"},{"key":"22_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","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, pp. 404\u2013418. Springer, Heidelberg (2007)"},{"key":"22_CR36","unstructured":"Przydatek, B., Wullschleger, J.: Error-tolerant combiners for oblivious primitives. In: Manuscript, Personal Communication (2006)"},{"key":"22_CR37","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer. TR-81, Harvard (1981)"},{"key":"22_CR38","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: 21st STOC, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"issue":"1","key":"22_CR39","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":"22_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-540-72540-4_32","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"J. Wullschleger","year":"2007","unstructured":"Wullschleger, J.: Oblivious transfer amplification. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 555\u2013572. Springer, Heidelberg (2007)"},{"key":"22_CR41","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"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78524-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:19:01Z","timestamp":1558279141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78524-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540785231","9783540785248"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78524-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}