{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T16:22:07Z","timestamp":1783095727388,"version":"3.54.6"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540406747","type":"print"},{"value":"9783540451464","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45146-4_9","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T21:51:19Z","timestamp":1277243479000},"page":"145-161","source":"Crossref","is-referenced-by-count":525,"title":["Extending Oblivious Transfers Efficiently"],"prefix":"10.1007","author":[{"given":"Yuval","family":"Ishai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joe","family":"Kilian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kobbi","family":"Nissim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erez","family":"Petrank","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Beaver, D.: Correlated Pseudorandomness and the Complexity of Private Computations. In: STOC, pp. 479\u2013488 (1996)","DOI":"10.1145\/237814.237996"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Boldyreva, A., Palacio, A.: A Separation between the Random- Oracle Model and the Standard Model for a Hybrid Encryption Problem, Electronic Colloquium on Computational Complexity. In: ECCC (2003)","DOI":"10.1007\/978-3-540-24676-3_11"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/168588.168596","volume-title":"Proc. of the 1st ACM Conference on Computer and Communications Security","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random Oracles are Practical: a Paradigm for Designing Efficient Protocols. In: Proc. of the 1st ACM Conference on Computer and Communications Security, pp. 62\u201373. ACM press, New York (1993)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/3-540-48658-5_32","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"M. Bellare","year":"1994","unstructured":"Bellare, M., Kilian, J., Rogaway, P.: The security of cipher block chaining. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 341\u2013358. Springer, Heidelberg (1994)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Optimal asymmetric encryption. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 91\u2013111. Springer, Heidelberg (1994)","DOI":"10.1007\/BFb0053428"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","first-page":"234","volume-title":"Advances in Cryptology - CRYPTO \u201986","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)"},{"key":"9_CR7","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":"9_CR8","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, G., Halevi, S.: The Random Oracle Methodology, Revisited (preliminary version), STOC: ACM Symposium on Theory of Computing (1998)","DOI":"10.1145\/276698.276741"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/3-540-48184-2_30","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"C. Cr\u00e9peau","year":"1988","unstructured":"Cr\u00e9peau, C.: Equivalence between two flavors of oblivious transfers. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 350\u2013354. Springer, Heidelberg (1988)"},{"key":"9_CR10","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. C. ACM\u00a028, 637\u2013647 (1985)","journal-title":"C. ACM"},{"key":"#cr-split#-9_CR11.1","doi-asserted-by":"crossref","unstructured":"Even, S., Mansour, Y.: A construction of a cipher from a single pseudorandom permutation. Journal of Cryptology??10(3), 151???162 (Summer 1997);","DOI":"10.1007\/s001459900025"},{"key":"#cr-split#-9_CR11.2","unstructured":"Earlier version in Matsumoto, T., Imai, H., Rivest, R.L. (eds.): ASIACRYPT 1991. LNCS, vol.??739, pp. 210???224. Springer, Heidelberg (1993)"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/3-540-48224-5_75","volume-title":"Automata, Languages and Programming","author":"J. Feigenbaum","year":"2001","unstructured":"Feigenbaum, J., Ishai, Y., Malkin, T., Nissim, K., Strauss, M., Wright, R.N.: Secure multiparty computation of approximations. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 927\u2013938. Springer, Heidelberg (2001)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Trevisan, L.: Lower Bounds on the Efficiency of Generic Cryptographic Constructions. In: IEEE Symposium on Foundations of Computer Science, pp. 305\u2013313 (2000)","DOI":"10.1109\/SFCS.2000.892119"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Gertner, Y., Kannan, S., Malkin, T., Reingold, O., Viswanathan, M.: The Relationship between Public Key Encryption and Oblivious Transfer. In: Proc. of the 41st Annual Symposium on Foundations of Computer Science, FOCS 2000 (2000)","DOI":"10.1109\/SFCS.2000.892121"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Gertner, Y., Malkin, T., Reingold, O.: On the Impossibility of Basing Trapdoor Functions on Trapdoor Predicates. In: Proc. of the 42st Annual Symposium on Foundations of Computer Science, FOCS 2001 (2001)","DOI":"10.1109\/SFCS.2001.959887"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/3-540-48405-1_8","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"N. Gilboa","year":"1999","unstructured":"Gilboa, N.: Two Party RSA Key Generation. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 116\u2013129. Springer, Heidelberg (1999)"},{"key":"9_CR18","unstructured":"Goldreich, O.: Secure multi-party computation (February 1999), Available at http:\/\/philby.ucsb.edu\/cryptolib\/BOOKS"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that Yield Nothing but Their Validity and a Methodology of Cryptographic Protocol Design. In: Proc. of the 27th FOCS, pp. 174\u2013187 (1986)","DOI":"10.1109\/SFCS.1986.47"},{"key":"9_CR20","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 \u2013 an Efficiency Improvement. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 73\u201386. Springer, Heidelberg (1988)"},{"key":"9_CR21","unstructured":"Goldwasser, S., Tauman, Y.: On the (In)security of the Fiat-Shamir Paradigm. In: Electronic Colloquium on Computational Complexity, ECCC (2003)"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: Proceedings of 21st Annual ACM Symposium on the Theory of Computing, pp. 44\u201361 (1989)","DOI":"10.1145\/73007.73012"},{"key":"9_CR23","first-page":"20","volume-title":"Proc of the 20th STOC","author":"J. Kilian","year":"1988","unstructured":"Kilian, J.: Founding Cryptography on Oblivious Transfer. In: Proc of the 20th STOC, pp. 20\u201329. ACM, New York (1988)"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-68697-5_20","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"J. Kilian","year":"1996","unstructured":"Kilian, J., Rogaway, P.: How to protect DES against exhaustive key search. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 252\u2013267. Springer, Heidelberg (1996)"},{"key":"9_CR25","unstructured":"Kim, J.H., Simon, D.R., Tetali, P.: Limits on the efficiency of one-way permutations- based hash functions. In: Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pp. 535\u2013542 (1999)"},{"issue":"3","key":"9_CR26","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s00145-001-0019-2","volume":"15","author":"Y. Lindell","year":"2002","unstructured":"Lindell, Y., Pinkas, B.: Privacy Preserving Data Mining. Journal of Cryptology\u00a015(3), 177\u2013206 (2002)","journal-title":"Journal of Cryptology"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Naor, M., Nissim, K.: Communication preserving protocols for secure function evaluation. In: STOC 2001, pp. 590\u2013599 (2001)","DOI":"10.1145\/380752.380855"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SODA 2001 (2001)","DOI":"10.1007\/3-540-44448-3_16"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Oblivious Transfer and Polynomial Evaluation. In: STOC: ACM Symposium on Theory of Computing, STOC (1999)","DOI":"10.1145\/301250.301312"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: ACM Conference on Electronic Commerce, pp. 129\u2013139 (1999)","DOI":"10.1145\/336992.337028"},{"key":"9_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-45708-9_8","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Nielsen","year":"2002","unstructured":"Nielsen, J.: Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 111\u2013126. Springer, Heidelberg (2002)"},{"key":"9_CR32","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory (1981)"},{"key":"9_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-44647-8_15","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"V. Shoup","year":"2001","unstructured":"Shoup, V.: OAEP reconsidered. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 239\u2013259. Springer, Heidelberg (2001)"},{"key":"9_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/BFb0054137","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"D. Simon","year":"1998","unstructured":"Simon, D.: Finding Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions? In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 334\u2013345. Springer, Heidelberg (1998)"},{"issue":"3","key":"9_CR35","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s001450010009","volume":"13","author":"E. Petrank","year":"2000","unstructured":"Petrank, E., Rackoff, C.: Message Authentication of Unknown Variable Length Data. Journal of Cryptology\u00a013(3), 315\u2013338 (2000)","journal-title":"Journal of Cryptology"},{"key":"9_CR36","doi-asserted-by":"crossref","unstructured":"Yao, A.: Protocols for Secure Computations (Extended Abstract). In: Proc. of FOCS 1982, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45146-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T05:05:56Z","timestamp":1740200756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45146-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406747","9783540451464"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}