{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T00:30:00Z","timestamp":1766449800404,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031587399"},{"type":"electronic","value":"9783031587405"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-58740-5_1","type":"book-chapter","created":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T06:01:45Z","timestamp":1714284105000},"page":"3-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Efficient Arithmetic in\u00a0Garbled Circuits"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9589-5182","authenticated-orcid":false,"given":"David","family":"Heath","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,29]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: How to garble arithmetic circuits. In: Ostrovsky, R. (ed.) 52nd FOCS, pp. 120\u2013129. IEEE Computer Society Press (2011). https:\/\/doi.org\/10.1109\/FOCS.2011.40","key":"1_CR1","DOI":"10.1109\/FOCS.2011.40"},{"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 2023, Part II. LNCS, vol. 14005, pp. 3\u201334. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_1","key":"1_CR2","DOI":"10.1007\/978-3-031-30617-4_1"},{"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","key":"1_CR3","DOI":"10.1145\/2976749.2978410"},{"doi-asserted-by":"publisher","unstructured":"Barrett, P.: Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 311\u2013323. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_24","key":"1_CR4","DOI":"10.1007\/3-540-47721-7_24"},{"doi-asserted-by":"publisher","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":"1_CR5","DOI":"10.1007\/3-540-46766-1_34"},{"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","key":"1_CR6","DOI":"10.1145\/100216.100287"},{"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","key":"1_CR7","DOI":"10.1145\/2382196.2382279"},{"doi-asserted-by":"publisher","unstructured":"Choi, S.G., Katz, J., Kumaresan, R., Zhou, H.S.: On the security of the \u201cfree-XOR\u201d 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":"1_CR8","DOI":"10.1007\/978-3-642-28914-9_3"},{"doi-asserted-by":"publisher","unstructured":"Fleischhacker, N., Malavolta, G., Schr\u00f6der, D.: Arithmetic garbling from bilinear maps. In: Sako, K., Schneider, S., Ryan, P.Y.A. (eds.) ESORICS 2019, Part II. LNCS, vol. 11736, pp. 172\u2013192. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-29962-0_9","key":"1_CR9","DOI":"10.1007\/978-3-030-29962-0_9"},{"issue":"3","key":"1_CR10","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1007\/s00145-017-9271-y","volume":"31","author":"S Gueron","year":"2018","unstructured":"Gueron, S., Lindell, Y., Nof, A., Pinkas, B.: Fast garbling of circuits under standard assumptions. J. Cryptol. 31(3), 798\u2013844 (2018). https:\/\/doi.org\/10.1007\/s00145-017-9271-y","journal-title":"J. Cryptol."},{"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","key":"1_CR11","DOI":"10.1109\/SP40000.2020.00016"},{"doi-asserted-by":"publisher","unstructured":"Guo, X., et al.: Half-tree: halving the cost of tree expansion in COT and DPF. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part I. LNCS, vol. 14004, pp. 330\u2013362. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_12","key":"1_CR12","DOI":"10.1007\/978-3-031-30545-0_12"},{"issue":"2","key":"1_CR13","doi-asserted-by":"publisher","first-page":"563","DOI":"10.4007\/annals.2021.193.2.4","volume":"193","author":"D Harvey","year":"2021","unstructured":"Harvey, D., van der Hoeven, J.: Integer multiplication in time $$O(n \\log n)$$. Ann. Math. 193(2), 563\u2013617 (2021)","journal-title":"Ann. Math."},{"doi-asserted-by":"publisher","unstructured":"Heath, D., Kolesnikov, V.: One hot garbling. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 574\u2013593. ACM Press (2021). https:\/\/doi.org\/10.1145\/3460120.3484764","key":"1_CR14","DOI":"10.1145\/3460120.3484764"},{"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 2023, Part IV. LNCS, vol. 14084, pp. 128\u2013160. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_5","key":"1_CR15","DOI":"10.1007\/978-3-031-38551-3_5"},{"doi-asserted-by":"publisher","unstructured":"Henecka, W., K\u00f6gl, S., Sadeghi, A.R., Schneider, T., Wehrenberg, I.: TASTY: tool for automating secure two-party computations. In: Al-Shaer, E., Keromytis, A.D., Shmatikov, V. (eds.) ACM CCS 2010, pp. 451\u2013462. ACM Press (2010). https:\/\/doi.org\/10.1145\/1866307.1866358","key":"1_CR16","DOI":"10.1145\/1866307.1866358"},{"unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of many-digital numbers by automatic computers. In: SSSR Academy of Sciences (1962)","key":"1_CR17"},{"doi-asserted-by":"publisher","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.\u00a08617, pp. 440\u2013457. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_25","key":"1_CR18","DOI":"10.1007\/978-3-662-44381-1_25"},{"doi-asserted-by":"publisher","unstructured":"Kolesnikov, V., Schneider, T.: Improved garbled circuit: free XOR gates and applications. In: Aceto, L., et al. (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":"1_CR19","DOI":"10.1007\/978-3-540-70583-3_40"},{"doi-asserted-by":"publisher","unstructured":"Lu, S., Ostrovsky, R.: How to garble RAM programs. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 719\u2013734. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_42","key":"1_CR20","DOI":"10.1007\/978-3-642-38348-9_42"},{"doi-asserted-by":"crossref","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. ACM (1999)","key":"1_CR21","DOI":"10.1145\/336992.337028"},{"doi-asserted-by":"publisher","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":"1_CR22","DOI":"10.1007\/978-3-642-10366-7_15"},{"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 2021, Part I. LNCS, vol. 12825, pp. 94\u2013124. Springer, Heidelberg, Virtual Event (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_5","key":"1_CR23","DOI":"10.1007\/978-3-030-84242-0_5"},{"unstructured":"Wang, X., Malozemoff, A.J., Katz, J.: EMP-toolkit: efficient MultiParty computation toolkit (2016). https:\/\/github.com\/emp-toolkit","key":"1_CR24"},{"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","key":"1_CR25","DOI":"10.1109\/SFCS.1986.25"},{"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 2015, Part II. LNCS, vol. 9057, pp. 220\u2013250. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_8","key":"1_CR26","DOI":"10.1007\/978-3-662-46803-6_8"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-58740-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,12]],"date-time":"2024-05-12T23:06:51Z","timestamp":1715555211000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58740-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031587399","9783031587405"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58740-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 April 2024","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":"Zurich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}