{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T15:56:41Z","timestamp":1783007801025,"version":"3.54.5"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s00145-020-09368-7","type":"journal-article","created":{"date-parts":[[2021,1,6]],"date-time":"2021-01-06T02:02:59Z","timestamp":1609898579000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":75,"title":["Bootstrapping for HElib"],"prefix":"10.1007","volume":"34","author":[{"given":"Shai","family":"Halevi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Victor","family":"Shoup","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,1,6]]},"reference":[{"key":"9368_CR1","doi-asserted-by":"crossref","unstructured":"M.\u00a0R. Albrecht, R.\u00a0Player, and S.\u00a0Scott. On the concrete hardness of learning with errors. Journal of Mathematical Cryptology, 9:169\u2013203, 10 2015. See also https:\/\/bitbucket.org\/malb\/lwe-estimator\/src\/master\/ and https:\/\/ia.cr\/2015\/046 (accessed September 2020).","DOI":"10.1515\/jmc-2015-0016"},{"key":"9368_CR2","doi-asserted-by":"crossref","unstructured":"J.\u00a0Alperin-Sheriff and C.\u00a0Peikert. Practical bootstrapping in quasilinear time. In R.\u00a0Canetti and J.\u00a0A. Garay, editors, Advances in Cryptology - CRYPTO\u201913, volume 8042 of Lecture Notes in Computer Science, pages 1\u201320. Springer, 2013.","DOI":"10.1007\/978-3-642-40041-4_1"},{"key":"9368_CR3","doi-asserted-by":"crossref","unstructured":"T.\u00a0W. Anderson and D.\u00a0A. Darling. Asymptotic Theory of Certain \u201cGoodness of Fit\" Criteria Based on Stochastic Processes. Ann. Math. Statist., 23(2):193\u2013212, 06 1952.","DOI":"10.1214\/aoms\/1177729437"},{"key":"9368_CR4","first-page":"758","volume":"2018","author":"C Boura","year":"2018","unstructured":"C.\u00a0Boura, N.\u00a0Gama, and M.\u00a0Georgieva. Chimera: a unified framework for B\/FV, TFHE and HEAAN fully homomorphic encryption and predictions for deep learning. IACR Cryptology ePrint Archive, 2018:758, 2018.","journal-title":"IACR Cryptology ePrint Archive"},{"issue":"3","key":"9368_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Z.\u00a0Brakerski, C.\u00a0Gentry, and V.\u00a0Vaikuntanathan. (Leveled) fully homomorphic encryption without bootstrapping. ACM Transactions on Computation Theory, 6(3):13, 2014.","journal-title":"ACM Transactions on Computation Theory"},{"key":"9368_CR6","doi-asserted-by":"crossref","unstructured":"H.\u00a0Chen and K.\u00a0Han. Homomorphic lower digits removal and improved FHE bootstrapping. In EUROCRYPT 2018, volume 10820 of Lecture Notes in Computer Science, pages 315\u2013337. Springer, 2018.","DOI":"10.1007\/978-3-319-78381-9_12"},{"key":"9368_CR7","doi-asserted-by":"crossref","unstructured":"J.\u00a0H. Cheon, J.\u00a0Coron, J.\u00a0Kim, M.\u00a0S. Lee, T.\u00a0Lepoint, M.\u00a0Tibouchi, and A.\u00a0Yun. Batch fully homomorphic encryption over the integers. In Advances in Cryptology - EUROCRYPT 2013, 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26-30, 2013. Proceedings, pages 315\u2013335, 2013.","DOI":"10.1007\/978-3-642-38348-9_20"},{"key":"9368_CR8","doi-asserted-by":"crossref","unstructured":"J.\u00a0H. Cheon, K.\u00a0Han, A.\u00a0Kim, M.\u00a0Kim, and Y.\u00a0Song. Bootstrapping for approximate homomorphic encryption. In EUROCRYPT 2018, volume 10820 of Lecture Notes in Computer Science, pages 360\u2013384. Springer, 2018.","DOI":"10.1007\/978-3-319-78381-9_14"},{"key":"9368_CR9","doi-asserted-by":"crossref","unstructured":"J.\u00a0H. Cheon, A.\u00a0Kim, M.\u00a0Kim, and Y.\u00a0Song. Homomorphic encryption for arithmetic of approximate numbers. In Asiacrypt 2017, volume 10625 of Lecture Notes in Computer Science, pages 409\u2013437. Springer, 2017.","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"9368_CR10","doi-asserted-by":"crossref","unstructured":"I.\u00a0Chillotti, N.\u00a0Gama, M.\u00a0Georgieva, and M.\u00a0Izabach\u00e8ne. Faster fully homomorphic encryption: Bootstrapping in less than 0.1 seconds. In ASIACRYPT 2016, volume 10031 of Lecture Notes in Computer Science, pages 3\u201333. Springer, 2016.","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"9368_CR11","doi-asserted-by":"crossref","unstructured":"I.\u00a0Chillotti, N.\u00a0Gama, M.\u00a0Georgieva, and M.\u00a0Izabach\u00e8ne. Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE. In ASIACRYPT 2017, volume 10624 of Lecture Notes in Computer Science, pages 377\u2013408. Springer, 2017.","DOI":"10.1007\/978-3-319-70694-8_14"},{"key":"9368_CR12","first-page":"36","volume":"2013","author":"J Coron","year":"2013","unstructured":"J.\u00a0Coron, T.\u00a0Lepoint, and M.\u00a0Tibouchi. Batch fully homomorphic encryption over the integers. IACR Cryptology ePrint Archive, 2013:36, 2013.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"9368_CR13","doi-asserted-by":"crossref","unstructured":"J.\u00a0Coron, D.\u00a0Naccache, and M.\u00a0Tibouchi. Public key compression and modulus switching for fully homomorphic encryption over the integers. In Advances in Cryptology - EUROCRYPT 2012 - 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, April 15-19, 2012. Proceedings, pages 446\u2013464, 2012.","DOI":"10.1007\/978-3-642-29011-4_27"},{"key":"9368_CR14","unstructured":"I.\u00a0Damg\u00e5rd, V.\u00a0Pastro, N.\u00a0Smart, and S.\u00a0Zakarias. Multiparty computation from somewhat homomorphic encryption. Cryptology ePrint Archive, Report 2011\/535, 2011. https:\/\/eprint.iacr.org\/2011\/535."},{"key":"9368_CR15","unstructured":"L.\u00a0Ducas and D.\u00a0Micciancio. FHE Bootstrapping in less than a second. Cryptology ePrint Archive, Report 2014\/816, 2014. http:\/\/eprint.iacr.org\/."},{"key":"9368_CR16","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry. Fully homomorphic encryption using ideal lattices. In Proceedings of the 41st ACM Symposium on Theory of Computing \u2013 STOC 2009, pages 169\u2013178. ACM, 2009.","DOI":"10.1145\/1536414.1536440"},{"key":"9368_CR17","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry and S.\u00a0Halevi. Implementing gentry\u2019s fully-homomorphic encryption scheme. In Advances in Cryptology - EUROCRYPT 2011, volume 6632 of Lecture Notes in Computer Science, pages 129\u2013148. Springer, 2011.","DOI":"10.1007\/978-3-642-20465-4_9"},{"issue":"5","key":"9368_CR18","doi-asserted-by":"publisher","first-page":"663","DOI":"10.3233\/JCS-130480","volume":"21","author":"C Gentry","year":"2013","unstructured":"C.\u00a0Gentry, S.\u00a0Halevi, C.\u00a0Peikert, and N.\u00a0P. Smart. Field switching in BGV-style homomorphic encryption. Journal of Computer Security, 21(5):663\u2013684, 2013.","journal-title":"Journal of Computer Security"},{"key":"9368_CR19","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry, S.\u00a0Halevi, and N.\u00a0Smart. Fully homomorphic encryption with polylog overhead. In Advances in Cryptology \u2013 EUROCRYPT 2012, volume 7237 of Lecture Notes in Computer Science, pages 465\u2013482. Springer, 2012. Full version at http:\/\/eprint.iacr.org\/2011\/566.","DOI":"10.1007\/978-3-642-29011-4_28"},{"key":"9368_CR20","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry, S.\u00a0Halevi, and N.\u00a0Smart. Homomorphic evaluation of the AES circuit. In Advances in Cryptology \u2013 CRYPTO 2012, volume 7417 of Lecture Notes in Computer Science, pages 850\u2013867. Springer, 2012. Full version at http:\/\/eprint.iacr.org\/2012\/099.","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"9368_CR21","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry, S.\u00a0Halevi, and N.\u00a0P. Smart. Better bootstrapping in fully homomorphic encryption. In Public Key Cryptography \u2013 PKC 2012, volume 7293 of Lecture Notes in Computer Science, pages 1\u201316. Springer, 2012.","DOI":"10.1007\/978-3-642-30057-8_1"},{"key":"9368_CR22","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry, A.\u00a0Sahai, and B.\u00a0Waters. Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In R.\u00a0Canetti and J.\u00a0A. Garay, editors, Advances in Cryptology - CRYPTO 2013, Part I, pages 75\u201392. Springer, 2013.","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"9368_CR23","doi-asserted-by":"crossref","unstructured":"S.\u00a0Halevi and V.\u00a0Shoup. Algorithms in HElib. In J.\u00a0A. Garay and R.\u00a0Gennaro, editors, Advances in Cryptology \u2013 CRYPTO 2014, Part\u00a0I, pages 554\u2013571. Springer, 2014. Long version at http:\/\/eprint.iacr.org\/2014\/106.","DOI":"10.1007\/978-3-662-44371-2_31"},{"key":"9368_CR24","doi-asserted-by":"crossref","unstructured":"S.\u00a0Halevi and V.\u00a0Shoup. Bootstrapping for HElib. In EUROCRYPT 2015, volume 9056 of Lecture Notes in Computer Science, pages 641\u2013670. Springer, 2015.","DOI":"10.1007\/978-3-662-46800-5_25"},{"key":"9368_CR25","doi-asserted-by":"crossref","unstructured":"S.\u00a0Halevi and V.\u00a0Shoup. Faster homomorphic linear transformations in helib. In H.\u00a0Shacham and A.\u00a0Boldyreva, editors, Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part I, volume 10991 of Lecture Notes in Computer Science, pages 93\u2013120. Springer, 2018.","DOI":"10.1007\/978-3-319-96884-1_4"},{"key":"9368_CR26","unstructured":"S.\u00a0Halevi and V.\u00a0Shoup. HElib - An Implementation of homomorphic encryption. https:\/\/github.com\/shaih\/HElib\/, Accessed September 2014."},{"key":"9368_CR27","doi-asserted-by":"publisher","first-page":"57361","DOI":"10.1109\/ACCESS.2019.2913850","volume":"7","author":"K Han","year":"2019","unstructured":"K.\u00a0Han, M.\u00a0Hhan, and J.\u00a0H. Cheon. Improved homomorphic discrete fourier transforms and FHE bootstrapping. IEEE Access, 7:57361\u201357370, 2019.","journal-title":"IEEE Access"},{"key":"9368_CR28","first-page":"688","volume":"2019","author":"K Han","year":"2019","unstructured":"K.\u00a0Han and D.\u00a0Ki. Better bootstrapping for approximate homomorphic encryption. IACR Cryptology ePrint Archive, 2019:688, 2019.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"9368_CR29","doi-asserted-by":"crossref","unstructured":"J.\u00a0Hoffstein, J.\u00a0Pipher, and J.\u00a0H. Silverman. NTRU: A ring-based public key cryptosystem. In J.\u00a0Buhler, editor, ANTS, volume 1423 of Lecture Notes in Computer Science, pages 267\u2013288. Springer, 1998.","DOI":"10.1007\/BFb0054868"},{"key":"9368_CR30","first-page":"251","volume":"20","author":"E Ju\u00e1rez","year":"2016","unstructured":"E.\u00a0Ju\u00e1rez, R.\u00a0Cort\u00e9s-Maldonado, and F.\u00a0P\u00e9rez-Rodriguez. Relationship between the inverses of a matrix and a submatrix. Computaci\u00f3n y Sistemas, 20:251\u2013262, 2016.","journal-title":"Computaci\u00f3n y Sistemas"},{"key":"9368_CR31","doi-asserted-by":"crossref","unstructured":"A.\u00a0L\u00f3pez-Alt, E.\u00a0Tromer, and V.\u00a0Vaikuntanathan. On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In STOC, pages 1219\u20131234, 2012.","DOI":"10.1145\/2213977.2214086"},{"key":"9368_CR32","doi-asserted-by":"crossref","unstructured":"V.\u00a0Lyubashevsky, C.\u00a0Peikert, and O.\u00a0Regev. On ideal lattices and learning with errors over rings. J. ACM, 60(6):43, 2013. Early version in EUROCRYPT 2010.","DOI":"10.1145\/2535925"},{"key":"9368_CR33","doi-asserted-by":"crossref","unstructured":"V.\u00a0Lyubashevsky, C.\u00a0Peikert, and O.\u00a0Regev. A toolkit for ring-lwe cryptography. Cryptology ePrint Archive, Report 2013\/293, 2013. https:\/\/eprint.iacr.org\/2013\/293.","DOI":"10.1007\/978-3-642-38348-9_3"},{"key":"9368_CR34","doi-asserted-by":"crossref","unstructured":"O.\u00a0Regev. On lattices, learning with errors, random linear codes, and cryptography. J. ACM, 56(6), 2009.","DOI":"10.1145\/1568318.1568324"},{"key":"9368_CR35","unstructured":"R.\u00a0Rivest, L.\u00a0Adleman, and M.\u00a0Dertouzos. On data banks and privacy homomorphisms. In Foundations of Secure Computation, pages 169\u2013177. Academic Press, 1978."},{"key":"9368_CR36","doi-asserted-by":"crossref","unstructured":"K.\u00a0Rohloff and D.\u00a0B. Cousins. A scalable implementation of fully homomorphic encryption built on NTRU. 2nd Workshop on Applied Homomorphic Cryptography and Encrypted Computing, WAHC\u201914, 2014. Available at https:\/\/www.dcsec.uni-hannover.de\/fileadmin\/ful\/mitarbeiter\/brenner\/wahc14_RC.pdf, accessed September 2014.","DOI":"10.1007\/978-3-662-44774-1_18"},{"key":"9368_CR37","unstructured":"S.\u00a0Roman. Field Theory. Springer, 2nd edition, 2005."},{"key":"9368_CR38","doi-asserted-by":"crossref","unstructured":"N.\u00a0P. Smart and F.\u00a0Vercauteren. Fully homomorphic SIMD operations. Des. Codes Cryptography, 71(1):57\u201381, 2014. Early verion at http:\/\/eprint.iacr.org\/2011\/133.","DOI":"10.1007\/s10623-012-9720-4"},{"key":"9368_CR39","doi-asserted-by":"crossref","unstructured":"M.\u00a0van Dijk, C.\u00a0Gentry, S.\u00a0Halevi, and V.\u00a0Vaikuntanathan. Fully homomorphic encryption over the integers. In Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30 - June 3, 2010. Proceedings, pages 24\u201343, 2010.","DOI":"10.1007\/978-3-642-13190-5_2"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-020-09368-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-020-09368-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-020-09368-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T22:35:21Z","timestamp":1698532521000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-020-09368-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["9368"],"URL":"https:\/\/doi.org\/10.1007\/s00145-020-09368-7","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"23 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"7"}}