{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T09:27:47Z","timestamp":1786440467730,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032354174","type":"print"},{"value":"9783032354181","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-35418-1_19","type":"book-chapter","created":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T08:30:34Z","timestamp":1786437034000},"page":"594-624","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dishonest Majority Multi-party Arithmetic Garbling with\u00a0Constant Rate"],"prefix":"10.1007","author":[{"given":"Tianyao","family":"Gu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hanjun","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elaine","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,12]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: How to garble arithmetic circuits. In: Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 120\u2013129. IEEE Computer Society, USA (2011). https:\/\/doi.org\/10.1109\/FOCS.2011.40","DOI":"10.1109\/FOCS.2011.40"},{"key":"19_CR2","doi-asserted-by":"publisher","unstructured":"Ball, M., Li, H., Lin, H., Liu, T.: New ways to garble arithmetic circuits. In: Advances in Cryptology \u2013 EUROCRYPT 2023, Part II, pp. 3\u201334. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_1","DOI":"10.1007\/978-3-031-30617-4_1"},{"key":"19_CR3","doi-asserted-by":"publisher","unstructured":"Barrett, P.: Implementing the rivest shamir and adleman public key encryption algorithm on a standard digital signal processor. In: Advances in Cryptology \u2013 CRYPTO 1986, pp. 311\u2013323. Springer (1986). https:\/\/doi.org\/10.1007\/3-540-47721-7_24","DOI":"10.1007\/3-540-47721-7_24"},{"key":"19_CR4","doi-asserted-by":"publisher","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, pp. 503\u2013513. Association for Computing Machinery, New York, NY, USA (1990). https:\/\/doi.org\/10.1145\/100216.100287","DOI":"10.1145\/100216.100287"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"D Beaver","year":"1992","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420\u2013432. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34"},{"key":"19_CR6","doi-asserted-by":"publisher","unstructured":"Beck, G., Goel, A., Hegde, A., Jain, A., Jin, Z., Kaptchuk, G.: Scalable multiparty garbling. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, CCS 2023, Copenhagen, Denmark, November 26-30, 2023, pp. 2158\u20132172. ACM (2023). https:\/\/doi.org\/10.1145\/3576915.3623132","DOI":"10.1145\/3576915.3623132"},{"key":"19_CR7","doi-asserted-by":"publisher","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, pp. 784\u2013796. Association for Computing Machinery, New York, NY, USA (2012). https:\/\/doi.org\/10.1145\/2382196.2382279","DOI":"10.1145\/2382196.2382279"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-03332-3_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"A Ben-Efraim","year":"2018","unstructured":"Ben-Efraim, A.: On multiparty garbling of arithmetic circuits. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 3\u201333. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_1"},{"key":"19_CR9","doi-asserted-by":"publisher","unstructured":"Ben-Efraim, A., Cong, K., Omri, E., Orsini, E., Smart, N.P., Soria-Vazquez, E.: Large scale, actively secure computation from LPN and free-XOR garbled circuits. In: Advances in Cryptology \u2013 EUROCRYPT 2021, Part III. vol. 12698, pp. 33\u201363. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_2","DOI":"10.1007\/978-3-030-77883-5_2"},{"key":"19_CR10","doi-asserted-by":"publisher","unstructured":"Ben-Efraim, A., Lindell, Y., Omri, E.: Optimizing semi-honest secure multiparty computation for the internet. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, p. 578\u2013590. Association for Computing Machinery, New York, NY, USA (2016). https:\/\/doi.org\/10.1145\/2976749.2978347","DOI":"10.1145\/2976749.2978347"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-319-70697-9_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"A Ben-Efraim","year":"2017","unstructured":"Ben-Efraim, A., Lindell, Y., Omri, E.: Efficient scalable constant-round MPC via garbled circuits. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 471\u2013498. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_17"},{"key":"19_CR12","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 1\u201310. Association for Computing Machinery, New York, NY, USA (1988). https:\/\/doi.org\/10.1145\/62212.62213","DOI":"10.1145\/62212.62213"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1007\/978-3-030-77886-6_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"F Benhamouda","year":"2021","unstructured":"Benhamouda, F., Jain, A., Komargodski, I., Lin, H.: Multiparty reusable non-interactive secure computation from LWE. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 724\u2013753. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_25"},{"key":"19_CR14","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory 6(3), 13:1\u201313:36 (2014). https:\/\/doi.org\/10.1145\/2633600","DOI":"10.1145\/2633600"},{"key":"19_CR15","doi-asserted-by":"publisher","unstructured":"Burkhardt, J., Damg\u00e5rd, I., Frederiksen, T.K., Ghosh, S., Orlandi, C.: Improved distributed RSA key generation using the miller-rabin test. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, CCS 2023, Copenhagen, Denmark, 26-30 November 2023, pp. 2501\u20132515. ACM (2023). https:\/\/doi.org\/10.1145\/3576915.3623163","DOI":"10.1145\/3576915.3623163"},{"key":"19_CR16","doi-asserted-by":"publisher","unstructured":"Couteau, G., Hazay, C., Hegde, A., Kumar, N.: Breaking the 1\/$$\\lambda $$-rate barrier for arithmetic garbling. In: Advances in Cryptology \u2013 EUROCRYPT 2025, Part VI, pp. 182\u2013213. Springer-Verlag, Berlin, Heidelberg (2025). https:\/\/doi.org\/10.1007\/978-3-031-91095-1_7","DOI":"10.1007\/978-3-031-91095-1_7"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-46035-7_4","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"R Cramer","year":"2002","unstructured":"Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 45\u201364. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_4"},{"key":"19_CR18","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Fitzi, M., Kiltz, E., Nielsen, J.B., Toft, T.: Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation, pp. 285\u2013304 (2006). https:\/\/doi.org\/10.1007\/11681878_15","DOI":"10.1007\/11681878_15"},{"key":"19_CR19","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N.P., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Advances in Cryptology \u2013 CRYPTO 2012, pp. 643\u2013662. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"19_CR20","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Jurik, M., Nielsen, J.B.: A generalization of paillier\u2019s public-key system with applications to electronic voting. Int. J. Inf. Secur. 9(6), 371\u2013385 (2010). https:\/\/doi.org\/10.1007\/s10207-010-0119-9","DOI":"10.1007\/s10207-010-0119-9"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/0-387-34805-0_46","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"U Feige","year":"1990","unstructured":"Feige, U., Shamir, A.: Zero knowledge proofs of knowledge in two rounds. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 526\u2013544. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_46"},{"key":"19_CR22","doi-asserted-by":"publisher","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 40\u201349 (2013). https:\/\/doi.org\/10.1109\/FOCS.2013.13","DOI":"10.1109\/FOCS.2013.13"},{"key":"19_CR23","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 169\u2013178. ACM (2009). https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"19_CR24","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 218\u2013229. Association for Computing Machinery, New York, NY, USA (1987). https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"19_CR25","doi-asserted-by":"publisher","unstructured":"Goyal, V., Li, J., Misra, A.K., Ostrovsky, R., Song, Y., Weng, C.: Dishonest majority constant-round MPC with linear communication from DDH. In: Advances in Cryptology - ASIACRYPT 2024, Part VI, pp. 167\u2013199. Springer (2024). https:\/\/doi.org\/10.1007\/978-981-96-0938-3_6","DOI":"10.1007\/978-981-96-0938-3_6"},{"key":"19_CR26","doi-asserted-by":"publisher","unstructured":"Gu, T., Ghoshal, A., Shi, E.: Zebra: arithmetic garbled RAM for large words from DCR. In: Advances in Cryptology \u2013 EUROCRYPT 2026, Part III, pp. 276\u2013306. Springer (2026). https:\/\/doi.org\/10.1007\/978-3-032-25324-8_10","DOI":"10.1007\/978-3-032-25324-8_10"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Harvey, D., van\u00a0der Hoeven, J.: Integer multiplication in time o(n log n). Annals of Mathematics (2021). https:\/\/api.semanticscholar.org\/CorpusID:109934776","DOI":"10.4007\/annals.2021.193.2.4"},{"key":"19_CR28","doi-asserted-by":"publisher","unstructured":"Hazay, C., Orsini, E., Scholl, P., Soria-Vazquez, E.: Concretely efficient large-scale MPC with active security (or, tinykeys for tinyot). In: Advances in Cryptology \u2013 ASIACRYPT 2018, Part III. vol. 11274, pp. 86\u2013117. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_4","DOI":"10.1007\/978-3-030-03332-3_4"},{"key":"19_CR29","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":"19_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/978-3-319-70694-8_21","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"C Hazay","year":"2017","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 2017. LNCS, vol. 10624, pp. 598\u2013628. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_21"},{"key":"19_CR31","doi-asserted-by":"publisher","unstructured":"Hazay, C., Yang, Y.: Toward malicious constant-rate 2pc via arithmetic garbling. In: Advances in Cryptology \u2013 EUROCRYPT 2024, Part V, pp. 401\u2013431. Springer-Verlag, Berlin, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-58740-5_14","DOI":"10.1007\/978-3-031-58740-5_14"},{"key":"19_CR32","doi-asserted-by":"publisher","unstructured":"Heath, D.: Efficient arithmetic in garbled circuits. In: Advances in Cryptology \u2013 EUROCRYPT 2024, Part V, pp. 3\u201331. Springer-Verlag, Berlin, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-58740-5_1","DOI":"10.1007\/978-3-031-58740-5_1"},{"key":"19_CR33","doi-asserted-by":"publisher","unstructured":"Heath, D., Kolesnikov, V., Narayanan, V., Ostrovsky, R., Shah, A.: Multiparty garbling from OT with linear scaling and ram support. In: Advances in Cryptology \u2013 CRYPTO 2025, Part IV, pp. 556\u2013588. Springer-Verlag, Berlin, Heidelberg (2025). https:\/\/doi.org\/10.1007\/978-3-032-01884-7_18","DOI":"10.1007\/978-3-032-01884-7_18"},{"key":"19_CR34","doi-asserted-by":"publisher","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Algorithmic Number Theory, Third International Symposium, ANTS-III, Portland, Oregon, USA, 21\u201325 June 1998, Proceedings. vol.\u00a01423, pp. 267\u2013288. Springer (1998). https:\/\/doi.org\/10.1007\/BFB0054868","DOI":"10.1007\/BFB0054868"},{"key":"19_CR35","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Li, H., Lin, H.: A unified framework for succinct garbling from homomorphic secret sharing. In: Advances in Cryptology \u2013 CRYPTO 2025, Part IV, pp. 390\u2013425. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-032-01884-7_13","DOI":"10.1007\/978-3-032-01884-7_13"},{"key":"19_CR36","doi-asserted-by":"publisher","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: STOC \u201921: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, 21\u201325 June 2021, pp. 60\u201373. ACM (2021). https:\/\/doi.org\/10.1145\/3406325.3451093","DOI":"10.1145\/3406325.3451093"},{"key":"19_CR37","unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of multidigit numbers on automata. Soviet Phys. Doklady 7, 595 (1962)"},{"key":"19_CR38","doi-asserted-by":"publisher","unstructured":"Li, H., Lin, H., Lu, G.: Succinct garbled circuits with low-depth garbling algorithms. In: Advances in Cryptology \u2013 EUROCRYPT 2026, Part III, pp. 246\u2013275. Springer (2026). https:\/\/doi.org\/10.1007\/978-3-032-25324-8_9","DOI":"10.1007\/978-3-032-25324-8_9"},{"key":"19_CR39","doi-asserted-by":"publisher","unstructured":"Li, H., Lin, H., Polychroniadou, A., Tessaro, S.: Lerna: secure single-server aggregation via key-homomorphic masking. In: Advances in Cryptology \u2013 ASIACRYPT 2023, Part I, pp. 302\u2013334. Springer-Verlag, Berlin, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-981-99-8721-4_10","DOI":"10.1007\/978-981-99-8721-4_10"},{"key":"19_CR40","doi-asserted-by":"publisher","unstructured":"Li, H., Liu, T.: How to garble mixed circuits that combine boolean and arithmetic computations. In: Advances in Cryptology \u2013 EUROCRYPT 2024, Part VI, pp. 331\u2013360. Springer-Verlag, Berlin, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_12","DOI":"10.1007\/978-3-031-58751-1_12"},{"key":"19_CR41","doi-asserted-by":"publisher","unstructured":"Li, J., Song, Y.: Honest majority constant-round MPC with linear communication from one-way functions. In: Theory of Cryptography - 23rd International Conference, TCC 2025, Aarhus, Denmark, 1\u20135 December 2025, Proceedings, Part I, pp. 3\u201332. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-032-12287-2_1","DOI":"10.1007\/978-3-032-12287-2_1"},{"key":"19_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-662-48000-7_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"Y Lindell","year":"2015","unstructured":"Lindell, Y., Pinkas, B., Smart, N.P., Yanai, A.: Efficient constant round multi-party computation combining BMR and SPDZ. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 319\u2013338. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_16"},{"key":"19_CR43","doi-asserted-by":"publisher","unstructured":"Liu, H., Wang, X., Yang, K., Yu, Y.: Authenticated BITGC for actively secure rate-one 2pc. In: Advances in Cryptology \u2013 CRYPTO 2025, Part IV, pp. 652\u2013687. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-032-01884-7_21","DOI":"10.1007\/978-3-032-01884-7_21"},{"key":"19_CR44","doi-asserted-by":"publisher","unstructured":"Liu, H., Wang, X., Yang, K., Yu, Y.: BITGC: garbled circuits with 1 bit per gate. In: Advances in Cryptology \u2013 EUROCRYPT 2025, Part VII, pp. 437\u2013466. Springer-Verlag, Berlin, Heidelberg (2025). https:\/\/doi.org\/10.1007\/978-3-031-91098-2_16","DOI":"10.1007\/978-3-031-91098-2_16"},{"key":"19_CR45","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Advances in Cryptology \u2013 EUROCRYPT 2010. vol.\u00a06110, pp. 1\u201323. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"19_CR46","doi-asserted-by":"publisher","unstructured":"Meyer, P., Orlandi, C., Roy, L., Scholl, P.: Rate-1 arithmetic garbling from homomorphic secret sharing. In: Theory of Cryptography: 22nd International Conference, TCC 2024, Milan, Italy, 2\u20136 December 2024, Proceedings, Part IV, pp. 71\u201397. Springer-Verlag, Berlin, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-78023-3_3","DOI":"10.1007\/978-3-031-78023-3_3"},{"key":"19_CR47","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: Advances in Cryptology \u2013 CRYPTO 2025, Part IV, pp. 426\u2013458. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-032-01884-7_14","DOI":"10.1007\/978-3-032-01884-7_14"},{"key":"19_CR48","doi-asserted-by":"publisher","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Advances in Cryptology \u2013 EUROCRYPT 1999, pp. 223\u2013238. Springer (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16","DOI":"10.1007\/3-540-48910-X_16"},{"key":"19_CR49","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. IACR Cryptol. ePrint Arch. 2005, \u00a0187 (2005). http:\/\/eprint.iacr.org\/2005\/187"},{"key":"19_CR50","doi-asserted-by":"publisher","unstructured":"Rachuri, R., Scholl, P.: Le mans: dynamic and fluid MPC for dishonest majority. In: Advances in Cryptology \u2013 CRYPTO 2022, Part I, pp. 719\u2013749. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_25","DOI":"10.1007\/978-3-031-15802-5_25"},{"key":"19_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-540-25937-4_22","volume-title":"Fast Software Encryption","author":"P Rogaway","year":"2004","unstructured":"Rogaway, P.: Nonce-based symmetric encryption. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol. 3017, pp. 348\u2013358. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25937-4_22"},{"key":"19_CR52","doi-asserted-by":"publisher","unstructured":"Sch\u00f6nhage, A., Strassen, V.: Schnelle multiplikation gro\u00dfer zahlen. Computing 7(3), 281\u2013292 (1971). https:\/\/doi.org\/10.1007\/BF02242355","DOI":"10.1007\/BF02242355"},{"key":"19_CR53","doi-asserted-by":"publisher","unstructured":"Wang, X., Ranellucci, S., Katz, J.: Global-scale secure multiparty computation. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 39\u201356. Association for Computing Machinery, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3133956.3133979","DOI":"10.1145\/3133956.3133979"},{"key":"19_CR54","doi-asserted-by":"publisher","unstructured":"Wang, X., Ranellucci, S., Katz, J.: Global-scale secure multiparty computation. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 39\u201356. Association for Computing Machinery, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3133956.3133979","DOI":"10.1145\/3133956.3133979"},{"key":"19_CR55","doi-asserted-by":"publisher","unstructured":"Yang, K., Wang, X., Zhang, J.: More efficient MPC from improved triple generation and authenticated garbling. In: CCS \u201920: 2020 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, USA, 9\u201313 November 2020, pp. 1627\u20131646. ACM (2020). https:\/\/doi.org\/10.1145\/3372297.3417285","DOI":"10.1145\/3372297.3417285"},{"key":"19_CR56","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science (SFCS 1986), pp. 162\u2013167 (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"},{"key":"19_CR57","doi-asserted-by":"publisher","unstructured":"Zhang, W., et al.: BITGC made (more) efficient. In: Advances in Cryptology - EUROCRYPT 2026, Part III, pp. 214\u2013245. Springer (2026). https:\/\/doi.org\/10.1007\/978-3-032-25324-8_8","DOI":"10.1007\/978-3-032-25324-8_8"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-35418-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T08:30:39Z","timestamp":1786437039000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-35418-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032354174","9783032354181"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-35418-1_19","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":"12 August 2026","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}