{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T18:04:53Z","timestamp":1775585093294,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":32,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819987351","type":"print"},{"value":"9789819987368","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-981-99-8736-8_1","type":"book-chapter","created":{"date-parts":[[2023,12,17]],"date-time":"2023-12-17T06:01:54Z","timestamp":1702792914000},"page":"3-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Amortized Bootstrapping Revisited: Simpler, Asymptotically-Faster, Implemented"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5110-6639","authenticated-orcid":false,"given":"Antonio","family":"Guimar\u00e3es","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1303-3760","authenticated-orcid":false,"given":"Hilder V. L.","family":"Pereira","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3792-4042","authenticated-orcid":false,"given":"Barry","family":"van Leeuwen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,18]]},"reference":[{"key":"1_CR1","unstructured":"zama-ai\/tfhe-rs. (May 2023). https:\/\/github.com\/zama-ai\/tfhe-rs. Accessed 13 Oct 2022"},{"key":"1_CR2","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. Cryptology ePrint Archive, Report 2015\/046 (2015). https:\/\/eprint.iacr.org\/2015\/046"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Alperin-Sheriff, J., Peikert, C.: Faster bootstrapping with polynomial error. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol. 8616, pp. 297\u2013314. Springer, Heidelberg (Aug 2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_17","DOI":"10.1007\/978-3-662-44371-2_17"},{"key":"1_CR4","unstructured":"Bergerat, L., et al.: Parameter optimization and larger precision for (T)FHE. Cryptology ePrint Archive, Report 2022\/704 (2022). https:\/\/eprint.iacr.org\/2022\/704"},{"key":"1_CR5","unstructured":"Boemer, F., Kim, S., Seifu, G., de Souza, F.D., Gopal, V.: Intel HEXL: accelerating homomorphic encryption with intel AVX512-IFMA52. Cryptology ePrint Archive, Report 2021\/420 (2021). https:\/\/eprint.iacr.org\/2021\/420"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Bonnoron, G., Ducas, L., Fillinger, M.: Large FHE gates from tensored homomorphic accumulator. In: Joux, A., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 18. LNCS, vol. 10831, pp. 217\u2013251. Springer, Heidelberg (May 2018). https:\/\/doi.org\/10.1007\/978-3-319-89339-6_13","DOI":"10.1007\/978-3-319-89339-6_13"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Bonte, C., Iliashenko, I., Park, J., Pereira, H.V.L., Smart, N.P.: FINAL: faster FHE instantiated with NTRU and LWE. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, Part II. LNCS, vol. 13792, pp. 188\u2013215. Springer, Heidelberg (Dec 2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_7","DOI":"10.1007\/978-3-031-22966-4_7"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Boura, C., Gama, N., Georgieva, M., Jetchev, D.: Chimera: Combining ring-IWE-based fully homomorphic encryption schemes. J. Math. Cryptol. 14(1), 316\u2013338 (2020). https:\/\/doi.org\/10.1515\/jmc-2019-0026","DOI":"10.1515\/jmc-2019-0026"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Gentry, C., Halevi, S.: Packed ciphertexts in LWE-based homomorphic encryption. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 1\u201313. Springer, Heidelberg (Feb\/Mar 2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_1","DOI":"10.1007\/978-3-642-36362-7_1"},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Goldwasser, S. (ed.) ITCS 2012, pp. 309\u2013325. ACM (Jan 2012). https:\/\/doi.org\/10.1145\/2090236.2090262","DOI":"10.1145\/2090236.2090262"},{"key":"1_CR11","doi-asserted-by":"publisher","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, Part I. LNCS, vol. 10031, pp. 3\u201333. Springer, Heidelberg (Dec 2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_1","DOI":"10.1007\/978-3-662-53887-6_1"},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2020","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: TFHE: fast fully homomorphic encryption over the torus. J. Cryptol. 33(1), 34\u201391 (2020). https:\/\/doi.org\/10.1007\/s00145-019-09319-x","journal-title":"J. Cryptol."},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Ducas, L., Micciancio, D.: FHEW: bootstrapping homomorphic encryption in less than a second. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015, Part I. LNCS, vol. 9056, pp. 617\u2013640. Springer, Heidelberg (Apr 2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_24","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"1_CR14","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Report 2012\/144 (2012). https:\/\/eprint.iacr.org\/2012\/144"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed.) 41st ACM STOC, pp. 169\u2013178. ACM Press (May\/Jun 2009). https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"1_CR16","doi-asserted-by":"publisher","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 (Apr 2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_28","DOI":"10.1007\/978-3-642-29011-4_28"},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 75\u201392. Springer, Heidelberg (Aug 2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Guimar\u00e3es, A., Pereira, H.V.L., Leeuwen, B.V.: Amortized Bootstrapping Revisited: Simpler, Asymptotically-Faster, Implemented (2023). https:\/\/eprint.iacr.org\/2023\/014 Report Number: 014","DOI":"10.1007\/978-981-99-8736-8_1"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Halevi, S., Polyakov, Y., Shoup, V.: An improved RNS variant of the BFV homomorphic encryption scheme. In: Matsui, M. (ed.) CT-RSA 2019. LNCS, vol. 11405, pp. 83\u2013105. Springer, Heidelberg (Mar 2019). https:\/\/doi.org\/10.1007\/978-3-030-12612-4_5","DOI":"10.1007\/978-3-030-12612-4_5"},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Halevi, S., Shoup, V.: Bootstrapping for HElib. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015, Part I. LNCS, vol. 9056, pp. 641\u2013670. Springer, Heidelberg (Apr 2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_25","DOI":"10.1007\/978-3-662-46800-5_25"},{"key":"1_CR21","unstructured":"Kim, A., et al.: General bootstrapping approach for RLWE-based homomorphic encryption. Cryptology ePrint Archive, Report 2021\/691 (2021). https:\/\/eprint.iacr.org\/2021\/691"},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Kim, A., Polyakov, Y., Zucca, V.: Revisiting homomorphic encryption schemes for finite fields. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021, Part III. LNCS, vol. 13092, pp. 608\u2013639. Springer, Heidelberg (Dec 2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_21","DOI":"10.1007\/978-3-030-92078-4_21"},{"key":"1_CR23","unstructured":"Lee, Y., et al.: Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption. Cryptology ePrint Archive, Report 2022\/198 (2022). https:\/\/eprint.iacr.org\/2022\/198"},{"key":"1_CR24","doi-asserted-by":"publisher","unstructured":"Liu, F.H., Wang, H.: Batch bootstrapping I: a new framework for SIMD bootstrapping in polynomial modulus. In: EUROCRYPT 2023, Part III. LNCS, vol. 14006, pp. 321\u2013352. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_11","DOI":"10.1007\/978-3-031-30620-4_11"},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Liu, F.H., Wang, H.: Batch bootstrapping II: bootstrapping polynomial modulus only requires \u00d5(1) the multiplications amortization. In: EUROCRYPT 2023, Part III. LNCS, vol. 14006, pp. 353\u2013384. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_12","DOI":"10.1007\/978-3-031-30620-4_12"},{"key":"1_CR26","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1\u201323. Springer, Heidelberg (May\/Jun 2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"1_CR27","doi-asserted-by":"publisher","unstructured":"MATZOV: Report on the Security of LWE: Improved Dual Lattice Attack (Apr 2022). https:\/\/doi.org\/10.5281\/zenodo.6412487","DOI":"10.5281\/zenodo.6412487"},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Sorrell, J.: Ring packing and amortized FHEW bootstrapping. In: Chatzigiannakis, I., Kaklamanis, C., Marx, D., Sannella, D. (eds.) ICALP 2018. LIPIcs, vol. 107, pp. 100:1\u2013100:14. Schloss Dagstuhl (Jul 2018).https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.100","DOI":"10.4230\/LIPIcs.ICALP.2018.100"},{"key":"1_CR29","unstructured":"Micheli, G.D., Kim, D., Micciancio, D., Suhl, A.: Faster Amortized FHEW bootstrapping using Ring Automorphisms (2023). https:\/\/eprint.iacr.org\/2023\/112. Report Number: 112"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Nussbaumer, H.: Fast polynomial transform algorithms for digital convolution. IEEE Trans. Acoust. Speech Signal Process. 28(2), 205\u2013215 (1980)","DOI":"10.1109\/TASSP.1980.1163372"},{"key":"1_CR31","doi-asserted-by":"publisher","unstructured":"Pereira, H.V.L.: Bootstrapping fully homomorphic encryption over the integers in less than one second. In: Garay, J. (ed.) PKC 2021, Part I. LNCS, vol. 12710, pp. 331\u2013359. Springer, Heidelberg (May 2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_13","DOI":"10.1007\/978-3-030-75245-3_13"},{"key":"1_CR32","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) 37th ACM STOC, pp. 84\u201393. ACM Press (May 2005). https:\/\/doi.org\/10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8736-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T01:02:24Z","timestamp":1765933344000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8736-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819987351","9789819987368"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8736-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"375","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"106","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}