{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,6]],"date-time":"2026-11-06T04:10:26Z","timestamp":1793938226594,"version":"4.8.0"},"publisher-location":"Cham","reference-count":69,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031305443","type":"print"},{"value":"9783031305450","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30545-0_10","type":"book-chapter","created":{"date-parts":[[2023,4,15]],"date-time":"2023-04-15T06:02:10Z","timestamp":1681538530000},"page":"271-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Oblivious Transfer with\u00a0Constant Computational Overhead"],"prefix":"10.1007","author":[{"given":"Elette","family":"Boyle","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6645-0106","authenticated-orcid":false,"given":"Geoffroy","family":"Couteau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7209-3494","authenticated-orcid":false,"given":"Niv","family":"Gilboa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lisa","family":"Kohl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5133-5631","authenticated-orcid":false,"given":"Nicolas","family":"Resch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7937-8422","authenticated-orcid":false,"given":"Peter","family":"Scholl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,4,16]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Agarwal, P., Narayanan, V., Pathak, S., Prabhakaran, M., Prabhakaran, V.M., Rehan, M.A.: Secure non-interactive reduction and spectral analysis of correlations. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology - EUROCRYPT 2022\u201341st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30 - June 3, 2022, Proceedings, Part III. Lecture Notes in Computer Science, vol. 13277, pp. 797\u2013827. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_28","DOI":"10.1007\/978-3-031-07082-2_28"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Alekhnovich, M.: More on average case vs approximation complexity. In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11\u201314 October 2003, Cambridge, MA, USA, Proceedings, pp. 298\u2013307. IEEE Computer Society (2003). https:\/\/doi.org\/10.1109\/SFCS.2003.1238204","DOI":"10.1109\/SFCS.2003.1238204"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Alon, B., Paskin-Cherniavsky, A.: On perfectly secure 2PC in the OT-hybrid model. Theor. Comput. Sci. 891, 166\u2013188 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.08.035","DOI":"10.1016\/j.tcs.2021.08.035"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Applebaum, B.: Pseudorandom generators with long stretch and low locality from random local one-way functions. In: 44th ACM STOC (May 2012)","DOI":"10.1145\/2213977.2214050"},{"key":"10_CR5","unstructured":"Applebaum, B.: The cryptographic hardness of random local functions - survey. Cryptology ePrint Archive, Report 2015\/165 (2015). https:\/\/eprint.iacr.org\/2015\/165"},{"issue":"3","key":"10_CR6","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/s00037-015-0121-8","volume":"25","author":"B Applebaum","year":"2016","unstructured":"Applebaum, B.: Cryptographic hardness of random local functions. Comput. complex. 25(3), 667\u2013722 (2016)","journal-title":"Comput. complex."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Bogdanov, A., Rosen, A.: A dichotomy for local small-bias generators. Journal of Cryptology (3) (Jul 2016)","DOI":"10.1007\/s00145-015-9202-8"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-319-63688-7_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"B Applebaum","year":"2017","unstructured":"Applebaum, B., Damg\u00e5rd, I., Ishai, Y., Nielsen, M., Zichron, L.: Secure arithmetic computation with constant computational overhead. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 223\u2013254. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_8"},{"key":"10_CR9","unstructured":"Applebaum, B., Haramaty, N., Ishai, Y., Kushilevitz, E., Vaikuntanathan, V.: Low-complexity cryptographic hash functions. In: ITCS 2017 (Jan 2017)"},{"key":"10_CR10","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC$$^0$$. In: 45th FOCS (Oct 2004)"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Kachlon, E.: Sampling graphs without forbidden subgraphs and unbalanced expanders with negligible error. In: Zuckerman, D. (ed.) 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9\u201312, 2019, pp. 171\u2013179. IEEE Computer Society (2019). https:\/\/doi.org\/10.1109\/FOCS.2019.00020","DOI":"10.1109\/FOCS.2019.00020"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Lovett, S.: Algebraic attacks against random local functions and their countermeasures. In: 48th ACM STOC (Jun 2016)","DOI":"10.1145\/2897518.2897554"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-642-38348-9_29","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"B Applebaum","year":"2013","unstructured":"Applebaum, B., Moses, Y.: Locally computable uowhf with linear shrinkage. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 486\u2013502. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_29"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-22006-7_34","volume-title":"Automata, Languages and Programming","author":"S Arora","year":"2011","unstructured":"Arora, S., Ge, R.: New algorithms for learning in presence of errors. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 403\u2013415. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_34"},{"issue":"3","key":"10_CR15","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s00145-016-9236-6","volume":"30","author":"G Asharov","year":"2016","unstructured":"Asharov, G., Lindell, Y., Schneider, T., Zohner, M.: More efficient oblivious transfer extensions. J. Cryptol. 30(3), 805\u2013858 (2016). https:\/\/doi.org\/10.1007\/s00145-016-9236-6","journal-title":"J. Cryptol."},{"key":"10_CR16","unstructured":"Augot, D., Finiasz, M., Sendrier, N.: A fast provably secure cryptographic hash function. Cryptology ePrint Archive, Report 2003\/230 (2003). https:\/\/eprint.iacr.org\/2003\/230"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Baron, J., Ishai, Y., Ostrovsky, R.: On linear-size pseudorandom generators and hardcore functions. Theor. Comput. Sci. 554, 50\u201363 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2014.06.013","DOI":"10.1016\/j.tcs.2014.06.013"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/3-540-46766-1_31","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"D Beaver","year":"1992","unstructured":"Beaver, D.: Foundations of secure interactive computing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 377\u2013391. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_31"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Beaver, D.: Correlated pseudorandomness and the complexity of private computations. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 479\u2013488 (1996)","DOI":"10.1145\/237814.237996"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-642-03685-9_30","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A Bogdanov","year":"2009","unstructured":"Bogdanov, A., Qiao, Y.: On the security of Goldreich\u2019s one-way function. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX\/RANDOM -2009. LNCS, vol. 5687, pp. 392\u2013405. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03685-9_30"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Sabin, M., Vasudevan, P.N.: Xor codes and sparse learning parity with noise. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 986\u20131004. SIAM (2019)","DOI":"10.1137\/1.9781611975482.61"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"Boneh, D., Ishai, Y., Sahai, A., Wu, D.J.: Quasi-optimal SNARGs via linear multi-prover interactive proofs. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 222\u2013255. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_8","DOI":"10.1007\/978-3-319-78372-7_8"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-42045-0_15","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Waters, B.: Constrained Pseudorandom Functions and Their Applications. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8270, pp. 280\u2013300. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_15"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-319-70700-6_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"J Bootle","year":"2017","unstructured":"Bootle, J., Cerulli, A., Ghadafi, E., Groth, J., Hajiabadi, M., Jakobsen, S.K.: Linear-time zero-knowledge proofs for arithmetic circuit satisfiability. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10626, pp. 336\u2013365. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_12"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: ACM CCS 2018 (Oct 2018)","DOI":"10.1145\/3243734.3243868"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Resch, N., Scholl, P.: Correlated pseudorandomness from expand-accumulate codes. In: Advances in Cryptology - CRYPTO 2022 (2022). https:\/\/eprint.iacr.org\/2022\/1014","DOI":"10.1007\/978-3-031-15979-4_21"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Boyle, E., et al.: Efficient two-round OT extension and silent non-interactive secure computation. In: ACM CCS 2019 (Nov 2019)","DOI":"10.1145\/3319535.3354255"},{"key":"10_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-030-26954-8_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"E Boyle","year":"2019","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators: silent OT extension and more. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 489\u2013518. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Correlated pseudorandom functions from variable-density LPN. In: 61st FOCS (Nov 2020)","DOI":"10.1109\/FOCS46700.2020.00103"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Orr\u00f9, M.: Homomorphic secret sharing: Optimizations and applications. In: ACM CCS 2017 (Oct \/ Nov 2017)","DOI":"10.1145\/3133956.3134107"},{"key":"10_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-662-46803-6_12","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"E Boyle","year":"2015","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 337\u2013367. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_12"},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing: Improvements and extensions. In: ACM CCS 2016 (Oct 2016)","DOI":"10.1145\/2976749.2978429"},{"key":"10_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-642-54631-0_29","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"E Boyle","year":"2014","unstructured":"Boyle, E., Goldwasser, S., Ivan, I.: Functional signatures and pseudorandom functions. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 501\u2013519. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_29"},{"key":"10_CR34","doi-asserted-by":"publisher","unstructured":"Brassard, G., Cr\u00e9peau, C., Robert, J.: Information theoretic reductions among disclosure problems. In: 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27\u201329 October 1986, pp. 168\u2013173. IEEE Computer Society (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.26","DOI":"10.1109\/SFCS.1986.26"},{"issue":"1","key":"10_CR35","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. J. Cryptol. 13(1), 143\u2013202 (2000). https:\/\/doi.org\/10.1007\/s001459910006","journal-title":"J. Cryptol."},{"key":"10_CR36","doi-asserted-by":"publisher","unstructured":"de Castro, L., Hazay, C., Ishai, Y., Vaikuntanathan, V., Venkitasubramaniam, M.: Asymptotically quasi-optimal cryptography. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology - EUROCRYPT 2022\u201341st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30 - June 3, 2022, Proceedings, Part I. Lecture Notes in Computer Science, vol. 13275, pp. 303\u2013334. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_11","DOI":"10.1007\/978-3-031-06944-4_11"},{"key":"10_CR37","doi-asserted-by":"publisher","unstructured":"Chen, L., Li, J., Yang, T.: Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs. In: Lovett, S. (ed.) 37th Computational Complexity Conference (CCC 2022). Leibniz International Proceedings in Informatics (LIPIcs), vol. 234, pp. 23:1\u201323:37. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2022). https:\/\/doi.org\/10.4230\/LIPIcs.CCC.2022.23, https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2022\/16585","DOI":"10.4230\/LIPIcs.CCC.2022.23"},{"issue":"3","key":"10_CR38","first-page":"14","volume":"6","author":"J Cook","year":"2014","unstructured":"Cook, J., Etesami, O., Miller, R., Trevisan, L.: On the one-way function candidate proposed by goldreich. ACM Trans. Comput. Theor. (TOCT) 6(3), 14 (2014)","journal-title":"ACM Trans. Comput. Theor. (TOCT)"},{"key":"10_CR39","doi-asserted-by":"crossref","unstructured":"Couteau, G., Dupin, A., M\u00e9aux, P., Rossi, M., Rotella, Y.: On the concrete security of Goldreich\u2019s pseudorandom generator. In: ASIACRYPT 2018, Part II (Dec 2018)","DOI":"10.1007\/978-3-030-03329-3_4"},{"key":"10_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-030-84252-9_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"G Couteau","year":"2021","unstructured":"Couteau, G., Rindal, P., Raghuraman, S.: Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 502\u2013534. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_17"},{"key":"10_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-13190-5_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"I Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M.: Perfectly secure multiparty computation and the computational overhead of cryptography. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 445\u2013465. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_23"},{"key":"10_CR42","doi-asserted-by":"publisher","unstructured":"Fan, Z., Li, J., Yang, T.: The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity. In: Leonardi, S., Gupta, A. (eds.) STOC \u201922: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20\u201324, 2022, pp. 962\u2013975. ACM (2022). https:\/\/doi.org\/10.1145\/3519935.3520010","DOI":"10.1145\/3519935.3520010"},{"key":"10_CR43","doi-asserted-by":"crossref","unstructured":"Genkin, D., Ishai, Y., Prabhakaran, M., Sahai, A., Tromer, E.: Circuits resilient to additive attacks with applications to secure computation. In: 46th ACM STOC (May \/ Jun 2014)","DOI":"10.1145\/2591796.2591861"},{"key":"10_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-662-53641-4_14","volume-title":"Theory of Cryptography","author":"D Genkin","year":"2016","unstructured":"Genkin, D., Ishai, Y., Weiss, M.: Binary AMD circuits from secure multiparty computation. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9985, pp. 336\u2013366. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_14"},{"key":"10_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1007\/978-3-642-55220-5_35","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"N Gilboa","year":"2014","unstructured":"Gilboa, N., Ishai, Y.: Distributed point functions and their applications. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 640\u2013658. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_35"},{"key":"10_CR46","unstructured":"Goldreich, O.: Candidate one-way functions based on expander graphs. Cryptology ePrint Archive, Report 2000\/063 (2000), https:\/\/eprint.iacr.org\/2000\/063"},{"key":"10_CR47","unstructured":"Goldreich, O.: Foundations of cryptography: volume 2, basic applications. Cambridge University Press (2009)"},{"key":"10_CR48","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or A completeness theorem for protocols with honest majority. In: Aho, A.V. (ed.) Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, New York, USA. pp. 218\u2013229. ACM (1987). https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"10_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-96878-0_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"C Hazay","year":"2018","unstructured":"Hazay, C., Orsini, E., Scholl, P., Soria-Vazquez, E.: TinyKeys: a new approach to efficient multi-party computation. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 3\u201333. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_1"},{"key":"10_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. 2729, pp. 145\u2013161. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9"},{"key":"10_CR51","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Meldgaard, S., Orlandi, C., Paskin-Cherniavsky, A.: On the power of correlated randomness in secure computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 600\u2013620. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_34","DOI":"10.1007\/978-3-642-36594-2_34"},{"key":"10_CR52","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Cryptography with constant computational overhead. In: 40th ACM STOC (May 2008)","DOI":"10.1145\/1374376.1374438"},{"key":"10_CR53","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Extracting correlations. In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25\u201327, 2009, Atlanta, Georgia, USA. pp. 261\u2013270. IEEE Computer Society (2009). https:\/\/doi.org\/10.1109\/FOCS.2009.56","DOI":"10.1109\/FOCS.2009.56"},{"key":"10_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer \u2013 efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572\u2013591. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_32"},{"key":"10_CR55","doi-asserted-by":"publisher","unstructured":"Justin Holmgren, R.R.: Faster sounder succinct arguments and iops. In: Crypto 2022 (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_17","DOI":"10.1007\/978-3-031-15802-5_17"},{"key":"10_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1007\/978-3-662-47989-6_35","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"M Keller","year":"2015","unstructured":"Keller, M., Orsini, E., Scholl, P.: Actively secure OT extension with optimal overhead. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 724\u2013741. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_35"},{"key":"10_CR57","doi-asserted-by":"publisher","unstructured":"Khorasgani, H.A., Maji, H.K., Nguyen, H.H.: Secure non-interactive simulation: Feasibility and rate. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology - EUROCRYPT 2022\u201341st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30 - June 3, 2022, Proceedings, Part III. Lecture Notes in Computer Science, vol. 13277, pp. 767\u2013796. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_27","DOI":"10.1007\/978-3-031-07082-2_27"},{"key":"10_CR58","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Papadopoulos, S., Triandopoulos, N., Zacharias, T.: Delegatable pseudorandom functions and applications. In: ACM CCS 2013 (Nov 2013)","DOI":"10.1145\/2508859.2516668"},{"key":"10_CR59","doi-asserted-by":"publisher","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: Simon, J. (ed.) Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2\u20134, 1988, Chicago, Illinois, USA, pp. 20\u201331. ACM (1988). https:\/\/doi.org\/10.1145\/62212.62215","DOI":"10.1145\/62212.62215"},{"key":"10_CR60","doi-asserted-by":"crossref","unstructured":"Kliewer, J., Zigangirov, K.S., Costello Jr, D.J.: New results on the minimum distance of repeat multiple accumulate codes. In: Proceedings 45th Annual Allerton Conf. Commun., Control, and Computing (2007)","DOI":"10.1109\/ALLERTON.2008.4797726"},{"key":"10_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-319-70500-2_5","volume-title":"Theory of Cryptography","author":"A Lombardi","year":"2017","unstructured":"Lombardi, A., Vaikuntanathan, V.: Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 119\u2013137. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_5"},{"key":"10_CR62","unstructured":"Mossel, E., Shpilka, A., Trevisan, L.: On e-biased generators in NC0. In: 44th FOCS (Oct 2003)"},{"key":"10_CR63","doi-asserted-by":"crossref","unstructured":"ODonnell, R., Witmer, D.: Goldreich\u2019s prg: evidence for near-optimal polynomial stretch. In: Computational Complexity (CCC), 2014 IEEE 29th Conference on, pp. 1\u201312. IEEE (2014)","DOI":"10.1109\/CCC.2014.9"},{"key":"10_CR64","doi-asserted-by":"publisher","unstructured":"Ron-Zewi, N., Rothblum, R.D.: Proving as fast as computing: succinct arguments with constant prover overhead. In: Leonardi, S., Gupta, A. (eds.) STOC \u201922: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20\u201324, 2022, pp. 1353\u20131363. ACM (2022). https:\/\/doi.org\/10.1145\/3519935.3519956","DOI":"10.1145\/3519935.3519956"},{"key":"10_CR65","unstructured":"Roy, L.: Softspokenot: Communication-computation tradeoffs in OT extension. In: Crypto 2022 (2022)"},{"key":"10_CR66","doi-asserted-by":"crossref","unstructured":"Schoppmann, P., Gasc\u00f3n, A., Reichert, L., Raykova, M.: Distributed vector-OLE: Improved constructions and implementation. In: ACM CCS 2019 (Nov 2019)","DOI":"10.1145\/3319535.3363228"},{"key":"10_CR67","doi-asserted-by":"publisher","unstructured":"Spielman, D.A.: Linear-time encodable and decodable error-correcting codes. In: Leighton, F.T., Borodin, A. (eds.) Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA. pp. 388\u2013397. ACM (1995). https:\/\/doi.org\/10.1145\/225058.225165","DOI":"10.1145\/225058.225165"},{"key":"10_CR68","doi-asserted-by":"crossref","unstructured":"Tillich, J.P., Z\u00e9mor, G.: On the minimum distance of structured ldpc codes with two variable nodes of degree 2 per parity-check equation. In: 2006 IEEE International Symposium on Information Theory, pp. 1549\u20131553. IEEE (2006)","DOI":"10.1109\/ISIT.2006.262128"},{"key":"10_CR69","doi-asserted-by":"crossref","unstructured":"Yang, K., Weng, C., Lan, X., Zhang, J., Wang, X.: Ferret: Fast extension for correlated OT with small communication. In: ACM CCS 2020 (Nov 2020)","DOI":"10.1145\/3372297.3417276"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30545-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T18:04:00Z","timestamp":1744740240000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30545-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031305443","9783031305450"],"references-count":69,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30545-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"16 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"415","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"109","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}