{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,29]],"date-time":"2026-10-29T22:54:02Z","timestamp":1793314442440,"version":"4.5.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T00:00:00Z","timestamp":1679529600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T00:00:00Z","timestamp":1679529600000},"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":["J Cryptol"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s00145-023-09454-6","type":"journal-article","created":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T17:02:47Z","timestamp":1679590967000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":41,"title":["Bootstrapping for BGV and BFV Revisited"],"prefix":"10.1007","volume":"36","author":[{"given":"Robin","family":"Geelen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frederik","family":"Vercauteren","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,3,23]]},"reference":[{"key":"9454_CR1","doi-asserted-by":"crossref","unstructured":"J.\u00a0Alperin-Sheriff, C.\u00a0Peikert, Practical bootstrapping in quasilinear time, in Annual Cryptology Conference (Springer, 2013), pp. 1\u201320","DOI":"10.1007\/978-3-642-40041-4_1"},{"key":"9454_CR2","doi-asserted-by":"crossref","unstructured":"A.A. Badawi, J.\u00a0Bates, F.\u00a0Bergamaschi, D.B. Cousins, S.\u00a0Erabelli, N.\u00a0Genise, S.\u00a0Halevi, H.\u00a0Hunt, A.\u00a0Kim, Y.\u00a0Lee, Z.\u00a0Liu, D.\u00a0Micciancio, I.\u00a0Quah, Y.\u00a0Polyakov, S.\u00a0R.V., K.\u00a0Rohloff, J.\u00a0Saylor, D.\u00a0Suponitsky, M.\u00a0Triplett, V.\u00a0Vaikuntanathan, V.\u00a0Zucca, Openfhe: Open-source fully homomorphic encryption library. Cryptology ePrint Archive, Paper 2022\/915, 2022. https:\/\/eprint.iacr.org\/2022\/915.","DOI":"10.1145\/3560827.3563379"},{"key":"9454_CR3","doi-asserted-by":"crossref","unstructured":"J.-P. Bossuat, C.\u00a0Mouchet, J.\u00a0Troncoso-Pastoriza, J.-P. Hubaux, Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys, in A.\u00a0Canteaut, F.-X. Standaert, editors, Advances in Cryptology \u2013 EUROCRYPT 2021 (Springer, Cham, 2021), pp. 587\u2013617","DOI":"10.1007\/978-3-030-77870-5_21"},{"key":"9454_CR4","doi-asserted-by":"crossref","unstructured":"J.-P. Bossuat, J.R. Troncoso-Pastoriza, J.-P. Hubaux, Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation. Cryptology ePrint Archive, Paper 2022\/024 (2022). https:\/\/eprint.iacr.org\/2022\/024.","DOI":"10.1007\/978-3-031-09234-3_26"},{"key":"9454_CR5","doi-asserted-by":"crossref","unstructured":"C.\u00a0Boura, N.\u00a0Gama, M.\u00a0Georgieva, D.\u00a0Jetchev, Simulating homomorphic evaluation of deep learning predictions, in International Symposium on Cyber Security Cryptography and Machine Learning (Springer, 2019), pp. 212\u2013230","DOI":"10.1007\/978-3-030-20951-3_20"},{"key":"9454_CR6","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, C. Gentry, V. Vaikuntanathan, (Leveled) fully homomorphic encryption without bootstrapping, in Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. ITCS \u201912 (ACM, 2012), pp. 309\u2013325","DOI":"10.1145\/2090236.2090262"},{"key":"9454_CR7","doi-asserted-by":"crossref","unstructured":"R.\u00a0Burn, Disquisitiones arithmeticae (2nd printing), by cf gauss, trans by aa clarke. pp 490. dm 148. 1986. isbn 3-540-96254-9 (springer). Math. Gazette 71(457), 249\u2013249 (1987)","DOI":"10.2307\/3616791"},{"key":"9454_CR8","doi-asserted-by":"crossref","unstructured":"H.\u00a0Chen, K.\u00a0Han, Homomorphic lower digits removal and improved the bootstrapping, in Annual International Conference on the Theory and Applications of Cryptographic Techniques (Springer, 2018), pp. 315\u2013337","DOI":"10.1007\/978-3-319-78381-9_12"},{"key":"9454_CR9","doi-asserted-by":"crossref","unstructured":"H.\u00a0Chen, Z.\u00a0Huang, K.\u00a0Laine, P.\u00a0Rindal, Labeled psi from fully homomorphic encryption with malicious security, in Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (2018), pp. 1223\u20131237","DOI":"10.1145\/3243734.3243836"},{"key":"9454_CR10","unstructured":"J.\u00a0H. Cheon, A.\u00a0Kim, M.\u00a0Kim, Y.\u00a0Song, Homomorphic encryption for arithmetic of approximate numbers. Cryptology ePrint Archive, Paper 2016\/421 (2016). https:\/\/eprint.iacr.org\/2016\/421"},{"key":"9454_CR11","doi-asserted-by":"crossref","unstructured":"I.\u00a0Chillotti, N.\u00a0Gama, M.\u00a0Georgieva, M.\u00a0Izabach\u00e8ne, Faster fully homomorphic encryption: Bootstrapping in less than 0.1 seconds. Cryptology ePrint Archive, Paper 2016\/870 (2016). https:\/\/eprint.iacr.org\/2016\/870","DOI":"10.1007\/978-3-662-53887-6_1"},{"issue":"5","key":"9454_CR12","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1002\/ett.4460080506","volume":"8","author":"R Cramer","year":"1997","unstructured":"R.\u00a0Cramer, R.\u00a0Gennaro, B.\u00a0Schoenmakers, A secure and optimally efficient multi-authority election scheme. Eur. Trans. Telecommun. 8(5), 481\u2013490 (1997)","journal-title":"Eur. Trans. Telecommun."},{"key":"9454_CR13","doi-asserted-by":"crossref","unstructured":"S.\u00a0Devadas, M.\u00a0van Dijk, C.W. Fletcher, L.\u00a0Ren, E.\u00a0Shi, D.\u00a0Wichs, Onion oram: A constant bandwidth blowup oblivious ram, in Theory of Cryptography Conference (Springer, 2016), pp. 145\u2013174","DOI":"10.1007\/978-3-662-49099-0_6"},{"key":"9454_CR14","doi-asserted-by":"crossref","unstructured":"C.\u00a0Dong, L.\u00a0Chen, A fast single server private information retrieval protocol with low communication cost, in Computer Security - ESORICS 2014, volume 8712 of  Lecture Notes in Computer Science (Springer, Cham, 2014), pp. 380\u2013399","DOI":"10.1007\/978-3-319-11203-9_22"},{"key":"9454_CR15","unstructured":"L.\u00a0Ducas, D.\u00a0Micciancio, Fhew: Bootstrapping homomorphic encryption in less than a second. Cryptology ePrint Archive, Paper 2014\/816 (2014). https:\/\/eprint.iacr.org\/2014\/816"},{"key":"9454_CR16","unstructured":"J.\u00a0Fan, F.\u00a0Vercauteren, Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Report 2012\/144 (2012). https:\/\/eprint.iacr.org\/2012\/144"},{"key":"9454_CR17","unstructured":"R.\u00a0Geelen, I.\u00a0Iliashenko, J.\u00a0Kang, F.\u00a0Vercauteren, On polynomial functions modulo $$p^e$$ and faster bootstrapping for homomorphic encryption. Cryptology ePrint Archive, Paper 2022\/1364 (2022). https:\/\/eprint.iacr.org\/2022\/1364"},{"key":"9454_CR18","unstructured":"R.\u00a0Geelen, M.\u00a0Van\u00a0Beirendonck, H.V. Pereira, B.\u00a0Huffman, T.\u00a0McAuley, B.\u00a0Selfridge, D.\u00a0Wagner, G.\u00a0Dimou, I.\u00a0Verbauwhede, F.\u00a0Vercauteren, et\u00a0al, Basalisc: Flexible asynchronous hardware accelerator for fully homomorphic encryption (2022). arXiv:2205.14017"},{"key":"9454_CR19","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry, Fully homomorphic encryption using ideal lattices, in Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing (2009), pp. 169\u2013178","DOI":"10.1145\/1536414.1536440"},{"key":"9454_CR20","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry, S.\u00a0Halevi, Implementing gentry\u2019s fully-homomorphic encryption scheme, in Annual International Conference on the Theory and Applications of Cryptographic Techniques (Springer, 2011), pp. 129\u2013148","DOI":"10.1007\/978-3-642-20465-4_9"},{"key":"9454_CR21","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry, S.\u00a0Halevi, N.P. Smart, Better bootstrapping in fully homomorphic encryption, in International Workshop on Public Key Cryptography (Springer, 2012), pp. 1\u201316","DOI":"10.1007\/978-3-642-30057-8_1"},{"key":"9454_CR22","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry, S.\u00a0Halevi, N.P. Smart, Fully homomorphic encryption with polylog overhead, in Advances in Cryptology \u2013 EUROCRYPT 2012, volume 7237 of Lecture Notes in Computer Science (Springer, Berlin, Heidelberg, 2012), pp. 465\u2013482","DOI":"10.1007\/978-3-642-29011-4_28"},{"key":"9454_CR23","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry, S.\u00a0Halevi, N.P. Smart, Homomorphic evaluation of the AES circuit, in Annual Cryptology Conference (Springer, 2012), pp. 850\u2013867","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"9454_CR24","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry, A.\u00a0Sahai, B.\u00a0Waters, Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. Cryptology ePrint Archive, Paper 2013\/340 (2013). https:\/\/eprint.iacr.org\/2013\/340","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"9454_CR25","doi-asserted-by":"crossref","unstructured":"S.\u00a0Halevi, V.\u00a0Shoup, Algorithms in helib. Cryptology ePrint Archive, Report 2014\/106 (2014). https:\/\/eprint.iacr.org\/2014\/106","DOI":"10.1007\/978-3-662-44371-2_31"},{"key":"9454_CR26","doi-asserted-by":"crossref","unstructured":"S.\u00a0Halevi, V.\u00a0Shoup, Bootstrapping for helib, in Annual International Conference on the Theory and Applications of Cryptographic Techniques (Springer, 2015), pp. 641\u2013670","DOI":"10.1007\/978-3-662-46800-5_25"},{"key":"9454_CR27","doi-asserted-by":"crossref","unstructured":"S.\u00a0Halevi, V.\u00a0Shoup, Faster homomorphic linear transformations in helib, in Annual International Cryptology Conference (Springer, 2018), pp. 93\u2013120","DOI":"10.1007\/978-3-319-96884-1_4"},{"key":"9454_CR28","unstructured":"S.\u00a0Halevi, V.\u00a0Shoup, Design and implementation of helib: a homomorphic encryption library. Cryptology ePrint Archive, Report 2020\/1481 (2020). https:\/\/eprint.iacr.org\/2020\/1481"},{"issue":"1","key":"9454_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-020-09368-7","volume":"34","author":"S Halevi","year":"2021","unstructured":"S.\u00a0Halevi, V.\u00a0Shoup, Bootstrapping for helib. J. Cryptol. 34(1), 1\u201344 (2021)","journal-title":"J. Cryptol."},{"key":"9454_CR30","unstructured":"C.S. Jutla, N.\u00a0Manohar, Sine series approximation of the mod function for bootstrapping of approximate he. Cryptology ePrint Archive, Paper 2021\/572 (2021). https:\/\/eprint.iacr.org\/2021\/572"},{"key":"9454_CR31","unstructured":"A.\u00a0Kim, M.\u00a0Deryabin, J.\u00a0Eom, R.\u00a0Choi, Y.\u00a0Lee, W.\u00a0Ghang, D.\u00a0Yoo, General bootstrapping approach for rlwe-based homomorphic encryption. Cryptology ePrint Archive, Paper 2021\/691 (2021). https:\/\/eprint.iacr.org\/2021\/691"},{"key":"9454_CR32","doi-asserted-by":"crossref","unstructured":"A.\u00a0Kim, Y.\u00a0Polyakov, V.\u00a0Zucca, Revisiting homomorphic encryption schemes for finite fields, in International Conference on the Theory and Application of Cryptology and Information Security (Springer, 2021), pp. 608\u2013639","DOI":"10.1007\/978-3-030-92078-4_21"},{"key":"9454_CR33","doi-asserted-by":"crossref","unstructured":"J.-W. Lee, E.\u00a0Lee, Y.\u00a0Lee, Y.-S. Kim, J.-S. No, High-precision bootstrapping of rns-ckks homomorphic encryption using optimal minimax polynomial approximation and inverse sine function, in A.\u00a0Canteaut, F.-X. Standaert, editors, Advances in Cryptology \u2013 EUROCRYPT 2021 (Springer, Cham, 2021), pp. 618\u2013647","DOI":"10.1007\/978-3-030-77870-5_22"},{"key":"9454_CR34","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Lee, J.-W. Lee, Y.-S. Kim, Y.\u00a0Kim, J.-S. No, H.\u00a0Kang, High-precision bootstrapping for approximate homomorphic encryption by error variance minimization, in O.\u00a0Dunkelman, S.\u00a0Dziembowski, editors, Advances in Cryptology \u2013 EUROCRYPT 2022 (Springer, Cham, 2022), pp. 551\u2013580","DOI":"10.1007\/978-3-031-06944-4_19"},{"key":"9454_CR35","doi-asserted-by":"crossref","unstructured":"R.\u00a0Li, C.\u00a0Jia, Homomorphic modular reduction and improved bootstrapping for bgv scheme, in Information Security and Cryptology, volume 13007 of  Lecture Notes in Computer Science (Springer, Cham, 2021), pp. 466\u2013484","DOI":"10.1007\/978-3-030-88323-2_25"},{"key":"9454_CR36","doi-asserted-by":"crossref","unstructured":"V.\u00a0Lyubashevsky, C.\u00a0Peikert, O.\u00a0Regev, A toolkit for ring-lwe cryptography, in Annual International Conference on the Theory and Applications of Cryptographic Techniques (Springer, 2013), pp. 35\u201354","DOI":"10.1007\/978-3-642-38348-9_3"},{"issue":"1","key":"9454_CR37","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/0202007","volume":"2","author":"MS Paterson","year":"1973","unstructured":"M.S. Paterson, L.J. Stockmeyer, On the number of nonscalar multiplications necessary to evaluate polynomials. SIAM J. Comput. 2(1), 60\u201366 (1973)","journal-title":"SIAM J. Comput."},{"issue":"11","key":"9454_CR38","first-page":"169","volume":"4","author":"RL Rivest","year":"1978","unstructured":"R.L. Rivest, L.\u00a0Adleman, M.L. Dertouzos, et\u00a0al, On data banks and privacy homomorphisms. Found. Secure Comput. 4(11), 169\u2013180 (1978)","journal-title":"Found. Secure Comput."},{"key":"9454_CR39","volume-title":"Field theory","author":"S Roman","year":"2005","unstructured":"S.\u00a0Roman, Field Theory, vol. 158 (Springer, 2005)"},{"key":"9454_CR40","unstructured":"T.\u00a0Rondeau, Data protection in virtual environments (DPRIVE) (2020)"},{"issue":"1","key":"9454_CR41","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10623-012-9720-4","volume":"71","author":"NP Smart","year":"2014","unstructured":"N.P. Smart, F.\u00a0Vercauteren, Fully homomorphic simd operations. Des. Codes Cryptogr. 71(1), 57\u201381 (2014)","journal-title":"Des. Codes Cryptogr."},{"key":"9454_CR42","unstructured":"V.\u00a0Zucca, Towards efficient arithmetic for ring-lwe based homomorphic encryption (2018)"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09454-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-023-09454-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09454-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T17:09:09Z","timestamp":1682442549000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-023-09454-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,23]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["9454"],"URL":"https:\/\/doi.org\/10.1007\/s00145-023-09454-6","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,23]]},"assertion":[{"value":"30 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"12"}}