{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T14:56:43Z","timestamp":1786373803561,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":89,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032353733","type":"print"},{"value":"9783032353740","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-35374-0_14","type":"book-chapter","created":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T13:50:00Z","timestamp":1786369800000},"page":"428-460","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["New Techniques for\u00a0Fast and\u00a0Shallow FHE Bootstrapping and\u00a0Beyond"],"prefix":"10.1007","author":[{"given":"Aayush","family":"Jain","sequence":"first","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"}]},{"given":"Sagnik","family":"Saha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,11]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3) (2015)","DOI":"10.1515\/jmc-2015-0016"},{"key":"14_CR2","unstructured":"Ali, A., et al.: Communication-computation trade-offs in PIR. In: 30th USENIX Security Symposium (USENIX Security 21). USENIX Association(2021)"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Alperin-Sheriff, J., Peikert, C.: Practical bootstrapping in quasilinear time. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 1\u201320. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_1","DOI":"10.1007\/978-3-642-40041-4_1"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Angel, S., Chen, H., Laine, K., Setty, S.T.V.: PIR with compressed queries and amortized query processing. In: 2018 IEEE Symposium on Security and Privacy. IEEE Computer Society Press (2018)","DOI":"10.1109\/SP.2018.00062"},{"key":"14_CR5","unstructured":"Badawi, A.A., et al.: Openfhe: open-source fully homomorphic encryption library. Cryptology ePrint Archive, Paper 2022\/915 (2022). https:\/\/eprint.iacr.org\/2022\/915. commit: 122f470e0dbf94688051ab852131ccc5d26be934"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Bergerat, L., et al.: Parameter optimization and larger precision for (T)FHE. J. Cryptol. 36(3) (2023)","DOI":"10.1007\/s00145-023-09463-5"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Bergerat, L., Chillotti, I., Ligier, D., Orfila, J.-B., Roux-Langlois, A., Tap, S.: New secret keys for enhanced performance in (t)FHE. Cryptology ePrint Archive. Paper 2023\/979 (2023)","DOI":"10.1145\/3658644.3670376"},{"key":"14_CR8","volume-title":"ASIACRYPT 2025, Part VII, volume 16251 of LNCS","author":"L Bergerat","year":"2025","unstructured":"Bergerat, L., Orfila, J.-B., Roux-Langlois, A., Tap, S.: Accelerating TFHE with sorted bootstrapping techniques. In: Hanaoka, G., Yang, B.-Y. (eds.) ASIACRYPT 2025, Part VII, volume 16251 of LNCS. Springer, Singapore (2025)"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Boemer, F., Kim, S., Seifu, G., de Souza, F.D.M., 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)","DOI":"10.1145\/3474366.3486926"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Boneh, D., Eskandarian, S., Hanzlik, L., Greco, N.: Single secret leader election. In: Proceedings of the 2nd ACM Conference on Advances in Financial Technologies. Association for Computing Machinery, AFT \u201920, pp. 12\u201324, New York, NY, USA (2020)","DOI":"10.1145\/3419614.3423258"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/978-3-030-77870-5_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"J-P Bossuat","year":"2021","unstructured":"Bossuat, J.-P., Mouchet, C., Troncoso-Pastoriza, J., Hubaux, J.-P.: Efficient Bootstrapping for approximate homomorphic encryption with non-sparse keys. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 587\u2013617. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_21"},{"key":"14_CR12","volume-title":"CRYPTO 2018, Part III, volume 10993 of LNCS","author":"F Bourse","year":"2018","unstructured":"Bourse, F., Minelli, M., Minihold, M., Paillier, P.: Fast homomorphic evaluation of deep discretized neural networks. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part III, volume 10993 of LNCS. Springer, Cham (2018)"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Annual Cryptology Conference, pp. 868\u2013886. Springer (2012)","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-030-45724-2_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"Z Brakerski","year":"2020","unstructured":"Brakerski, Z., D\u00f6ttling, N.: Hardness of LWE on general entropic distributions. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 551\u2013575. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_19"},{"issue":"3","key":"14_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory (TOCT) 6(3), 1\u201336 (2014)","journal-title":"ACM Trans. Comput. Theory (TOCT)"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Annual cryptology conference, pp. 505\u2013524. Springer (2011)","DOI":"10.1007\/978-3-642-22792-9_29"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Burton, A., Menon, S.J., Wu, D.J.: Respire: high-rate PIR for databases with small records. In: ACM CCS 2025 (2024)","DOI":"10.1145\/3658644.3690328"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-030-17656-3_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"H Chen","year":"2019","unstructured":"Chen, H., Chillotti, I., Song, Y.: Improved bootstrapping for approximate homomorphic encryption. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 34\u201354. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_2"},{"key":"14_CR19","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":"14_CR20","doi-asserted-by":"crossref","unstructured":"Chen, H., Huang, Z., Laine, K., Rindal, P.: Labeled PSI from fully homomorphic encryption with malicious security. In: ACM CCS 2018. ACM Press (2018)","DOI":"10.1145\/3243734.3243836"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Chen, H., Laine, K., Rindal, P.: Fast private set intersection from homomorphic encryption. In: ACM CCS 2017. ACM Press (2017)","DOI":"10.1145\/3133956.3134061"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Han, K., Kim, A., Kim, M., Song, Y.: Bootstrapping for approximate homomorphic encryption. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 360\u2013384. Springer (2018)","DOI":"10.1007\/978-3-319-78381-9_14"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 409\u2013437. Springer (2017)","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-53887-6_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"I Chillotti","year":"2016","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 3\u201333. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_1"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Cong, K., et al.: Labeled PSI from homomorphic encryption with reduced computation and communication. In: ACM CCS 2021. ACM Press (2021)","DOI":"10.1145\/3460120.3484760"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Dalvi, A., Jain, A., Moradiya, S., Nirmal, R., Sanghavi, J., Siddavatam, I.: Securing neural networks using homomorphic encryption. In: 2021 International Conference on Intelligent Technologies (CONIT), pp. 1\u20137 (2021)","DOI":"10.1109\/CONIT51480.2021.9498376"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Duan, K., Li, H., Liu, D., Ma, G.: Large-plaintext functional bootstrapping in FHE with small bootstrapping keys. Cryptology ePrint Archive, Paper 2025\/1717 (2025)","DOI":"10.1007\/978-3-032-12287-2_9"},{"key":"14_CR28","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":"14_CR29","first-page":"144","volume":"2012","author":"J Fan","year":"2012","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. IACR Cryptol. ePrint Arch. 2012, 144 (2012)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Feng, J., Wu, B., Lin, D., Xiang, B.: Accelerating NTRU-based bootstrapping with block key distributions. ISC\u201925 (2025)","DOI":"10.1007\/978-981-95-6206-0_3"},{"key":"14_CR31","doi-asserted-by":"crossref","unstructured":"Fisch, B., Lazzaretti, A., Liu, Z., Papamanthou, C.: Thorpir: single server pir via homomorphic thorp shuffles. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, CCS \u201924, Association for Computing Machinery, New York, NY, USA (2024)","DOI":"10.1145\/3658644.3690326"},{"key":"14_CR32","unstructured":"Fisch, B., Liu, Z., Tromer, E., Wang, Y.: UnifOMR: oblivious message retrieval with near-optimal concrete efficiency. In: ACM CCS 2026 (2026)"},{"key":"14_CR33","doi-asserted-by":"crossref","unstructured":"Geelen, R., Vercauteren, F.: Bootstrapping for BGV and BFV revisited. J. Cryptol. 36(2) (2023)","DOI":"10.1007\/s00145-023-09454-6"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"14_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"C Gentry","year":"2013","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 75\u201392. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5"},{"key":"14_CR36","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":"14_CR37","unstructured":"Goldwasser, S., Kalai, Y.T., Peikert, C., Vaikuntanathan, V.: Robustness of the learning with errors assumption. In: ICS 2010. Tsinghua University Press (2010)"},{"key":"14_CR38","doi-asserted-by":"crossref","unstructured":"Guimar\u00e3es, A., Borin, E., Aranha, D.F.: Revisiting the functional bootstrap in TFHE. IACR TCHES (2) (2021)","DOI":"10.46586\/tches.v2021.i2.229-253"},{"key":"14_CR39","doi-asserted-by":"crossref","unstructured":"Guimar\u00e3es, A., Pereira, H.V.L., van Leeuwen, B.: Amortized bootstrapping revisited: Simpler, asymptotically-faster, implemented. Cryptology ePrint Archive, Paper 2023\/014 (2023). https:\/\/eprint.iacr.org\/2023\/014","DOI":"10.1007\/978-981-99-8736-8_1"},{"key":"14_CR40","doi-asserted-by":"crossref","unstructured":"Halevi, S., Shoup, V.: Bootstrapping for HElib. J. Cryptol. 34(1) (2021)","DOI":"10.1007\/s00145-020-09368-7"},{"key":"14_CR41","doi-asserted-by":"publisher","first-page":"57361","DOI":"10.1109\/ACCESS.2019.2913850","volume":"7","author":"K Han","year":"2019","unstructured":"Han, K., Hhan, M., Cheon, J.H.: Improved homomorphic discrete fourier transforms and fhe bootstrapping. IEEE Access 7, 57361\u201357370 (2019)","journal-title":"IEEE Access"},{"key":"14_CR42","doi-asserted-by":"crossref","unstructured":"Han, K., Ki, D.: Better bootstrapping for approximate homomorphic encryption. In: Cryptographers\u2019 Track at the RSA Conference, pp. 364\u2013390. Springer (2020)","DOI":"10.1007\/978-3-030-40186-3_16"},{"key":"14_CR43","doi-asserted-by":"crossref","unstructured":"Henzinger, A., Dauterman, E., Corrigan-Gibbs, H., Zeldovich, N.: Private web search with tiptoe. In: Proceedings of the 29th Symposium on Operating Systems Principles, SOSP \u201923. Association for Computing Machinery, pp. 396\u2013416, New York, NY, USA (2023)","DOI":"10.1145\/3600006.3613134"},{"key":"14_CR44","unstructured":"Hong, D., Lee, Y.: Optimizing FHEW-like homomorphic encryption schemes with smooth performance-failure trade-offs. Cryptology ePrint Archive. Paper 2025\/1892 (2025)"},{"key":"14_CR45","doi-asserted-by":"crossref","unstructured":"jie 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":"14_CR46","doi-asserted-by":"crossref","unstructured":"Joye, M., Paillier, P.: Blind rotation in fully homomorphic encryption with extended keys. In: Cyber Security, Cryptology, and Machine Learning: 6th International Symposium, CSCML 2022, Be\u2019er Sheva, Israel, June 30 \u2013 July 1, 2022, Proceedings. Springer-Verlag, Berlin, Heidelberg (2022)","DOI":"10.1007\/978-3-031-07689-3_1"},{"key":"14_CR47","unstructured":"Juvekar, C., Vaikuntanathan, V., Chandrakasan, A.: GAZELLE: a low latency framework for secure neural network inference. In: Enck, W., Felt, A.P., (eds.), USENIX Security 2018. USENIX Association (2018)"},{"key":"14_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/978-3-030-92078-4_21","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"A Kim","year":"2021","unstructured":"Kim, A., Polyakov, Y., Zucca, V.: Revisiting homomorphic encryption schemes for finite fields. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13092, pp. 608\u2013639. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_21"},{"key":"14_CR49","doi-asserted-by":"crossref","unstructured":"Kim, S., Park, M., Kim, J., Kim, T., Min, C.: Evalround algorithm in CKKs bootstrapping. Asiacrypt 2022 (2022). https:\/\/eprint.iacr.org\/2022\/1256","DOI":"10.1007\/978-3-031-22966-4_6"},{"key":"14_CR50","doi-asserted-by":"crossref","unstructured":"Lee, C., Min, S., Seo, J., Song, Y.: Faster TFHE bootstrapping with block binary keys. In: Liu, J.K., Xiang, Y., Nepal, S., Tsudik, G., (eds.), ASIACCS 23. ACM Press (2023)","DOI":"10.1145\/3579856.3595804"},{"key":"14_CR51","unstructured":"Lee, D., Min, S., Song, Y.: Functional bootstrapping for packed ciphertexts via homomorphic LUT evaluation (2024)"},{"key":"14_CR52","doi-asserted-by":"publisher","first-page":"30039","DOI":"10.1109\/ACCESS.2022.3159694","volume":"10","author":"J-W Lee","year":"2022","unstructured":"Lee, J.-W., et al.: Privacy-preserving machine learning with fully homomorphic encryption for deep neural network. IEEE Access 10, 30039\u201330054 (2022)","journal-title":"IEEE Access"},{"key":"14_CR53","series-title":"pp","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-981-99-8736-8_2","volume-title":"Advances in Cryptology - ASIACRYPT 2023","author":"J-W 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. pp, pp. 36\u201368. Springer Nature Singapore, Singapore (2023)"},{"key":"14_CR54","first-page":"06","volume":"2021","author":"J-W Lee","year":"2021","unstructured":"Lee, J.-W., Lee, E., Lee, Y., Kim, Y.-S., No, J.-S.: High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function. EUROCRYPT 2021, 06 (2021)","journal-title":"EUROCRYPT"},{"key":"14_CR55","unstructured":"Lee, K., Yeo, Y.: SophOMR: improved oblivious message retrieval from SIMD-aware homomorphic compression. Cryptology ePrint Archive. Paper 2024\/1814 (2024)"},{"key":"14_CR56","volume-title":"PKC 2023, Part II, volume 13941 of LNCS","author":"K Lee","year":"2023","unstructured":"Lee, K., Yoon, J.W.: Discretization error reduction for high precision torus fully homomorphic encryption. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC 2023, Part II, volume 13941 of LNCS. Springer, Cham (2023)"},{"key":"14_CR57","doi-asserted-by":"publisher","first-page":"144321","DOI":"10.1109\/ACCESS.2020.3014369","volume":"8","author":"Y Lee","year":"2020","unstructured":"Lee, Y., Lee, J.-W., Kim, Y.-S., No, J.-S.: Near-optimal polynomial for modulus reduction using l2-norm for approximate homomorphic encryption. IEEE Access 8, 144321\u2013144330 (2020)","journal-title":"IEEE Access"},{"key":"14_CR58","doi-asserted-by":"crossref","unstructured":"Lee, Y., et al.: Efficient fhew bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology - EUROCRYPT 2023, pp. 227\u2013256. Springer Nature Switzerland, Cham (2023)","DOI":"10.1007\/978-3-031-30620-4_8"},{"key":"14_CR59","doi-asserted-by":"crossref","unstructured":"Li, Z., et al.: Faster NTRU-based bootstrapping in less than 4 ms. IACR TCHES 3 (2024)","DOI":"10.46586\/tches.v2024.i3.418-451"},{"key":"14_CR60","unstructured":"Liang, H., Liu, Z., Tromer, E., Xie, X., Yu, Y.: InstantOMR: oblivious message retrieval with low latency and optimal parallelizability. USENIX Security 2026 (2026)"},{"key":"14_CR61","unstructured":"Liang, H., Liu, Z., Wang, Y., Xiang Xie, F.Z., Yu, Y.: Relect: single secret leader election via FHE with reduced computation and communication and transparent setup. ACM CCS 2026 (2026)"},{"key":"14_CR62","doi-asserted-by":"crossref","unstructured":"Lin, C., Liu, Z., Malkin, T.: XSPIR: efficient symmetrically private information retrieval from ring-LWE. In: Atluri, V., Di Pietro, R., Jensen, C.D., Meng, W., (eds.), ESORICS\u00a02022, Part\u00a0I, volume 13554 of LNCS (2022)","DOI":"10.1007\/978-3-031-17140-6_11"},{"key":"14_CR63","doi-asserted-by":"crossref","unstructured":"Liu, F.-H., Wang, H.: Batch bootstrapping i: a new framework for simd bootstrapping in polynomial modulus. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology - EUROCRYPT 2023, pp. 321\u2013352. Springer Nature Switzerland, Cham (2023)","DOI":"10.1007\/978-3-031-30620-4_11"},{"key":"14_CR64","doi-asserted-by":"crossref","unstructured":"Liu, F.-H., Wang, H.: Batch bootstrapping i: bootstrapping in polynomial modulus only requires o (1) FHE multiplications in amortization. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology - EUROCRYPT 2023, pp. 321\u2013352. Springer Nature Switzerland, Cham (2023)","DOI":"10.1007\/978-3-031-30620-4_12"},{"key":"14_CR65","doi-asserted-by":"crossref","unstructured":"Liu, Z., Micciancio, D., Polyakov, Y.: Large-precision homomorphic sign evaluation using fhew\/tfhe bootstrapping. In: Advances in Cryptology \u2013 ASIACRYPT 2022: 28th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, 5\u20139 December 2022, Proceedings, Part II. Springer-Verlag (2023)","DOI":"10.1007\/978-3-031-22966-4_5"},{"key":"14_CR66","series-title":"Part III, volume 15603 of LNCS","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-031-91131-6_5","volume-title":"EUROCRYPT 2025","author":"Z Liu","year":"2025","unstructured":"Liu, Z., Sotiraki, K., Tromer, E., Wang, Y.: Snake-eye resistant PKE from LWE for oblivious message retrieval and robust encryption. In: Fehr, S., Fouque, P.-A. (eds.) EUROCRYPT 2025. Part III, volume 15603 of LNCS, pp. 126\u2013156. Springer, Cham (2025)"},{"key":"14_CR67","doi-asserted-by":"crossref","unstructured":"Liu, Z., Tromer, E., Wang, Y.: Group oblivious message retrieval. In: 2024 IEEE Symposium on Security and Privacy (SP), pp. 4367\u20134385 (2024)","DOI":"10.1109\/SP54263.2024.00115"},{"key":"14_CR68","doi-asserted-by":"crossref","unstructured":"Liu, Z., Tromer, E., Wang, Y.: PerfOMR: oblivious message retrieval with reduced communication and computation. In: Usenix Security\u201924 (2024)","DOI":"10.1109\/SP54263.2024.00115"},{"key":"14_CR69","volume-title":"ASIACRYPT 2023, Part VI, volume 14443 of LNCS","author":"Z Liu","year":"2023","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 2023, Part VI, volume 14443 of LNCS. Springer, Singapore (2023)"},{"key":"14_CR70","volume-title":"ASIACRYPT 2024, Part I, volume 15484 of LNCS","author":"Z Liu","year":"2024","unstructured":"Liu, Z., Wang, Y.: Relaxed functional bootstrapping: a new perspective on BGV\/BFV bootstrapping. In: Chung, K.-M., Sasaki, Y. (eds.) ASIACRYPT 2024, Part I, volume 15484 of LNCS. Springer, Singapore (2024)"},{"key":"14_CR71","doi-asserted-by":"crossref","unstructured":"Ma, S., Huang, T., Wang, A., Wang, X.: Accelerating BGV bootstrapping for large $$p$$ using null polynomials over $$\\mathbb{Z}_{p^e}$$. Eurocrypt (2024). https:\/\/eprint.iacr.org\/2024\/115","DOI":"10.1007\/978-3-031-58723-8_14"},{"key":"14_CR72","doi-asserted-by":"crossref","unstructured":"Menon, S.J., Wu, D.J.: SPIRAL: fast, high-rate single-server PIR via FHE composition. In: 2022 IEEE Symposium on Security and Privacy. IEEE Computer Society Press (2022)","DOI":"10.1109\/SP46214.2022.9833700"},{"key":"14_CR73","unstructured":"Micciancio, D., Polyakov, Y.: Bootstrapping in FHEW-like cryptosystems. Cryptology ePrint Archive. Paper 2020\/086 (2020)"},{"key":"14_CR74","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Polyakov, Y.: Bootstrapping in FHEW-like cryptosystems. Association for Computing Machinery (2021)","DOI":"10.1145\/3474366.3486924"},{"key":"14_CR75","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Vaikuntanathan, V: Sok: learning with errors, circular security, and fully homomorphic encryption. In: IACR International Conference on Public-Key Cryptography, pp. 291\u2013321. Springer (2024)","DOI":"10.1007\/978-3-031-57728-4_10"},{"key":"14_CR76","unstructured":"Miccianco, D., Sorrell, J.: Ring packing and amortized FHEW bootstrapping. In: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), volume 107 of Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik (2018)"},{"key":"14_CR77","unstructured":"Micheli, G.D., Kim, D., Micciancio, D., Suhl, A.: Faster amortized FHEW bootstrapping using ring automorphisms. Cryptology ePrint Archive, Paper 2023\/112 (2023). https:\/\/eprint.iacr.org\/2023\/112"},{"key":"14_CR78","doi-asserted-by":"crossref","unstructured":"Okada, H., Player, R., Pohmann, S.: Homomorphic polynomial evaluation using galois structure and applications to BFV bootstrapping. Asiacrypt (2023). https:\/\/eprint.iacr.org\/2023\/1304","DOI":"10.1007\/978-981-99-8736-8_3"},{"issue":"11","key":"14_CR79","first-page":"169","volume":"4","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Adleman, L., Dertouzos, M.L., et al.: On data banks and privacy homomorphisms. Found. Secur. Comput. 4(11), 169\u2013180 (1978)","journal-title":"Found. Secur. Comput."},{"key":"14_CR80","unstructured":"Microsoft SEAL (2020). https:\/\/github.com\/Microsoft\/SEAL"},{"key":"14_CR81","unstructured":"Zama-ai, TFHE-RS (2023). https:\/\/github.com\/zama-ai\/tfhe-rs. commit: 509bf3e2846bc98dd42d0e8eeb7f27852e5b632a"},{"key":"14_CR82","unstructured":"Wang, H., Luo, M., Xia, H., Wang, M., Hou, H.: Accelerating FHEW-like bootstrapping via new configurations of the underlying cryptosystems. Cryptology ePrint Archive, Paper 2025\/1711 (2025)"},{"key":"14_CR83","unstructured":"Wang, R., et al.: Bootstrapping over free $$\\cal{R}$$-module. Cryptology ePrint Archive, Paper 2025\/1753 (2025)"},{"key":"14_CR84","unstructured":"Wang, Y., Zhang, F.: Qelect: lattice-based single secret leader election made practical. Usenix Security, 2025 (2025)"},{"key":"14_CR85","doi-asserted-by":"crossref","unstructured":"Xiang, B., Zhang, J., Deng, Y., Dai, Y., Feng, D.: Fast blind rotation for bootstrapping FHEs. Cryptology ePrint Archive. Paper 2023\/1564 (2023)","DOI":"10.1007\/978-3-031-38551-3_1"},{"key":"14_CR86","volume-title":"CRYPTO 2023, Part IV, volume 14084 of LNCS","author":"K Yeo","year":"2023","unstructured":"Yeo, K.: Cuckoo hashing in cryptography: optimal parameters, robustness and applications. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part IV, volume 14084 of LNCS. Springer, Cham (2023)"},{"key":"14_CR87","first-page":"395","volume-title":"EUROCRYPT 2023, Part I, volume 14004 of LNCS","author":"M Zhou","year":"2023","unstructured":"Zhou, M., Lin, W.-K., Tselekounis, Y., Shi, E.: Optimal single-server private information retrieval. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part I, volume 14004 of LNCS, pp. 395\u2013425. Springer, Cham (2023)"},{"key":"14_CR88","doi-asserted-by":"crossref","unstructured":"Zhou, T., Yang, X., Liu, L., Zhang, W., Ding, Y.: Faster bootstrapping with multiple addends. IEEE Access (2018)","DOI":"10.1109\/ACCESS.2018.2867655"},{"key":"14_CR89","unstructured":"\u015eah \u00d6zcan, A., Sava\u015f, E.: Two algorithms for fast GPU implementation of NTT. Cryptology ePrint Archive. Paper 2023\/1410 (2023)"}],"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-35374-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T13:50:14Z","timestamp":1786369814000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-35374-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032353733","9783032353740"],"references-count":89,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-35374-0_14","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":"11 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"}}]}}