{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T20:36:09Z","timestamp":1786480569793,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":63,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018830","type":"print"},{"value":"9783032018847","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-032-01884-7_13","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T09:31:11Z","timestamp":1755336671000},"page":"390-425","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A Unified Framework for\u00a0Succinct Garbling from\u00a0Homomorphic Secret Sharing"],"prefix":"10.1007","author":[{"given":"Yuval","family":"Ishai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hanjun","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huijia","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Abram, D., Damg\u00e5rd, I., Orlandi, C., Scholl, P.: An algebraic framework for silent preprocessing with trustless setup and active security. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0IV. LNCS, vol. 13510, pp. 421\u2013452. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_15","DOI":"10.1007\/978-3-031-15985-5_15"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Abram, D., Roy, L., Scholl, P.: Succinct homomorphic secret sharing. In: Joye, M., Leander, G. (eds.) EUROCRYPT\u00a02024, Part\u00a0VI. LNCS, vol. 14656, pp. 301\u2013330. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_11","DOI":"10.1007\/978-3-031-58751-1_11"},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Agarwal, A., Boyle, E., Gilboa, N., Ishai, Y., Kelkar, M., Ma, Y.: Compressing unit-vector correlations via sparse pseudorandom generators. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0VIII. LNCS, vol. 14927, pp. 346\u2013383. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68397-8_11","DOI":"10.1007\/978-3-031-68397-8_11"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-662-46800-5_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015, Part I. LNCS, vol. 9056, pp. 430\u2013454. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_17"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Applebaum, B.: Garbled circuits as randomized encodings of functions: a primer. In: Lindell, Y. (ed.) Tutorials on the Foundations of Cryptography, pp. 1\u201344. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-57048-8_1","DOI":"10.1007\/978-3-319-57048-8_1"},{"key":"13_CR6","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":"13_CR7","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Computationally private randomizing polynomials and their applications. In: 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11\u201315 June 2005, San Jose, CA, USA, pp. 260\u2013274. IEEE Computer Society (2005). https:\/\/doi.org\/10.1109\/CCC.2005.9","DOI":"10.1109\/CCC.2005.9"},{"key":"13_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":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-319-96881-0_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"N Attrapadung","year":"2018","unstructured":"Attrapadung, N., Matsuda, T., Nishimaki, R., Yamada, S., Yamakawa, T.: Constrained PRFs for NC$$^1$$ in traditional groups. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part II. LNCS, vol. 10992, pp. 543\u2013574. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_19"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Ball, M., Li, H., Lin, H., Liu, T.: New ways to garble arithmetic circuits. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0II. LNCS, vol. 14005, pp. 3\u201334. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_1","DOI":"10.1007\/978-3-031-30617-4_1"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/978-3-030-26951-7_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"J Bartusek","year":"2019","unstructured":"Bartusek, J., Ma, F., Zhandry, M.: The distinction between fixed and random generators in group-based assumptions. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part II. LNCS, vol. 11693, pp. 801\u2013830. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_27"},{"key":"13_CR12","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":"13_CR13","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":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-319-78375-8_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"F Benhamouda","year":"2018","unstructured":"Benhamouda, F., Lin, H.: k-round multiparty computation from k-round oblivious transfer via garbled interactive circuits. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018, Part II. LNCS, vol. 10821, pp. 500\u2013532. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_17"},{"issue":"3","key":"13_CR15","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1137\/15M1050963","volume":"47","author":"N Bitansky","year":"2018","unstructured":"Bitansky, N., et al.: Indistinguishability obfuscation for RAM programs and succinct randomized encodings. SIAM J. Comput. 47(3), 1123\u20131210 (2018). https:\/\/doi.org\/10.1137\/15M1050963","journal-title":"SIAM J. Comput."},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-642-55220-5_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"D Boneh","year":"2014","unstructured":"Boneh, D., Gentry, C., Gorbunov, S., Halevi, S., Nikolaenko, V., Segev, G., Vaikuntanathan, V., Vinayagamurthy, D.: Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 533\u2013556. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_30"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Orr\u00f9, M.: Homomorphic secret sharing: optimizations and applications. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 2105\u20132122. ACM Press (2017). https:\/\/doi.org\/10.1145\/3133956.3134107","DOI":"10.1145\/3133956.3134107"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-662-53018-4_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"E Boyle","year":"2016","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Breaking the circuit size barrier for secure computation under DDH. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016, Part I. LNCS, vol. 9814, pp. 509\u2013539. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_19"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-56614-6_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"E Boyle","year":"2017","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Group-based secure computation: optimizing rounds, communication, and computation. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017, Part II. LNCS, vol. 10211, pp. 163\u2013193. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_6"},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Lin, H., Tessaro, S.: Foundations of homomorphic secret sharing. In: Karlin, A.R. (ed.) ITCS 2018, vol.\u00a094, pp. 21:1\u201321:21. LIPIcs (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2018.21","DOI":"10.4230\/LIPIcs.ITCS.2018.21"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-17656-3_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"E Boyle","year":"2019","unstructured":"Boyle, E., Kohl, L., Scholl, P.: Homomorphic secret sharing from lattices without FHE. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part II. LNCS, vol. 11477, pp. 3\u201333. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_1"},{"key":"13_CR22","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 (2011). https:\/\/doi.org\/10.1109\/FOCS.2011.12","DOI":"10.1109\/FOCS.2011.12"},{"key":"13_CR23","doi-asserted-by":"publisher","unstructured":"Camenisch, J., Neven, G., shelat, a.: Simulatable adaptive oblivious transfer. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 573\u2013590. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_33","DOI":"10.1007\/978-3-540-72540-4_33"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/978-3-030-75248-4_26","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"JH Cheon","year":"2021","unstructured":"Cheon, J.H., Cho, W., Kim, J.H., Kim, J.: Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions. In: Garay, J.A. (ed.) PKC 2021, Part II. LNCS, vol. 12711, pp. 739\u2013760. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_26"},{"key":"13_CR25","doi-asserted-by":"publisher","unstructured":"Cho, M., Chung, W., Ha, J., Lee, J., Oh, E., Son, M.: FRAST: TFHE-friendly cipher based on random s-boxes. IACR Trans. Symmetric Cryptol. 2024(3), 1\u201343 (2024). https:\/\/doi.org\/10.46586\/TOSC.V2024.I3.1-43","DOI":"10.46586\/TOSC.V2024.I3.1-43"},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-642-10366-7_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"SG Choi","year":"2009","unstructured":"Choi, S.G., Elbaz, A., Malkin, T., Yung, M.: Secure multi-party computation minimizing online rounds. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 268\u2013286. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_16"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Couteau, G., Hazay, C., Hegde, A., Kumar, N.: o(1\/$$\\lambda $$)-rate boolean garbling scheme from generic groups. Cryptology ePrint Archive, Paper 2025\/268 (2025). https:\/\/eprint.iacr.org\/2025\/268","DOI":"10.1007\/978-3-032-01884-7_16"},{"key":"13_CR28","doi-asserted-by":"publisher","unstructured":"Couteau, G., Meyer, P., Passel\u00e8gue, A., Riahinia, M.: Constrained pseudorandom functions from homomorphic secret sharing. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0III. LNCS, vol. 14006, pp. 194\u2013224. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_7","DOI":"10.1007\/978-3-031-30620-4_7"},{"key":"13_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I., Jurik, M.: A generalisation, a simplification and some applications of paillier\u2019s probabilistic public-key system. In: Kim, K. (ed.) PKC 2001. LNCS, vol. 1992, pp. 119\u2013136. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44586-2_9"},{"key":"13_CR30","doi-asserted-by":"publisher","unstructured":"Feige, U., Kilian, J., Naor, M.: A minimal model for secure computation (extended abstract). In: Leighton, F.T., Goodrich, M.T. (eds.) Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23\u201325 May 1994, Montr\u00e9al, Qu\u00e9bec, Canada, pp. 554\u2013563. ACM (1994). https:\/\/doi.org\/10.1145\/195058.195408","DOI":"10.1145\/195058.195408"},{"key":"13_CR31","unstructured":"Fu, X., Li, M., Lyu, S., Liu, C.: Bit-fixing correlation attacks on goldreich\u2019s pseudorandom generators. IACR Cryptol. ePrint Arch. 1594 (2024). https:\/\/eprint.iacr.org\/2024\/1594"},{"key":"13_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-319-78375-8_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"S Garg","year":"2018","unstructured":"Garg, S., Srinivasan, A.: Two-round multiparty secure computation from minimal assumptions. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 468\u2013499. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_16"},{"key":"13_CR33","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":"13_CR34","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 (2009). https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"13_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"C Gentry","year":"2013","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 2013, Part I. LNCS, vol. 8042, pp. 75\u201392. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5"},{"key":"13_CR36","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Kalai, Y.T., Popa, R.A., Vaikuntanathan, V., Zeldovich, N.: Reusable garbled circuits and succinct functional encryption. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) 45th ACM STOC, pp. 555\u2013564. ACM Press (2013). https:\/\/doi.org\/10.1145\/2488608.2488678","DOI":"10.1145\/2488608.2488678"},{"key":"13_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/3-540-36504-4_9","volume-title":"Financial Cryptography","author":"P Golle","year":"2003","unstructured":"Golle, P., Jarecki, S., Mironov, I.: Cryptographic primitives enforcing communication and storage complexity. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, pp. 120\u2013135. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36504-4_9"},{"key":"13_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-319-70503-3_18","volume-title":"Theory of Cryptography","author":"R Goyal","year":"2017","unstructured":"Goyal, R., Hohenberger, S., Koppula, V., Waters, B.: A generic approach to constructing and proving verifiable random functions. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017, Part II. LNCS, vol. 10678, pp. 537\u2013566. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_18"},{"key":"13_CR39","doi-asserted-by":"publisher","unstructured":"Grassi, L., Rechberger, C., Rotaru, D., Scholl, P., Smart, N.P.: MPC-friendly symmetric key primitives. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 430\u2013443. ACM Press (2016). https:\/\/doi.org\/10.1145\/2976749.2978332","DOI":"10.1145\/2976749.2978332"},{"key":"13_CR40","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":"13_CR41","doi-asserted-by":"publisher","unstructured":"Halevi, S., Ishai, Y., Kushilevitz, E., Rabin, T.: Additive randomized encodings and their applications. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0I. LNCS, vol. 14081, pp. 203\u2013235. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_7","DOI":"10.1007\/978-3-031-38557-5_7"},{"key":"13_CR42","doi-asserted-by":"publisher","unstructured":"Heath, D.: Efficient arithmetic in garbled circuits. In: Joye, M., Leander, G. (eds.) EUROCRYPT\u00a02024, Part\u00a0V. LNCS, vol. 14655, pp. 3\u201331. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58740-5_1","DOI":"10.1007\/978-3-031-58740-5_1"},{"key":"13_CR43","doi-asserted-by":"publisher","unstructured":"Hsieh, Y.C., Lin, H., Luo, J.: Attribute-based encryption for circuits of unbounded depth from lattices. In: 64th FOCS, pp. 415\u2013434. IEEE Computer Society Press (2023). https:\/\/doi.org\/10.1109\/FOCS57990.2023.00031","DOI":"10.1109\/FOCS57990.2023.00031"},{"key":"13_CR44","unstructured":"Ishai, Y., Li, H., Lin, H.: Succinct homomorphic MACs from groups and applications. Cryptology ePrint Archive, Paper 2024\/2073 (2024). https:\/\/eprint.iacr.org\/2024\/2073"},{"key":"13_CR45","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Li, H., Lin, H.: A unified framework for succinct garbling from homomorphic secret sharing. Cryptology ePrint Archive, Paper 2025\/442 (2025). https:\/\/eprint.iacr.org\/2025\/442","DOI":"10.1007\/978-3-032-01884-7_13"},{"key":"13_CR46","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":"13_CR47","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"},{"key":"13_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-319-78381-9_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"I Komargodski","year":"2018","unstructured":"Komargodski, I., Yogev, E.: Another step towards realizing random oracles: non-malleable point obfuscation. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 259\u2013279. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_10"},{"key":"13_CR49","doi-asserted-by":"publisher","unstructured":"Koppula, V., Lewko, A.B., Waters, B.: Indistinguishability obfuscation for Turing machines with unbounded memory. In: Servedio, R.A., Rubinfeld, R. (eds.) 47th ACM STOC, pp. 419\u2013428. ACM Press (2015). https:\/\/doi.org\/10.1145\/2746539.2746614","DOI":"10.1145\/2746539.2746614"},{"key":"13_CR50","doi-asserted-by":"publisher","unstructured":"Li, H., Liu, T.: How to garble mixed circuits that combine boolean and arithmetic computations. In: Joye, M., Leander, G. (eds.) EUROCRYPT\u00a02024, Part\u00a0VI. LNCS, vol. 14656, pp. 331\u2013360. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_12","DOI":"10.1007\/978-3-031-58751-1_12"},{"key":"13_CR51","unstructured":"Liu, H., Wang, X., Yang, K., Yu, Y.: Garbled circuits with 1 bit per gate. Cryptology ePrint Archive, Paper 2024\/1988 (2024). https:\/\/eprint.iacr.org\/2024\/1988"},{"key":"13_CR52","doi-asserted-by":"publisher","unstructured":"Meyer, P., Orlandi, C., Roy, L., Scholl, P.: Rate-1 arithmetic garbling from homomorphic secret sharing. In: Boyle, E., Mahmoody, M. (eds.) TCC 2024, Part IV. LNCS, vol. 15367, pp. 71\u201397. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-78023-3_3","DOI":"10.1007\/978-3-031-78023-3_3"},{"key":"13_CR53","doi-asserted-by":"crossref","unstructured":"Meyer, P., Orlandi, C., Roy, L., Scholl, P.: Silent circuit relinearisation: sublinear-size (boolean and arithmetic) garbled circuits from DCR. Cryptology ePrint Archive, Paper 2025\/245 (2025). https:\/\/eprint.iacr.org\/2025\/245","DOI":"10.1007\/978-3-032-01884-7_14"},{"key":"13_CR54","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, 3\u20135 November 1999, pp. 129\u2013139. ACM (1999). https:\/\/doi.org\/10.1145\/336992.337028","DOI":"10.1145\/336992.337028"},{"key":"13_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1007\/978-3-030-77870-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"C Orlandi","year":"2021","unstructured":"Orlandi, C., Scholl, P., Yakoubov, S.: The rise of paillier: homomorphic secret sharing and public-key silent OT. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part I. LNCS, vol. 12696, pp. 678\u2013708. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_24"},{"key":"13_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"key":"13_CR57","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":"13_CR58","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, Part I. LNCS, vol. 12825, pp. 94\u2013124. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_5"},{"key":"13_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/978-3-030-84252-9_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"L Roy","year":"2021","unstructured":"Roy, L., Singh, J.: Large message homomorphic secret sharing from DCR and applications. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part III. LNCS, vol. 12827, pp. 687\u2013717. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_23"},{"key":"13_CR60","doi-asserted-by":"publisher","unstructured":"Sahai, A., Seyalioglu, H.: Worry-free encryption: functional encryption with public keys. In: Al-Shaer, E., Keromytis, A.D., Shmatikov, V. (eds.) ACM CCS 2010, pp. 463\u2013472. ACM Press (2010). https:\/\/doi.org\/10.1145\/1866307.1866359","DOI":"10.1145\/1866307.1866359"},{"key":"13_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201997","author":"V Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 256\u2013266. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_18"},{"key":"13_CR62","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: Protocols for secure computations (extended abstract). In: 23rd FOCS, pp. 160\u2013164. IEEE Computer Society Press (1982). https:\/\/doi.org\/10.1109\/SFCS.1982.38","DOI":"10.1109\/SFCS.1982.38"},{"key":"13_CR63","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","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01884-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T17:29:27Z","timestamp":1785950967000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01884-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018830","9783032018847"],"references-count":63,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01884-7_13","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":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","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":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}