{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,6]],"date-time":"2026-11-06T04:12:26Z","timestamp":1793938346575,"version":"4.8.0"},"publisher-location":"Cham","reference-count":69,"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_21","type":"book-chapter","created":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T08:35:09Z","timestamp":1786437309000},"page":"658-691","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["SIMD HSS and\u00a0aHMAC from\u00a0Interval Encoding with\u00a0Application to\u00a0One-Bit-Per-Gate Garbling"],"prefix":"10.1007","author":[{"given":"Jaehyung","family":"Kim","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"}]},{"given":"Zeyu","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,12]]},"reference":[{"key":"21_CR1","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-031-15985-5_15","volume-title":"CRYPTO 2022, Part IV","author":"D Abram","year":"2022","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 2022, Part IV. LNCS, vol. 13510, pp. 421\u2013452. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_15"},{"key":"21_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-31371-4_1","volume-title":"PKC 2023, Part II","author":"T Attema","year":"2023","unstructured":"Attema, T., Capit\u00e3o, P., Kohl, L.: On homomorphic secret sharing from polynomial-modulus LWE. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC 2023, Part II. LNCS, vol. 13941, pp. 3\u201332. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31371-4_1"},{"key":"21_CR3","doi-asserted-by":"publisher","unstructured":"Bae, Y., Cheon, J.H., Hanrot, G., Park, J.H., Stehl\u00e9, D.: Plaintext-ciphertext matrix multiplication and FHE bootstrapping: fast and fused. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0III. LNCS, vol. 14922. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68382-4_12","DOI":"10.1007\/978-3-031-68382-4_12"},{"key":"21_CR4","doi-asserted-by":"publisher","unstructured":"Bae, Y., Cheon, J.H., Kim, J., Park, J.H., Stehl\u00e9, D.: HERMES: Efficient ring packing using MLWE ciphertexts and application to transciphering. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0IV. LNCS, vol. 14084. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_2","DOI":"10.1007\/978-3-031-38551-3_2"},{"key":"21_CR5","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-031-58723-8_4","volume-title":"EUROCRYPT 2024, Part II","author":"Y Bae","year":"2024","unstructured":"Bae, Y., Cheon, J.H., Kim, J., Stehl\u00e9, D.: Bootstrapping bits with CKKS. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part II. LNCS, vol. 14652, pp. 94\u2013123. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58723-8_4"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Bellare, M., Hoang, V.T., Keelveedhi, S., Rogaway, P.: Efficient garbling from a fixed-key blockcipher. In: 2013 IEEE Symposium on Security and Privacy, pp. 478\u2013492. IEEE Computer Society Press (2013)","DOI":"10.1109\/SP.2013.39"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Benhamouda, F., et al.: Encrypted matrix-vector products from secret dual codes. CCS\u201925 (2025). https:\/\/eprint.iacr.org\/2025\/858","DOI":"10.1145\/3719027.3765194"},{"key":"21_CR8","doi-asserted-by":"publisher","unstructured":"Bitansky, N., et al.: Indistinguishability obfuscation for RAM programs and succinct randomized encodings. SIAM J. Comput. 47(3) (2018). https:\/\/doi.org\/10.1137\/15M1050963","DOI":"10.1137\/15M1050963"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Boemer, F., Kim, S., Seifu, G., D.M.\u00a0de Souza, F., Gopal, V.: Intel HEXL: accelerating homomorphic encryption with intel AVX512-IFMA52. In: Proceedings of the 9th on Workshop on Encrypted Computing & Applied Homomorphic Cryptography. WAHC \u201921, Association for Computing Machinery, New York, NY, USA (2021). https:\/\/doi.org\/10.1145\/3474366.3486926","DOI":"10.1145\/3474366.3486926"},{"key":"21_CR10","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":"21_CR11","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018, pp. 896\u2013912. ACM Press (2018)","DOI":"10.1145\/3243734.3243868"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-030-26954-8_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"E Boyle","year":"2019","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators: silent OT extension and more. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 489\u2013518. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-662-46803-6_12","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"E Boyle","year":"2015","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 337\u2013367. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_12"},{"key":"21_CR14","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. LNCS, vol. 9814, pp. 509\u2013539. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_19"},{"key":"21_CR15","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. LNCS, vol. 10211, pp. 163\u2013193. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_6"},{"key":"21_CR16","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)"},{"key":"21_CR17","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. LNCS, vol. 11477, pp. 3\u201333. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_1"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"Z Brakerski","year":"2012","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 868\u2013886. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50"},{"key":"21_CR19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-64375-1_1","volume-title":"TCC 2020, Part I","author":"Z Brakerski","year":"2020","unstructured":"Brakerski, Z., D\u00f6ttling, N.: Lossiness and entropic hardness for ring-LWE. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part I. LNCS, vol. 12550, pp. 1\u201327. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_1"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory 6(3) (2014). https:\/\/doi.org\/10.1145\/2633600","DOI":"10.1145\/2633600"},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-22792-9_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Z Brakerski","year":"2011","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 505\u2013524. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_29"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Braverman, M., Newman, S.: Practical secure delegated linear algebra with trapdoored matrices (2025). https:\/\/arxiv.org\/abs\/2502.13060","DOI":"10.1007\/978-3-032-12287-2_4"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Chen, H., Dai, W., Kim, M., Song, Y.: Efficient multi-key homomorphic encryption with packed ciphertexts with application to oblivious neural network inference. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, pp. 395\u2013412. ACM Press (2019)","DOI":"10.1145\/3319535.3363207"},{"key":"21_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-319-78381-9_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"H Chen","year":"2018","unstructured":"Chen, H., Han, K.: Homomorphic lower digits removal and improved FHE bootstrapping. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 315\u2013337. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_12"},{"key":"21_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-319-78381-9_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"JH Cheon","year":"2018","unstructured":"Cheon, J.H., Han, K., Kim, A., Kim, M., Song, Y.: Bootstrapping for approximate homomorphic encryption. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 360\u2013384. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_14"},{"key":"21_CR26","unstructured":"Cheon, J.H., Kang, M., Park, J.H.: Towards lightweight CKKS: On client cost efficiency. Cryptology ePrint Archive, Paper 2025\/720 (2025). https:\/\/eprint.iacr.org\/2025\/720"},{"key":"21_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-319-70694-8_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"JH Cheon","year":"2017","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 409\u2013437. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_15"},{"key":"21_CR28","doi-asserted-by":"crossref","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: TFHE: Fast fully homomorphic encryption over the torus. J. Cryptol. 33(1) (2020)","DOI":"10.1007\/s00145-019-09319-x"},{"key":"21_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-030-17656-3_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"G Couteau","year":"2019","unstructured":"Couteau, G.: A note on the communication complexity of multiparty computation in the correlated randomness model. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 473\u2013503. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_17"},{"key":"21_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1007\/978-3-030-77886-6_29","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"G Couteau","year":"2021","unstructured":"Couteau, G., Meyer, P.: Breaking the circuit size barrier for secure computation under quasi-polynomial LPN. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 842\u2013870. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_29"},{"key":"21_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-662-53015-3_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"Y Dodis","year":"2016","unstructured":"Dodis, Y., Halevi, S., Rothblum, R.D., Wichs, D.: Spooky encryption and its applications. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9816, pp. 93\u2013122. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_4"},{"key":"21_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-662-46800-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"L Ducas","year":"2015","unstructured":"Ducas, L., Micciancio, D.: FHEW: bootstrapping homomorphic encryption in less than a second. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 617\u2013640. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_24"},{"key":"21_CR33","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Report 2012\/144 (2012). https:\/\/eprint.iacr.org\/2012\/144"},{"key":"21_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-319-68637-0_23","volume-title":"Provable Security","author":"N Fazio","year":"2017","unstructured":"Fazio, N., Gennaro, R., Jafarikhah, T., Skeith, W.E.: Homomorphic secret sharing from paillier encryption. In: Okamoto, T., Yu, Y., Au, M.H., Li, Y. (eds.) ProvSec 2017. LNCS, vol. 10592, pp. 381\u2013399. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68637-0_23"},{"key":"21_CR35","doi-asserted-by":"crossref","unstructured":"Gama, M., Beni, E.H., Kang, J., Spiessens, J., Vercauteren, F.: Blind zkSNARKs for private proof delegation and verifiable computation over encrypted data. Cryptology ePrint Archive, Report 2024\/1684 (2024). https:\/\/eprint.iacr.org\/2024\/1684","DOI":"10.62056\/akgyl8n4e"},{"key":"21_CR36","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed.) 41st ACM STOC, pp. 169\u2013178. ACM Press (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"21_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-32928-9_2","volume-title":"Security and Cryptography for Networks","author":"C Gentry","year":"2012","unstructured":"Gentry, C., Halevi, S., Peikert, C., Smart, N.P.: Ring switching in BGV-style homomorphic encryption. In: Visconti, I., De Prisco, R. (eds.) SCN 2012. LNCS, vol. 7485, pp. 19\u201337. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32928-9_2"},{"key":"21_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-29011-4_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"C Gentry","year":"2012","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Fully homomorphic encryption with polylog overhead. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 465\u2013482. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_28"},{"key":"21_CR39","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. LNCS, vol. 8042, pp. 75\u201392. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5"},{"key":"21_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1007\/978-3-642-55220-5_35","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"N Gilboa","year":"2014","unstructured":"Gilboa, N., Ishai, Y.: Distributed point functions and their applications. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 640\u2013658. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_35"},{"key":"21_CR41","doi-asserted-by":"crossref","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)","DOI":"10.1145\/2488608.2488678"},{"key":"21_CR42","doi-asserted-by":"crossref","unstructured":"Guimar\u00e3es, A., Pereira, H.V.L.: Fast amortized bootstrapping with small keys and polynomial noise overhead. CCS\u201925 (2025). https:\/\/eprint.iacr.org\/2025\/686","DOI":"10.1145\/3719027.3765181"},{"key":"21_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-319-96884-1_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"S Halevi","year":"2018","unstructured":"Halevi, S., Shoup, V.: Faster homomorphic linear transformations in HElib. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 93\u2013120. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_4"},{"key":"21_CR44","doi-asserted-by":"crossref","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)","DOI":"10.1109\/FOCS57990.2023.00031"},{"key":"21_CR45","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Li, H., Lin, H.: Succinct homomorphic MACs from groups and applications. In: 66th FOCS, pp. 2505\u20132545. IEEE Computer Society Press (2025)","DOI":"10.1109\/FOCS63196.2025.00131"},{"key":"21_CR46","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-032-01884-7_13","volume-title":"CRYPTO 2025, Part IV","author":"Y Ishai","year":"2025","unstructured":"Ishai, Y., Li, H., Lin, H.: A unified framework for succinct garbling from homomorphic secret sharing. In: Kalai, Y.T., Kamara, S.F. (eds.) CRYPTO 2025, Part IV. LNCS, vol. 16003, pp. 390\u2013425. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01884-7_13"},{"key":"21_CR47","unstructured":"Kim, J., Li, H., Lin, H., Liu, Z.: SIMD HSS and aHMAC from interval encoding with application to one-bit-per-gate garbling. Cryptology ePrint Archive, Paper 2026\/485 (2026). https:\/\/eprint.iacr.org\/2026\/485"},{"key":"21_CR48","doi-asserted-by":"crossref","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)","DOI":"10.1145\/2746539.2746614"},{"key":"21_CR49","doi-asserted-by":"publisher","unstructured":"Lee, J.W., et al.: Privacy-preserving machine learning with fully homomorphic encryption for deep neural network. IEEE Access 10 (2022). https:\/\/doi.org\/10.1109\/ACCESS.2022.3159694","DOI":"10.1109\/ACCESS.2022.3159694"},{"key":"21_CR50","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-8736-8_2","volume-title":"Advances in Cryptology - ASIACRYPT 2023","author":"JW Lee","year":"2023","unstructured":"Lee, J.W., Lee, E., Kim, Y.S., No, J.S.: Rotation key reduction for client-server systems of deep neural network on fully homomorphic encryption. In: Guo, J., Steinfeld, R. (eds.) Advances in Cryptology - ASIACRYPT 2023. Springer Nature Singapore, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8736-8_2"},{"key":"21_CR51","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-031-91098-2_16","volume-title":"EUROCRYPT 2025, Part VII","author":"H Liu","year":"2025","unstructured":"Liu, H., Wang, X., Yang, K., Yu, Y.: BitGC: Garbled circuits with 1 bit per gate. In: Fehr, S., Fouque, P.A. (eds.) EUROCRYPT 2025, Part VII. LNCS, vol. 15607, pp. 437\u2013466. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91098-2_16"},{"key":"21_CR52","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1007\/978-3-031-15802-5_26","volume-title":"CRYPTO 2022, Part I","author":"Z Liu","year":"2022","unstructured":"Liu, Z., Tromer, E.: Oblivious message retrieval. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part I. LNCS, vol. 13507, pp. 753\u2013783. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_26"},{"key":"21_CR53","doi-asserted-by":"crossref","unstructured":"Liu, Z., Tromer, E., Wang, Y.: Group oblivious message retrieval. In: 2024 IEEE Symposium on Security and Privacy, pp. 4367\u20134385. IEEE Computer Society Press (2024)","DOI":"10.1109\/SP54263.2024.00115"},{"key":"21_CR54","doi-asserted-by":"publisher","unstructured":"Liu, Z., Wang, Y.: Amortized functional bootstrapping in less than 7 MS, with \u00d5(1) polynomial multiplications. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT\u00a02023, Part\u00a0VI. LNCS, vol. 14443. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8736-8_4","DOI":"10.1007\/978-981-99-8736-8_4"},{"key":"21_CR55","doi-asserted-by":"publisher","unstructured":"Liu, Z., Wang, Y.: Relaxed functional bootstrapping: a new perspective on BGV\/BFV bootstrapping. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT\u00a02024, Part\u00a0I. LNCS, vol. 15484. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0875-1_7","DOI":"10.1007\/978-981-96-0875-1_7"},{"key":"21_CR56","doi-asserted-by":"crossref","unstructured":"Lu, W., Huang, Z., Hong, C., Ma, Y., Qu, H.: PEGASUS: bridging polynomial and non-polynomial evaluations in homomorphic encryption. In: 2021 IEEE Symposium on Security and Privacy. IEEE Computer Society Press (2021)","DOI":"10.1109\/SP40001.2021.00043"},{"key":"21_CR57","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-031-78023-3_3","volume-title":"TCC 2024, Part IV","author":"P Meyer","year":"2024","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 (Dec (2024). https:\/\/doi.org\/10.1007\/978-3-031-78023-3_3"},{"key":"21_CR58","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-032-01884-7_14","volume-title":"CRYPTO 2025, Part IV","author":"P Meyer","year":"2025","unstructured":"Meyer, P., Orlandi, C., Roy, L., Scholl, P.: Silent circuit relinearisation: Sublinear-size (Boolean and Arithmetic) garbled circuits from DCR. In: Kalai, Y.T., Kamara, S.F. (eds.) CRYPTO 2025, Part IV. LNCS, vol. 16003, pp. 426\u2013458. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01884-7_14"},{"key":"21_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-642-32009-5_40","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"JB Nielsen","year":"2012","unstructured":"Nielsen, J.B., Nordholt, P.S., Orlandi, C., Burra, S.S.: A new approach to practical active-secure two-party computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 681\u2013700. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_40"},{"key":"21_CR60","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. LNCS, vol. 12696, pp. 678\u2013708. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_24"},{"key":"21_CR61","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: Fuzzy identity based encryption. Eurocrypt (2005). https:\/\/eprint.iacr.org\/2004\/086","DOI":"10.1007\/11426639_27"},{"key":"21_CR62","unstructured":"Microsoft SEAL (2025). https:\/\/github.com\/Microsoft\/SEAL"},{"key":"21_CR63","doi-asserted-by":"crossref","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic SIMD operations. DCC 71(1) (2014)","DOI":"10.1007\/s10623-012-9720-4"},{"key":"21_CR64","unstructured":"Vaikuntanathan, V., Zamir, O.: Improving algorithmic efficiency using cryptography (2025). https:\/\/arxiv.org\/abs\/2502.13065"},{"key":"21_CR65","unstructured":"Wang, F., Yun, C., Goldwasser, S., Vaikuntanathan, V., Zaharia, M.: Splinter: practical private queries on public data. In: Proceedings of the 14th USENIX Conference on Networked Systems Design and Implementation. NSDI\u201917, USENIX Association, USA (2017)"},{"key":"21_CR66","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Protocols for secure computations (extended abstract). In: 23rd FOCS, pp. 160\u2013164. IEEE Computer Society Press (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"21_CR67","unstructured":"Zama: Concrete: TFHE Compiler that converts python programs into FHE equivalent (2022). https:\/\/github.com\/zama-ai\/concrete"},{"key":"21_CR68","unstructured":"Zhang, W., et al.: BitGC made (more) efficient. Eurocrypt 2026 (To appear) (2026). https:\/\/eprint.iacr.org\/2025\/1810"},{"key":"21_CR69","doi-asserted-by":"crossref","unstructured":"Zhang, X., et al.: Phalanx: an FHE-friendly SNARK for verifiable computation on encrypted data. CCS\u201925 (2025). https:\/\/eprint.iacr.org\/2025\/302","DOI":"10.1145\/3719027.3765226"}],"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_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T08:35:25Z","timestamp":1786437325000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-35418-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032354174","9783032354181"],"references-count":69,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-35418-1_21","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"}}]}}