{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T15:49:54Z","timestamp":1783612194400,"version":"3.55.0"},"publisher-location":"Cham","reference-count":62,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031910975","type":"print"},{"value":"9783031910982","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-91098-2_16","type":"book-chapter","created":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T08:44:21Z","timestamp":1745743461000},"page":"437-466","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["BitGC: Garbled Circuits with\u00a01 Bit per\u00a0Gate"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3843-1394","authenticated-orcid":false,"given":"Hanlin","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5991-7417","authenticated-orcid":false,"given":"Xiao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7453-4043","authenticated-orcid":false,"given":"Kang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9278-4521","authenticated-orcid":false,"given":"Yu","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,4,28]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-63688-7_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"S Agrawal","year":"2017","unstructured":"Agrawal, S.: Stronger security for reusable garbled circuits, general definitions and attacks. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part I. LNCS, vol. 10401, pp. 3\u201335. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_1"},{"key":"16_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-031-68397-8_9","volume-title":"CRYPTO 2024, Part VIII","author":"N Alamati","year":"2024","unstructured":"Alamati, N., Policharla, G.V., Raghuraman, S., Rindal, P.: Improved alternating-moduli PRFs and post-quantum signatures. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part VIII. LNCS, vol. 14927, pp. 274\u2013308. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68397-8_9"},{"key":"16_CR3","doi-asserted-by":"publisher","unstructured":"Alekhnovich, M.: More on average case vs approximation complexity. In: 44th FOCS, pp. 298\u2013307. IEEE Computer Society Press (2003). https:\/\/doi.org\/10.1109\/SFCS.2003.1238204","DOI":"10.1109\/SFCS.2003.1238204"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-030-03810-6_17","volume-title":"Theory of Cryptography","author":"P Ananth","year":"2018","unstructured":"Ananth, P., Lombardi, A.: Succinct garbling schemes from functional encryption through a local simulation paradigm. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018, Part II. LNCS, vol. 11240, pp. 455\u2013472. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_17"},{"key":"16_CR5","doi-asserted-by":"publisher","unstructured":"Applebaum, B.: Pseudorandom generators with long stretch and low locality from random local one-way functions. In: Karloff, H.J., Pitassi, T. (eds.) 44th ACM STOC, pp. 805\u2013816. ACM Press (2012). https:\/\/doi.org\/10.1145\/2213977.2214050","DOI":"10.1145\/2213977.2214050"},{"key":"16_CR6","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Barak, B., Wigderson, A.: Public-key cryptography from different assumptions. In: Schulman, L.J. (ed.) 42nd ACM STOC, pp. 171\u2013180. ACM Press (2010). https:\/\/doi.org\/10.1145\/1806689.1806714","DOI":"10.1145\/1806689.1806714"},{"key":"16_CR7","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"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/s00037-007-0237-6","volume":"17","author":"B Applebaum","year":"2008","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: On pseudorandom generators with linear stretch in $${\\rm nc}^{\\text{0 }}$$. Comput. Complex. 17(1), 38\u201369 (2008)","journal-title":"Comput. Complex."},{"key":"16_CR9","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Kachlon, E.: Sampling graphs without forbidden subgraphs and unbalanced expanders with negligible error. In: Zuckerman, D. (ed.) 60th FOCS, pp. 171\u2013179. IEEE Computer Society Press (2019). https:\/\/doi.org\/10.1109\/FOCS.2019.00020","DOI":"10.1109\/FOCS.2019.00020"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/978-3-642-29011-4_42","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Banerjee","year":"2012","unstructured":"Banerjee, A., Peikert, C., Rosen, A.: Pseudorandom functions and lattices. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 719\u2013737. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_42"},{"key":"16_CR11","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":"16_CR12","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":"16_CR13","doi-asserted-by":"publisher","unstructured":"Ben-Efraim, A., Lindell, Y., Omri, E.: Optimizing semi-honest secure multiparty computation for the internet. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 578\u2013590. ACM Press (2016). https:\/\/doi.org\/10.1145\/2976749.2978347","DOI":"10.1145\/2976749.2978347"},{"key":"16_CR14","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Garg, S., Lin, H., Pass, R., Telang, S.: Succinct randomized encodings and their applications. In: Servedio, R.A., Rubinfeld, R. (eds.) 47th ACM STOC, pp. 439\u2013448. ACM Press (2015). https:\/\/doi.org\/10.1145\/2746539.2746574","DOI":"10.1145\/2746539.2746574"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-030-75248-4_19","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"A Bois","year":"2021","unstructured":"Bois, A., Cascudo, I., Fiore, D., Kim, D.: Flexible and efficient verifiable computation on encrypted data. In: Garay, J.A. (ed.) PKC 2021, Part II. LNCS, vol. 12711, pp. 528\u2013558. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_19"},{"key":"16_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., et al.: 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":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/978-3-030-03810-6_25","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2018","unstructured":"Boneh, D., Ishai, Y., Passel\u00e8gue, A., Sahai, A., Wu, D.J.: Exploring crypto dark matter: new simple PRF candidates and their applications. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018, Part II. LNCS, vol. 11240, pp. 699\u2013729. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_25"},{"key":"16_CR18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-031-22966-4_7","volume-title":"ASIACRYPT 2022, Part II","author":"C Bonte","year":"2022","unstructured":"Bonte, C., Iliashenko, I., Park, J., Pereira, H., Smart, N.P.: FINAL: faster FHE instantiated with NTRU and LWE. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, Part II. LNCS, vol. 13792, pp. 188\u2013215. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_7"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-45239-0_4","volume-title":"Cryptography and Coding","author":"JW Bos","year":"2013","unstructured":"Bos, J.W., Lauter, K., Loftus, J., Naehrig, M.: Improved security for a ring-based fully homomorphic encryption scheme. In: Stam, M. (ed.) IMACC 2013. LNCS, vol. 8308, pp. 45\u201364. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45239-0_4"},{"key":"16_CR20","series-title":"LNCS","first-page":"3","volume-title":"EUROCRYPT 2019, Part II","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)"},{"key":"16_CR21","doi-asserted-by":"publisher","unstructured":"Canetti, R., Holmgren, J., Jain, A., Vaikuntanathan, V.: Succinct garbling and indistinguishability obfuscation for RAM programs. In: Servedio, R.A., Rubinfeld, R. (eds.) 47th ACM STOC, pp. 429\u2013437. ACM Press (2015). https:\/\/doi.org\/10.1145\/2746539.2746621","DOI":"10.1145\/2746539.2746621"},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-642-38348-9_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"D Catalano","year":"2013","unstructured":"Catalano, D., Fiore, D.: Practical homomorphic MACs for arithmetic circuits. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 336\u2013352. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_21"},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/3-540-44683-4_24","volume-title":"Mathematical Foundations of Computer Science 2001","author":"M Cryan","year":"2001","unstructured":"Cryan, M., Miltersen, P.B.: On pseudorandom generators in NC0. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 272\u2013284. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44683-4_24"},{"key":"16_CR24","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-030-84259-8_18","volume-title":"CRYPTO 2021, Part IV","author":"I Dinur","year":"2021","unstructured":"Dinur, I., et al.: MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part IV. LNCS, vol. 12828, pp. 517\u2013547. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_18"},{"key":"16_CR25","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-319-63688-7_18","volume-title":"CRYPTO 2017, Part I","author":"N D\u00f6ttling","year":"2017","unstructured":"D\u00f6ttling, N., Garg, S.: Identity-based encryption from the Diffie-Hellman assumption. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part I. LNCS, vol. 10401, pp. 537\u2013569. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_18"},{"key":"16_CR26","doi-asserted-by":"publisher","unstructured":"Fiore, D., Gennaro, R., Pastro, V.: Efficiently verifiable computation on encrypted data. In: Ahn, G.J., Yung, M., Li, N. (eds.) ACM CCS 2014, pp. 844\u2013855. ACM Press (2014). https:\/\/doi.org\/10.1145\/2660267.2660366","DOI":"10.1145\/2660267.2660366"},{"key":"16_CR27","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-030-45388-6_5","volume-title":"PKC 2020, Part II","author":"D Fiore","year":"2020","unstructured":"Fiore, D., Nitulescu, A., Pointcheval, D.: Boosting verifiable computation on encrypted data. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020, Part II. LNCS, vol. 12111, pp. 124\u2013154. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_5"},{"issue":"4","key":"16_CR28","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00145-023-09481-3","volume":"36","author":"C Ganesh","year":"2023","unstructured":"Ganesh, C., Nitulescu, A., Soria-Vazquez, E.: Rinocchio: SNARKs for ring arithmetic. J. Cryptol. 36(4), 41 (2023). https:\/\/doi.org\/10.1007\/s00145-023-09481-3","journal-title":"J. Cryptol."},{"key":"16_CR29","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-642-42045-0_16","volume-title":"ASIACRYPT 2013, Part II","author":"R Gennaro","year":"2013","unstructured":"Gennaro, R., Wichs, D.: Fully homomorphic message authenticators. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part II. LNCS, vol. 8270, pp. 301\u2013320. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_16"},{"key":"16_CR30","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":"16_CR31","unstructured":"Gentry, C., Gorbunov, S., Halevi, S., Vaikuntanathan, V., Vinayagamurthy, D.: How to compress (reusable) garbled circuits. Cryptology ePrint Archive, Report 2013\/687 (2013). https:\/\/eprint.iacr.org\/2013\/687"},{"key":"16_CR32","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","volume-title":"CRYPTO 2013, Part I","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":"16_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-22670-0_10","volume-title":"Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation","author":"O Goldreich","year":"2011","unstructured":"Goldreich, O.: Candidate one-way functions based on expander graphs. In: Goldreich, O. (ed.) Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation. LNCS, vol. 6650, pp. 76\u201387. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22670-0_10"},{"key":"16_CR34","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":"16_CR35","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"},{"issue":"1","key":"16_CR36","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10623-016-0326-0","volume":"86","author":"G Herold","year":"2018","unstructured":"Herold, G., Kirshanova, E., May, A.: On the asymptotic complexity of solving LWE. Des. Codes Crypt. 86(1), 55\u201383 (2018)","journal-title":"Des. Codes Crypt."},{"key":"16_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267\u2013288. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054868"},{"key":"16_CR38","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":"16_CR39","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Cryptography with constant computational overhead. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 433\u2013442. ACM Press (2008). https:\/\/doi.org\/10.1145\/1374376.1374438","DOI":"10.1145\/1374376.1374438"},{"key":"16_CR40","unstructured":"Ishai, Y., Li, H., Lin, H.: Succinct partial garbling from groups and applications. Cryptology ePrint Archive, Paper 2024\/2073 (2024). https:\/\/eprint.iacr.org\/2024\/2073"},{"key":"16_CR41","doi-asserted-by":"publisher","unstructured":"Jawurek, M., Kerschbaum, F., Orlandi, C.: Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013, pp. 955\u2013966. ACM Press (2013). https:\/\/doi.org\/10.1145\/2508859.2516662","DOI":"10.1145\/2508859.2516662"},{"key":"16_CR42","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1007\/978-3-662-48797-6_31","volume-title":"ASIACRYPT 2015, Part I","author":"C Kempka","year":"2015","unstructured":"Kempka, C., Kikuchi, R., Kiyoshima, S., Suzuki, K.: Garbling scheme for formulas with constant size of garbled gates. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015, Part I. LNCS, vol. 9452, pp. 758\u2013782. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_31"},{"key":"16_CR43","doi-asserted-by":"publisher","unstructured":"Kluczniak, K.: NTRU-V-UM: secure fully homomorphic encryption from NTRU with small modulus. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 1783\u20131797. ACM Press (2022). https:\/\/doi.org\/10.1145\/3548606.3560700","DOI":"10.1145\/3548606.3560700"},{"key":"16_CR44","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-662-44381-1_25","volume-title":"CRYPTO 2014, Part II","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":"16_CR45","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-540-70583-3_40","volume-title":"ICALP 2008, Part II","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":"16_CR46","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":"16_CR47","unstructured":"Lin, H., Pass, R.: Succinct garbling schemes and applications. Cryptology ePrint Archive, Report 2014\/766 (2014). https:\/\/eprint.iacr.org\/2014\/766"},{"issue":"2","key":"16_CR48","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."},{"issue":"2","key":"16_CR49","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/s00145-014-9177-x","volume":"28","author":"Y Lindell","year":"2015","unstructured":"Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. J. Cryptol. 28(2), 312\u2013350 (2015). https:\/\/doi.org\/10.1007\/s00145-014-9177-x","journal-title":"J. Cryptol."},{"key":"16_CR50","unstructured":"Liu, H., Wang, X., Yang, K., Yu, Y.: BitGC: garbled circuits with 1 bit per gate. Cryptology ePrint Archive, Paper 2024\/1988 (2024). https:\/\/eprint.iacr.org\/2024\/1988"},{"key":"16_CR51","unstructured":"Liu, H., Wang, X., Yang, K., Yu, Y.: Authenticated BitGC for Actively Secure Rate-One 2PC. Cryptology ePrint Archive, Paper 2025\/232 (2025). https:\/\/eprint.iacr.org\/2025\/232"},{"key":"16_CR52","doi-asserted-by":"publisher","unstructured":"L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V.: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In: Karloff, H.J., Pitassi, T. (eds.) 44th ACM STOC, pp. 1219\u20131234. ACM Press (2012). https:\/\/doi.org\/10.1145\/2213977.2214086","DOI":"10.1145\/2213977.2214086"},{"key":"16_CR53","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"EUROCRYPT 2010","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1\u201323. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1"},{"key":"16_CR54","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Voulgaris, P.: A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations. In: Schulman, L.J. (ed.) 42nd ACM STOC, pp. 351\u2013358. ACM Press (2010). https:\/\/doi.org\/10.1145\/1806689.1806738","DOI":"10.1145\/1806689.1806738"},{"key":"16_CR55","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: Proceedings of the First ACM Conference on Electronic Commerce (EC-99), pp. 129\u2013139. ACM (1999)","DOI":"10.1145\/336992.337028"},{"key":"16_CR56","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-92062-3_1","volume-title":"ASIACRYPT 2021, Part I","author":"A Pellet-Mary","year":"2021","unstructured":"Pellet-Mary, A., Stehl\u00e9, D.: On the hardness of the NTRU problem. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021, Part I. LNCS, vol. 13090, pp. 3\u201335. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_1"},{"key":"16_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":"16_CR58","doi-asserted-by":"publisher","unstructured":"Quach, W., Wee, H., Wichs, D.: Laconic function evaluation and applications. In: Thorup, M. (ed.) 59th FOCS, pp. 859\u2013870. IEEE Computer Society Press (2018). https:\/\/doi.org\/10.1109\/FOCS.2018.00086","DOI":"10.1109\/FOCS.2018.00086"},{"key":"16_CR59","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-030-84242-0_5","volume-title":"CRYPTO 2021, Part I","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":"16_CR60","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C Schnorr","year":"1994","unstructured":"Schnorr, C., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66, 181\u2013199 (1994)","journal-title":"Math. Program."},{"key":"16_CR61","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":"16_CR62","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-662-46803-6_8","volume-title":"EUROCRYPT 2015, Part II","author":"S Zahur","year":"2015","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"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91098-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T08:44:27Z","timestamp":1745743467000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91098-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031910975","9783031910982"],"references-count":62,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91098-2_16","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":"28 April 2025","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":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"4 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}