{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T23:12:33Z","timestamp":1778022753008,"version":"3.51.4"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253231","type":"print"},{"value":"9783032253248","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-25324-8_5","type":"book-chapter","created":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T22:40:45Z","timestamp":1778020845000},"page":"124-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Non-interactive Secure Computation with\u00a0Constant Communication Overhead"],"prefix":"10.1007","author":[{"given":"Yuval","family":"Ishai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziyang","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naty","family":"Peter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akshayaram","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,6]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Afshar, A., Mohassel, P., Pinkas, B., Riva, B.: Non-interactive secure computation based on cut-and-choose. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT\u00a02014. LNCS, vol.\u00a08441, pp. 387\u2013404. Springer Berlin Heidelberg, Germany, Copenhagen, Denmark (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_22","DOI":"10.1007\/978-3-642-55220-5_22"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 2087\u20132104. ACM Press, Dallas, TX, USA (2017). https:\/\/doi.org\/10.1145\/3133956.3134104","DOI":"10.1145\/3133956.3134104"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: 22nd ACM STOC, pp. 503\u2013513. ACM Press, Baltimore, MD, USA (1990). https:\/\/doi.org\/10.1145\/100216.100287","DOI":"10.1145\/100216.100287"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Carmon, D., Ishai, Y., Kopparty, S., Saraf, S.: Proximity gaps for reed-Solomon codes. In: 61st FOCS, pp. 900\u2013909. IEEE Computer Society Press, Durham, NC, USA (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00088","DOI":"10.1109\/FOCS46700.2020.00088"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Sudan, M.: Simple PCPs with poly-log rate and query complexity. In: Gabow, H.N., Fagin, R. (eds.) 37th ACM STOC, pp. 266\u2013275. ACM Press, Baltimore, MA, USA (2005). https:\/\/doi.org\/10.1145\/1060590.1060631","DOI":"10.1145\/1060590.1060631"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Block, A.R., Gupta, D., Maji, H.K., Nguyen, H.H.: Secure computation using leaky correlations (asymptotically optimal constructions). In: Beimel, A., Dziembowski, S. (eds.) TCC\u00a02018, Part\u00a0II. LNCS, vol. 11240, pp. 36\u201365. Springer, Cham, Switzerland, Panaji, India (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_2","DOI":"10.1007\/978-3-030-03810-6_2"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Boneh, D., et al.: Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT\u00a02014. LNCS, vol.\u00a08441, pp. 533\u2013556. Springer Berlin Heidelberg, Germany, Copenhagen, Denmark (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_30","DOI":"10.1007\/978-3-642-55220-5_30"},{"key":"5_CR8","doi-asserted-by":"publisher","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\u00a02019, Part\u00a0III. LNCS, vol. 11694, pp. 489\u2013518. Springer, Cham, Switzerland, Santa Barbara, CA, USA (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Correlated pseudorandom functions from variable-density LPN. In: 61st FOCS, pp. 1069\u20131080. IEEE Computer Society Press, Durham, NC, USA (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00103","DOI":"10.1109\/FOCS46700.2020.00103"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators from ring-LPN. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO\u00a02020, Part\u00a0II. LNCS, vol. 12171, pp. 387\u2013416. Springer, Cham, Switzerland, Santa Barbara, CA, USA (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_14","DOI":"10.1007\/978-3-030-56880-1_14"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Breaking the circuit size barrier for secure computation under DDH. In: Robshaw, M., Katz, J. (eds.) CRYPTO\u00a02016, Part\u00a0I. LNCS, vol.\u00a09814, pp. 509\u2013539. Springer Berlin Heidelberg, Germany, Santa Barbara, CA, USA (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_19","DOI":"10.1007\/978-3-662-53018-4_19"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: Ostrovsky, R. (ed.) 52nd FOCS, pp. 97\u2013106. IEEE Computer Society Press, Palm Springs, CA, USA (2011). https:\/\/doi.org\/10.1109\/FOCS.2011.12","DOI":"10.1109\/FOCS.2011.12"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Cascudo, I., Cramer, R., Xing, C., Yuan, C.: Amortized complexity of information-theoretically secure MPC revisited. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO\u00a02018, Part\u00a0III. LNCS, vol. 10993, pp. 395\u2013426. Springer, Cham, Switzerland, Santa Barbara, CA, USA (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_14","DOI":"10.1007\/978-3-319-96878-0_14"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Chase, M., Dodis, Y., Ishai, Y., Kraschewski, D., Liu, T., Ostrovsky, R., Vaikuntanathan, V.: Reusable non-interactive secure computation. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO\u00a02019, Part\u00a0III. LNCS, vol. 11694, pp. 462\u2013488. Springer, Cham, Switzerland, Santa Barbara, CA, USA (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_15","DOI":"10.1007\/978-3-030-26954-8_15"},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Couteau, G., Hazay, C., Hegde, A., Kumar, N.: $$\\omega (1\/\\lambda )$$-rate boolean garbling scheme from generic groups. In: Kalai, Y.T., Kamara, S.F. (eds.) CRYPTO\u00a02025, Part\u00a0IV. LNCS, vol. 16003, pp. 489\u2013521. Springer, Cham, Switzerland, Santa Barbara, CA, USA (2025). https:\/\/doi.org\/10.1007\/978-3-032-01884-7_16","DOI":"10.1007\/978-3-032-01884-7_16"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Cramer, R., Rambaud, M., Xing, C.: Asymptotically-good arithmetic secret sharing over $$\\mathbb{Z}\/p^{\\ell }\\mathbb{Z}$$ with strong multiplication and its applications to efficient MPC. In: Malkin, T., Peikert, C. (eds.) CRYPTO\u00a02021, Part\u00a0III. LNCS, vol. 12827, pp. 656\u2013686. Springer, Cham, Switzerland, Virtual Event (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_22","DOI":"10.1007\/978-3-030-84252-9_22"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Cui, H., Wang, X., Yang, K., Yu, Y.: Actively secure half-gates with minimum overhead under duplex networks. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0II. LNCS, vol. 14005, pp. 35\u201367. Springer, Cham, Switzerland, Lyon, France (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_2","DOI":"10.1007\/978-3-031-30617-4_2"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Ishai, Y.: Constant-round multiparty computation using a black-box pseudorandom generator. In: Shoup, V. (ed.) CRYPTO\u00a02005. LNCS, vol.\u00a03621, pp. 378\u2013394. Springer Berlin Heidelberg, Germany, Santa Barbara, CA, USA (2005). https:\/\/doi.org\/10.1007\/11535218_23","DOI":"10.1007\/11535218_23"},{"key":"5_CR19","doi-asserted-by":"publisher","unstructured":"Dittmer, S., Ishai, Y., Lu, S., Ostrovsky, R.: Authenticated garbling from simple correlations. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0IV. LNCS, vol. 13510, pp. 57\u201387. Springer, Cham, Switzerland, Santa Barbara, CA, USA (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_3","DOI":"10.1007\/978-3-031-15985-5_3"},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Escudero, D., Xing, C., Yuan, C.: More efficient dishonest majority secure computation over $$\\mathbb{Z}_{2^k}$$ via Galois rings. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0I. LNCS, vol. 13507, pp. 383\u2013412. Springer, Cham, Switzerland, Santa Barbara, CA, USA (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_14","DOI":"10.1007\/978-3-031-15802-5_14"},{"key":"5_CR21","doi-asserted-by":"publisher","unstructured":"Franklin, M.K., Yung, M.: Communication complexity of secure computation (extended abstract). In: 24th ACM STOC, pp. 699\u2013710. ACM Press, Victoria, BC, Canada (1992). https:\/\/doi.org\/10.1145\/129712.129780","DOI":"10.1145\/129712.129780"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed.) 41st ACM STOC, pp. 169\u2013178. ACM Press, Bethesda, MD, USA (2009). https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, J.A. (eds.) CRYPTO\u00a02013, Part\u00a0I. LNCS, vol.\u00a08042, pp. 75\u201392. Springer Berlin Heidelberg, Germany, Santa Barbara, CA, USA (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"5_CR24","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. (ed.) 19th ACM STOC, pp. 218\u2013229. ACM Press, New York City, NY, USA (1987). https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"5_CR25","doi-asserted-by":"publisher","unstructured":"Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Actively secure garbled circuits with constant communication overhead in the plain model. In: Kalai, Y., Reyzin, L. (eds.) TCC\u00a02017, Part\u00a0II. LNCS, vol. 10678, pp. 3\u201339. Springer, Cham, Switzerland, Baltimore, MD, USA (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_1","DOI":"10.1007\/978-3-319-70503-3_1"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Hazay, C., Scholl, P., Soria-Vazquez, E.: Low cost constant round MPC combining BMR and oblivious transfer. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT\u00a02017, Part\u00a0I. LNCS, vol. 10624, pp. 598\u2013628. Springer, Cham, Switzerland, Hong Kong, China (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_21","DOI":"10.1007\/978-3-319-70694-8_21"},{"key":"5_CR27","doi-asserted-by":"publisher","unstructured":"Heath, D., Kolesnikov, V.: Stacked garbling - garbled circuit proportional to longest execution path. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO\u00a02020, Part\u00a0II. LNCS, vol. 12171, pp. 763\u2013792. Springer, Cham, Switzerland, Santa Barbara, CA, USA (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_27","DOI":"10.1007\/978-3-030-56880-1_27"},{"key":"5_CR28","doi-asserted-by":"publisher","unstructured":"Huang, Y., Katz, J., Evans, D.: Quid-Pro-Quo-tocols: strengthening semi-honest protocols with dual execution. In: 2012 IEEE Symposium on Security and Privacy, pp. 272\u2013284. IEEE Computer Society Press, San Francisco, CA, USA (2012). https:\/\/doi.org\/10.1109\/SP.2012.43","DOI":"10.1109\/SP.2012.43"},{"key":"5_CR29","doi-asserted-by":"publisher","unstructured":"Huang, Y., Katz, J., Evans, D.: Quid-Pro-Quo-tocols: strengthening semi-honest protocols with dual execution. In: IEEE Symposium on Security and Privacy, SP 2012, 21-23 May 2012, San Francisco, California, USA, pp. 272\u2013284. IEEE Computer Society (2012). https:\/\/doi.org\/10.1109\/SP.2012.43, https:\/\/doi.org\/10.1109\/SP.2012.43","DOI":"10.1109\/SP.2012.43"},{"key":"5_CR30","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Khurana, D., Sahai, A., Srinivasan, A.: On the round complexity of black-box secure MPC. In: Malkin, T., Peikert, C. (eds.) CRYPTO\u00a02021, Part\u00a0II. LNCS, vol. 12826, pp. 214\u2013243. Springer, Cham, Switzerland, Virtual Event (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_8","DOI":"10.1007\/978-3-030-84245-1_8"},{"key":"5_CR31","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Khurana, D., Sahai, A., Srinivasan, A.: Round-optimal black-box protocol compilers. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT\u00a02022, Part\u00a0I. LNCS, vol. 13275, pp. 210\u2013240. Springer, Cham, Switzerland, Trondheim, Norway (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_8","DOI":"10.1007\/978-3-031-06944-4_8"},{"key":"5_CR32","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Khurana, D., Sahai, A., Srinivasan, A.: Round-optimal black-box secure computation from two-round malicious OT. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC\u00a02022, Part\u00a0II. LNCS, vol. 13748, pp. 441\u2013469. Springer, Cham, Switzerland, Chicago, IL, USA (2022). https:\/\/doi.org\/10.1007\/978-3-031-22365-5_16","DOI":"10.1007\/978-3-031-22365-5_16"},{"key":"5_CR33","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Khurana, D., Sahai, A., Srinivasan, A.: Black-box reusable NISC with random oracles. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0II. LNCS, vol. 14005, pp. 68\u201397. Springer, Cham, Switzerland, Lyon, France (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_3","DOI":"10.1007\/978-3-031-30617-4_3"},{"key":"5_CR34","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Prabhakaran, M., Sahai, A.: Efficient non-interactive secure computation. In: Paterson, K.G. (ed.) EUROCRYPT\u00a02011. LNCS, vol.\u00a06632, pp. 406\u2013425. Springer Berlin Heidelberg, Germany, Tallinn, Estonia (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_23","DOI":"10.1007\/978-3-642-20465-4_23"},{"key":"5_CR35","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Paskin, A.: Secure multiparty computation with minimal interaction. In: Rabin, T. (ed.) CRYPTO\u00a02010. LNCS, vol.\u00a06223, pp. 577\u2013594. Springer Berlin Heidelberg, Germany, Santa Barbara, CA, USA (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_31","DOI":"10.1007\/978-3-642-14623-7_31"},{"key":"5_CR36","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Li, H., Lin, H.: A unified framework for succinct garbling from homomorphic secret sharing. In: Kalai, Y.T., Kamara, S.F. (eds.) CRYPTO\u00a02025, Part\u00a0IV. LNCS, vol. 16003, pp. 390\u2013425. Springer, Cham, Switzerland, Santa Barbara, CA, USA (2025). https:\/\/doi.org\/10.1007\/978-3-032-01884-7_13","DOI":"10.1007\/978-3-032-01884-7_13"},{"key":"5_CR37","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer - efficiently. In: Wagner, D. (ed.) CRYPTO\u00a02008. LNCS, vol.\u00a05157, pp. 572\u2013591. Springer Berlin Heidelberg, Germany, Santa Barbara, CA, USA (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_32","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"5_CR38","doi-asserted-by":"publisher","unstructured":"Januzelli, J., Rosulek, M., Roy, L.: Lower bounds for garbled circuits from shannon-type information inequalities. In: Kalai, Y.T., Kamara, S.F. (eds.) Advances in Cryptology - CRYPTO 2025 - 45th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2025, Proceedings, Part IV. Lecture Notes in Computer Science, vol. 16003, pp. 589\u2013618. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-032-01884-7_19, https:\/\/doi.org\/10.1007\/978-3-032-01884-7_19","DOI":"10.1007\/978-3-032-01884-7_19"},{"key":"5_CR39","doi-asserted-by":"publisher","unstructured":"Katz, J., Ranellucci, S., Rosulek, M., Wang, X.: Optimizing authenticated garbling for faster secure two-party computation. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO\u00a02018, Part\u00a0III. LNCS, vol. 10993, pp. 365\u2013391. Springer, Cham, Switzerland, Santa Barbara, CA, USA (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_13","DOI":"10.1007\/978-3-319-96878-0_13"},{"key":"5_CR40","doi-asserted-by":"publisher","unstructured":"Kolesnikov, V., Schneider, T.: Improved garbled circuit: Free XOR gates and applications. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part\u00a0II. LNCS, vol.\u00a05126, pp. 486\u2013498. Springer Berlin Heidelberg, Germany, Reykjavik, Iceland (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_40","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"5_CR41","doi-asserted-by":"publisher","unstructured":"Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. In: Naor, M. (ed.) EUROCRYPT\u00a02007. LNCS, vol.\u00a04515, pp. 52\u201378. Springer Berlin Heidelberg, Germany, Barcelona, Spain (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_4","DOI":"10.1007\/978-3-540-72540-4_4"},{"key":"5_CR42","doi-asserted-by":"publisher","unstructured":"Liu, H., Wang, X., Yang, K., Yu, Y.: BitGC: garbled circuits with 1 bit per gate. In: Fehr, S., Fouque, P.A. (eds.) EUROCRYPT\u00a02025, Part\u00a0VII. LNCS, vol. 15607, pp. 437\u2013466. Springer, Cham, Switzerland, Madrid, Spain (2025). https:\/\/doi.org\/10.1007\/978-3-031-91098-2_16","DOI":"10.1007\/978-3-031-91098-2_16"},{"key":"5_CR43","doi-asserted-by":"publisher","unstructured":"Meyer, P., Orlandi, C., Roy, L., Scholl, P.: Silent circuit relinearisation: sublinear-size (boolean and arithmetic) garbled circuits from DCR. In: Kalai, Y.T., Kamara, S.F. (eds.) CRYPTO\u00a02025, Part\u00a0IV. LNCS, vol. 16003, pp. 426\u2013458. Springer, Cham, Switzerland, Santa Barbara, CA, USA (2025). https:\/\/doi.org\/10.1007\/978-3-032-01884-7_14","DOI":"10.1007\/978-3-032-01884-7_14"},{"key":"5_CR44","doi-asserted-by":"publisher","unstructured":"Mohassel, P., Franklin, M.: Efficiency tradeoffs for malicious two-party computation. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC\u00a02006. LNCS, vol.\u00a03958, pp. 458\u2013473. Springer Berlin Heidelberg, Germany, New York, NY, USA (2006). https:\/\/doi.org\/10.1007\/11745853_30","DOI":"10.1007\/11745853_30"},{"key":"5_CR45","doi-asserted-by":"publisher","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: Feldman, S.I., Wellman, M.P. (eds.) Proceedings of the First ACM Conference on Electronic Commerce (EC-99), Denver, CO, USA, November 3-5, 1999, pp. 129\u2013139. ACM (1999). https:\/\/doi.org\/10.1145\/336992.337028","DOI":"10.1145\/336992.337028"},{"key":"5_CR46","doi-asserted-by":"publisher","unstructured":"Nielsen, J.B., Orlandi, C.: Cross and clean: amortized garbled circuits with constant overhead. In: Hirt, M., Smith, A.D. (eds.) Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part I. Lecture Notes in Computer Science, vol.\u00a09985, pp. 582\u2013603 (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_22","DOI":"10.1007\/978-3-662-53641-4_22"},{"key":"5_CR47","doi-asserted-by":"publisher","unstructured":"Pass, R.: On deniability in the common reference string and random oracle model. In: Boneh, D. (ed.) CRYPTO\u00a02003. LNCS, vol.\u00a02729, pp. 316\u2013337. Springer Berlin Heidelberg, Germany, Santa Barbara, CA, USA (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_19","DOI":"10.1007\/978-3-540-45146-4_19"},{"key":"5_CR48","doi-asserted-by":"publisher","unstructured":"Polishchuk, A., Spielman, D.A.: Nearly-linear size holographic proofs. In: 26th ACM STOC, pp. 194\u2013203. ACM Press, Montr\u00e9al, Qu\u00e9bec, Canada (1994). https:\/\/doi.org\/10.1145\/195058.195132","DOI":"10.1145\/195058.195132"},{"key":"5_CR49","doi-asserted-by":"publisher","unstructured":"Rosulek, M., Roy, L.: Three halves make a whole? Beating the half-gates lower bound for garbled circuits. In: Malkin, T., Peikert, C. (eds.) CRYPTO\u00a02021, Part\u00a0I. LNCS, vol. 12825, pp. 94\u2013124. Springer, Cham, Switzerland, Virtual Event (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_5","DOI":"10.1007\/978-3-030-84242-0_5"},{"key":"5_CR50","doi-asserted-by":"publisher","unstructured":"Wang, X., Ranellucci, S., Katz, J.: Authenticated garbling and efficient maliciously secure two-party computation. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 21\u201337. ACM Press, Dallas, TX, USA (2017). https:\/\/doi.org\/10.1145\/3133956.3134053","DOI":"10.1145\/3133956.3134053"},{"key":"5_CR51","doi-asserted-by":"publisher","unstructured":"Xu, F., Hu, H., Xu, C.: Bitwise garbling schemes - A model with $$\\frac{3}{2} \\kappa $$-bit lower bound of ciphertexts. In: Kalai, Y.T., Kamara, S.F. (eds.) Advances in Cryptology - CRYPTO 2025 - 45th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2025, Proceedings, Part IV. Lecture Notes in Computer Science, vol. 16003, pp. 459\u2013488. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-032-01884-7_15","DOI":"10.1007\/978-3-032-01884-7_15"},{"key":"5_CR52","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: 27th FOCS, pp. 162\u2013167. IEEE Computer Society Press, Toronto, Ontario, Canada (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"},{"key":"5_CR53","doi-asserted-by":"publisher","unstructured":"Zahur, S., Rosulek, M., Evans, D.: Two halves make a whole - reducing data transfer in garbled circuits using half gates. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT\u00a02015, Part\u00a0II. LNCS, vol.\u00a09057, pp. 220\u2013250. Springer Berlin Heidelberg, Germany, Sofia, Bulgaria (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_8","DOI":"10.1007\/978-3-662-46803-6_8"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25324-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T22:40:46Z","timestamp":1778020846000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25324-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253231","9783032253248"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25324-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"6 May 2026","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":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}