{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T11:06:29Z","timestamp":1776942389760,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540785231","type":"print"},{"value":"9783540785248","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78524-8_23","type":"book-chapter","created":{"date-parts":[[2008,2,25]],"date-time":"2008-02-25T09:18:12Z","timestamp":1203931092000},"page":"412-426","source":"Crossref","is-referenced-by-count":43,"title":["Semi-honest to Malicious Oblivious Transfer\u2014The Black-Box Way"],"prefix":"10.1007","author":[{"given":"Iftach","family":"Haitner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: 42nd FOCS, pp. 106\u2013115 (2001)","DOI":"10.1109\/SFCS.2001.959885"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Blum, M.: How to exchange (secret) keys. ACM Transactions on Computer Systems (1983)","DOI":"10.1145\/357360.357368"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Brassard, G., Cr\u00e9peau, C., Robert, J.-M.: Information theoretic reductions among disclosure problems. In: 27th FOCS (1986)","DOI":"10.1109\/SFCS.1986.26"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO 1987","author":"C. Cr\u00e9peau","year":"1988","unstructured":"Cr\u00e9peau, C.: Equivalence between two flavours of oblivious transfers. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, Springer, Heidelberg (1988)"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO 1988","author":"C. Cr\u00e9peau","year":"1990","unstructured":"Cr\u00e9peau, C., Kilian, J.: Weakening security assumptions and oblivious transfer. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, Springer, Heidelberg (1990)"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46416-6_9","volume-title":"Advances in Cryptology - EUROCRYPT 1991","author":"C. Cr\u00e9peau","year":"1991","unstructured":"Cr\u00e9peau, C., S\u00e1ntha, M.: On the reversibility of oblivious transfer. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, Springer, Heidelberg (1991)"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_10","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"G. Crescenzo Di","year":"2000","unstructured":"Di Crescenzo, G., Malkin, T., Ostrovsky, R.: Single database private information retrieval implies oblivious transfer. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, Springer, Heidelberg (2000)"},{"issue":"2","key":"23_CR8","first-page":"391","volume":"30","author":"D. Dolev","year":"2000","unstructured":"Dolev, D., Dwork, C., Naor, M.: Nonmalleable cryptography. JACM\u00a030(2), 391\u2013437 (2000)","journal-title":"JACM"},{"issue":"6","key":"23_CR9","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":"23_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography: Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press, Cambridge (2001)"},{"key":"23_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography \u2013 vol. 2: Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography \u2013 vol. 2: Basic Applications. Cambridge University Press, Cambridge (2004)"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: 19th STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Haitner, I.: Implementing oblivious transfer using collection of dense trapdoor permutations. In: 1st TCC, pp. 394\u2013409 (2004)","DOI":"10.1007\/978-3-540-24638-1_22"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Haitner, I., Reingold, O.: Statistically-hiding commitment from any one-way function. In: 39th STOC (2007)","DOI":"10.1145\/1250790.1250792"},{"issue":"4","key":"23_CR15","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SICOMP\u00a028(4), 1364\u20131396 (1999)","journal-title":"SICOMP"},{"key":"23_CR16","first-page":"44","volume-title":"21st STOC","author":"R. Impagliazzo","year":"1989","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: 21st STOC, pp. 44\u201361. ACM Press, New York (1989)"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Lindell, Y., Petrank, E.: Black-box constructions for secure computation. In: 38th STOC (2006)","DOI":"10.1145\/1132516.1132531"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is NOT needed: SINGLE database, computationally-private information retrieval. In: 38th FOCS, pp. 364\u2013373 (1997)","DOI":"10.1109\/SFCS.1997.646125"},{"issue":"3","key":"23_CR20","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s00145-005-0345-x","volume":"19","author":"Y. Lindell","year":"2006","unstructured":"Lindell, Y.: A simpler construction of CCA2-secure public-key encryption under general assumptions. J. Cryptology\u00a019(3), 359\u2013377 (2006)","journal-title":"J. Cryptology"},{"issue":"2","key":"23_CR21","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. J. of Crypto.\u00a04(2), 151\u2013158 (1991)","journal-title":"J. of Crypto."},{"issue":"2","key":"23_CR22","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s001459900037","volume":"11","author":"M. Naor","year":"1998","unstructured":"Naor, M., Ostrovsky, R., Venkatesan, R., Yung, M.: Perfect zero-knowledge arguments for NP using any one-way permutation. J. of Crypto.\u00a011(2), 87\u2013108 (1998)","journal-title":"J. of Crypto."},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Nguyen, M.-H., Ong, S.J., Vadhan, S.: Statistical zero-knowledge arguments for NP from any one-way function. In: 47th FOCS, pp. 3\u201314 (2006)","DOI":"10.1109\/FOCS.2006.71"},{"key":"23_CR24","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer. TR-81, Harvard (1981)"},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Reingold, O., Trevisan, L., Vadhan, S.P.: Notions of reducibility between cryptographic primitives. In: 1st TCC, pp. 1\u201320 (2004)","DOI":"10.1007\/978-3-540-24638-1_1"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: 40th FOCS, pp. 543\u2013553 (1999)","DOI":"10.1109\/SFFCS.1999.814628"},{"key":"23_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49649-1_28","volume-title":"Advances in Cryptology - ASIACRYPT 1998","author":"J..P. Stern","year":"1998","unstructured":"Stern, J.P.: A new and efficient all-or-nothing disclosure of secrets protocol. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, Springer, Heidelberg (1998)"},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Chi-Chih Yao, A.: 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_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,28]],"date-time":"2025-01-28T18:31:19Z","timestamp":1738089079000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78524-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540785231","9783540785248"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78524-8_23","relation":{},"subject":[]}}