{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T08:10:11Z","timestamp":1746519011061,"version":"3.40.4"},"publisher-location":"Cham","reference-count":58,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031918285","type":"print"},{"value":"9783031918292","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-91829-2_2","type":"book-chapter","created":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T07:29:49Z","timestamp":1746516589000},"page":"37-75","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Securely Instantiating \u2018Half Gates\u2019 Garbling in\u00a0the\u00a0Standard Model"],"prefix":"10.1007","author":[{"given":"Anasuya","family":"Acharya","sequence":"first","affiliation":[]},{"given":"Karen","family":"Azari","sequence":"additional","affiliation":[]},{"given":"Mirza Ahad","family":"Baig","sequence":"additional","affiliation":[]},{"given":"Dennis","family":"Hofheinz","sequence":"additional","affiliation":[]},{"given":"Chethan","family":"Kamath","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,5]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-030-34621-8_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"M Abdalla","year":"2019","unstructured":"Abdalla, M., Benhamouda, F., Passel\u00e8gue, A.: Algebraic XOR-RKA-secure pseudorandom functions from post-zeroizing multilinear maps. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019, Part II. LNCS, vol. 11922, pp. 386\u2013412. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34621-8_14"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Acharya, A., Ashur, T., Cohen, E., Hazay, C., Yanai, A.: A new approach to garbled circuits. In: Tibouchi, M., Wang, X. (eds.) ACNS 23, Part\u00a0II. LNCS, vol. 13906, pp. 611\u2013641. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-33491-7_23","DOI":"10.1007\/978-3-031-33491-7_23"},{"key":"2_CR3","unstructured":"Acharya, A., Azari, K., Baig, M.A., Hofheinz, D., Kamath, C.: Securely instantiating \u2018half gates\u2019 garbling in the standard model. Cryptology ePrint Archive, Paper 2025\/281 (2025). https:\/\/eprint.iacr.org\/2025\/281"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Applebaum, B.: Garbling XOR gates \u201cfor free\u201d in the standard model. J. Cryptol. 29(3), 552\u2013576 (2016). https:\/\/doi.org\/10.1007\/s00145-015-9201-9","DOI":"10.1007\/s00145-015-9201-9"},{"key":"2_CR5","unstructured":"Applebaum, B., Harnik, D., Ishai, Y.: Semantic security under related-key attacks and applications. In: Chazelle, B. (ed.) ICS 2011, pp. 45\u201360. Tsinghua University Press (2011)"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC$$^0$$. In: 45th FOCS, pp. 166\u2013175. IEEE Computer Society Press (2004). https:\/\/doi.org\/10.1109\/FOCS.2004.20","DOI":"10.1109\/FOCS.2004.20"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-642-14165-2_14","volume-title":"Automata, Languages and Programming","author":"B Applebaum","year":"2010","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: From secrecy to soundness: efficient verification via secure computation. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010, Part I. LNCS, vol. 6198, pp. 152\u2013163. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14165-2_14"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-40084-1_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"B Applebaum","year":"2013","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E., Waters, B.: Encoding functions with constant online rate or how to compress garbled circuits keys. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 166\u2013184. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_10"},{"key":"2_CR9","doi-asserted-by":"publisher","unstructured":"Asharov, G., Segev, G.: Limits on the power of indistinguishability obfuscation and functional encryption. In: Guruswami, V. (ed.) 56th FOCS, pp. 191\u2013209. IEEE Computer Society Press (2015). https:\/\/doi.org\/10.1109\/FOCS.2015.21","DOI":"10.1109\/FOCS.2015.21"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Ball, M., Malkin, T., Rosulek, M.: Garbling gadgets for Boolean and arithmetic circuits. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 565\u2013577. ACM Press (2016). https:\/\/doi.org\/10.1145\/2976749.2978410","DOI":"10.1145\/2976749.2978410"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Barak, B., et al.: On the (im)possibility of obfuscating programs. J. ACM 59 (2012). https:\/\/doi.org\/10.1145\/2160158.2160159","DOI":"10.1145\/2160158.2160159"},{"key":"2_CR12","unstructured":"Barnum, C., Heath, D., Kolesnikov, V., Ostrovsky, R.: Adaptive garbled circuits and garbled ram from non-programmable random oracles. Cryptology ePrint Archive, Paper 2023\/1527 (2023). https:\/\/eprint.iacr.org\/2023\/1527"},{"key":"2_CR13","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 (1990). https:\/\/doi.org\/10.1145\/100216.100287","DOI":"10.1145\/100216.100287"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Bellare, M., Hoang, V.T., Keelveedhi, S., Rogaway, P.: Efficient garbling from a fixed-key blockcipher. In: 2013 IEEE Symposium on Security and Privacy, pp. 478\u2013492. IEEE Computer Society Press (2013). https:\/\/doi.org\/10.1109\/SP.2013.39","DOI":"10.1109\/SP.2013.39"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: Yu, T., Danezis, G., Gligor, V.D. (eds.) ACM CCS 2012, pp. 784\u2013796. ACM Press (2012). https:\/\/doi.org\/10.1145\/2382196.2382279","DOI":"10.1145\/2382196.2382279"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Ben-David, A., Nisan, N., Pinkas, B.: FairplayMP: a system for secure multi-party computation. In: Ning, P., Syverson, P.F., Jha, S. (eds.) ACM CCS 2008, pp. 257\u2013266. ACM Press (2008). https:\/\/doi.org\/10.1145\/1455770.1455804","DOI":"10.1145\/1455770.1455804"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-662-49096-9_20","volume-title":"Theory of Cryptography","author":"N Bitansky","year":"2016","unstructured":"Bitansky, N., Paneth, O., Wichs, D.: Perfect structure on the edge of chaos. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016, Part I. LNCS, vol. 9562, pp. 474\u2013502. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49096-9_20"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-54631-0_28","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"F B\u00f6hl","year":"2014","unstructured":"B\u00f6hl, F., Davies, G.T., Hofheinz, D.: Encryption schemes secure under related-key and key-dependent message attacks. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 483\u2013500. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_28"},{"key":"2_CR19","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, Part II. LNCS, vol. 8270, pp. 280\u2013300. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_15"},{"key":"2_CR20","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":"2_CR21","unstructured":"Brand\u00e3o, L.T.A.N., Peralta, R.: NIST first call for multi-party threshold schemes (2023). https:\/\/csrc.nist.gov\/pubs\/ir\/8214\/c\/ipd"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"Chaudhari, H., Choudhury, A., Patra, A., Suresh, A.: ASTRA: high throughput 3PC over rings with application to secure prediction. In: ACM SIGSAC 2019, pp. 81\u201392 (2019). https:\/\/doi.org\/10.1145\/3338466.3358922","DOI":"10.1145\/3338466.3358922"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Chaudhari, H., Rachuri, R., Suresh, A.: Trident: efficient 4PC framework for privacy preserving machine learning. In: NDSS 2020. The Internet Society (2020). https:\/\/www.ndss-symposium.org\/ndss-paper\/trident-efficient-4pc-framework-for-privacy-preserving-machine-learning\/","DOI":"10.14722\/ndss.2020.23005"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-030-92075-3_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"YL Chen","year":"2021","unstructured":"Chen, Y.L., Tessaro, S.: Better security-efficiency trade-offs in permutation-based two-party computation. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13091, pp. 275\u2013304. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92075-3_10"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-28914-9_3","volume-title":"Theory of Cryptography","author":"SG Choi","year":"2012","unstructured":"Choi, S.G., Katz, J., Kumaresan, R., Zhou, H.-S.: On the security of the \u201cfree-XOR\u2019\u2019 technique. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 39\u201353. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_3"},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"Cui, H., Wang, X., Yang, K., Yu, Y.: Actively secure half-gates with minimum overhead under duplex networks. In: EUROCRYPT 2023, pp. 35\u201367 (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_2","DOI":"10.1007\/978-3-031-30617-4_2"},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-14623-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"R Gennaro","year":"2010","unstructured":"Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 465\u2013482. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_25"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: On the cryptographic applications of random functions. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 276\u2013288. Springer, Heidelberg (1984)","DOI":"10.1007\/3-540-39568-7_22"},{"key":"2_CR29","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: 21st ACM STOC, pp. 25\u201332. ACM Press (1989). https:\/\/doi.org\/10.1145\/73007.73010","DOI":"10.1145\/73007.73010"},{"key":"2_CR30","doi-asserted-by":"publisher","unstructured":"Gueron, S., Lindell, Y., Nof, A., Pinkas, B.: Fast garbling of circuits under standard assumptions. In: Ray, I., Li, N., Kruegel, C. (eds.) ACM CCS 2015, pp. 567\u2013578. ACM Press (2015). https:\/\/doi.org\/10.1145\/2810103.2813619","DOI":"10.1145\/2810103.2813619"},{"key":"2_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1007\/978-3-030-56880-1_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"C Guo","year":"2020","unstructured":"Guo, C., Katz, J., Wang, X., Weng, C., Yu, Yu.: Better concrete security for half-gates garbling (in the multi-instance setting). In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part II. LNCS, vol. 12171, pp. 793\u2013822. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_28"},{"key":"2_CR32","doi-asserted-by":"publisher","unstructured":"Guo, C., Katz, J., Wang, X., Yu, Y.: Efficient and secure multiparty computation from fixed-key block ciphers. In: 2020 IEEE Symposium on Security and Privacy, pp. 825\u2013841. IEEE Computer Society Press (2020). https:\/\/doi.org\/10.1109\/SP40000.2020.00016","DOI":"10.1109\/SP40000.2020.00016"},{"key":"2_CR33","unstructured":"Guo, X., Yang, K., Wang, X., Yu, Y., Liu, Z.: Unmodified half-gates is adaptively secure - so is unmodified three-halves. Cryptology ePrint Archive, Paper 2023\/1528 (2023). https:\/\/eprint.iacr.org\/2023\/1528. https:\/\/eprint.iacr.org\/2023\/1528"},{"key":"2_CR34","doi-asserted-by":"publisher","unstructured":"Heath, D.: Efficient arithmetic in garbled circuits. In: EUROCRYPT 2024, pp. 3\u201331 (2024). https:\/\/doi.org\/10.1007\/978-3-031-58740-5_1","DOI":"10.1007\/978-3-031-58740-5_1"},{"key":"2_CR35","doi-asserted-by":"publisher","unstructured":"Heath, D., Kolesnikov, V., Ostrovsky, R.: Tri-state circuits - a circuit model that captures RAM. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0IV. LNCS, vol. 14084, pp. 128\u2013160. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_5","DOI":"10.1007\/978-3-031-38551-3_5"},{"key":"2_CR36","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":"2_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-319-63688-7_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"Z Jafargholi","year":"2017","unstructured":"Jafargholi, Z., Kamath, C., Klein, K., Komargodski, I., Pietrzak, K., Wichs, D.: Be adaptive, avoid overcommitting. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part I. LNCS, vol. 10401, pp. 133\u2013163. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_5"},{"key":"2_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/978-3-030-65277-7_33","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2020","author":"Z Jafargholi","year":"2020","unstructured":"Jafargholi, Z., Oechsner, S.: Adaptive security of practical garbling schemes. In: Bhargavan, K., Oswald, E., Prabhakaran, M. (eds.) INDOCRYPT 2020. LNCS, vol. 12578, pp. 741\u2013762. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65277-7_33"},{"key":"2_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-319-70503-3_2","volume-title":"Theory of Cryptography","author":"Z Jafargholi","year":"2017","unstructured":"Jafargholi, Z., Scafuro, A., Wichs, D.: Adaptively indistinguishable garbled circuits. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017, Part II. LNCS, vol. 10678, pp. 40\u201371. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_2"},{"key":"2_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-662-53641-4_17","volume-title":"Theory of Cryptography","author":"Z Jafargholi","year":"2016","unstructured":"Jafargholi, Z., Wichs, D.: Adaptive security of Yao\u2019s garbled circuits. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9985, pp. 433\u2013458. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_17"},{"key":"2_CR41","doi-asserted-by":"publisher","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: Khuller, S., Williams, V.V. (eds.) 53rd ACM STOC, pp. 60\u201373. ACM Press (2021). https:\/\/doi.org\/10.1145\/3406325.3451093","DOI":"10.1145\/3406325.3451093"},{"key":"2_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-030-90453-1_17","volume-title":"Theory of Cryptography","author":"C Kamath","year":"2021","unstructured":"Kamath, C., Klein, K., Pietrzak, K.: On treewidth, separators and Yao\u2019s garbling. In: Nissim, K., Waters, B. (eds.) TCC 2021, Part II. LNCS, vol. 13043, pp. 486\u2013517. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_17"},{"key":"2_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-030-84245-1_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"C Kamath","year":"2021","unstructured":"Kamath, C., Klein, K., Pietrzak, K., Wichs, D.: Limits on the adaptive security of Yao\u2019s garbling. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part II. LNCS, vol. 12826, pp. 486\u2013515. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_17"},{"key":"2_CR44","doi-asserted-by":"publisher","unstructured":"Kiayias, A., Papadopoulos, S., Triandopoulos, N., Zacharias, T.: Delegatable pseudorandom functions and applications. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013, pp. 669\u2013684. ACM Press (2013). https:\/\/doi.org\/10.1145\/2508859.2516668","DOI":"10.1145\/2508859.2516668"},{"key":"2_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-662-44381-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"V Kolesnikov","year":"2014","unstructured":"Kolesnikov, V., Mohassel, P., Rosulek, M.: FleXOR: flexible garbling for XOR gates that beats free-XOR. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part II. LNCS, vol. 8617, pp. 440\u2013457. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_25"},{"key":"2_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-540-70583-3_40","volume-title":"Automata, Languages and Programming","author":"V Kolesnikov","year":"2008","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 II. LNCS, vol. 5126, pp. 486\u2013498. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_40"},{"issue":"2","key":"2_CR47","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","volume":"22","author":"Y Lindell","year":"2009","unstructured":"Lindell, Y., Pinkas, B.: A proof of security of Yao\u2019s protocol for two-party computation. J. Cryptol. 22(2), 161\u2013188 (2009). https:\/\/doi.org\/10.1007\/s00145-008-9036-8","journal-title":"J. Cryptol."},{"key":"2_CR48","doi-asserted-by":"publisher","unstructured":"Liu, C., Wang, X.S., Nayak, K., Huang, Y., Shi, E.: Oblivm: a programming framework for secure computation. In: 2015 IEEE Symposium on Security and Privacy, SP 2015, San Jose, CA, USA, 17\u201321 May 2015, pp. 359\u2013376 (2015). https:\/\/doi.org\/10.1109\/SP.2015.29","DOI":"10.1109\/SP.2015.29"},{"key":"2_CR49","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay - secure two-party computation system. In: Blaze, M. (ed.) USENIX Security 2004, pp. 287\u2013302. USENIX Association (2004)"},{"key":"2_CR50","doi-asserted-by":"publisher","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: Proceedings of the 1st ACM Conference on Electronic Commerce, pp. 129\u2013139 (1999). https:\/\/doi.org\/10.1145\/336992.337028","DOI":"10.1145\/336992.337028"},{"key":"2_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-00457-5_22","volume-title":"Theory of Cryptography","author":"JB Nielsen","year":"2009","unstructured":"Nielsen, J.B., Orlandi, C.: LEGO for two-party secure computation. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 368\u2013386. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_22"},{"key":"2_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-10366-7_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"B Pinkas","year":"2009","unstructured":"Pinkas, B., Schneider, T., Smart, N.P., Williams, S.C.: Secure two-party computation is practical. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 250\u2013267. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_15"},{"key":"2_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-030-84242-0_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"M Rosulek","year":"2021","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 2021. LNCS, vol. 12825, pp. 94\u2013124. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_5"},{"key":"2_CR54","doi-asserted-by":"publisher","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: Shmoys, D.B. (ed.) 46th ACM STOC, pp. 475\u2013484. ACM Press (2014). https:\/\/doi.org\/10.1145\/2591796.2591825","DOI":"10.1145\/2591796.2591825"},{"key":"2_CR55","doi-asserted-by":"publisher","unstructured":"Sander, T., Young, A., Yung, M.: Non-interactive cryptocomputing for NC1. In: 40th FOCS, pp. 554\u2013567. IEEE Computer Society Press (1999). https:\/\/doi.org\/10.1109\/SFFCS.1999.814630","DOI":"10.1109\/SFFCS.1999.814630"},{"key":"2_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-77883-5_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"H Wee","year":"2021","unstructured":"Wee, H., Wichs, D.: Candidate obfuscation via oblivious LWE sampling. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part III. LNCS, vol. 12698, pp. 127\u2013156. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_5"},{"key":"2_CR57","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 (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"},{"key":"2_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-662-46803-6_8","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"S Zahur","year":"2015","unstructured":"Zahur, S., Rosulek, M., Evans, D.: Two halves make a whole. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015, Part II. LNCS, vol. 9057, pp. 220\u2013250. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_8"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91829-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T07:30:06Z","timestamp":1746516606000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91829-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031918285","9783031918292"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91829-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"R\u00f8ros","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}