{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:27:29Z","timestamp":1778128049697,"version":"3.51.4"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031306198","type":"print"},{"value":"9783031306204","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-3-031-30620-4_9","type":"book-chapter","created":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T11:03:05Z","timestamp":1681470185000},"page":"257-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["On Polynomial Functions Modulo $$p^e$$ and\u00a0Faster Bootstrapping for\u00a0Homomorphic Encryption"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4684-3532","authenticated-orcid":false,"given":"Robin","family":"Geelen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9549-1003","authenticated-orcid":false,"given":"Ilia","family":"Iliashenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1093-7978","authenticated-orcid":false,"given":"Jiayi","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7208-9599","authenticated-orcid":false,"given":"Frederik","family":"Vercauteren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,15]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40041-4_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"J Alperin-Sheriff","year":"2013","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"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Amdahl, G.M.: Validity of the single processor approach to achieving large scale computing capabilities. In: Proceedings of the 18\u201320 April 1967, Spring Joint Computer Conference, pp. 483\u2013485 (1967)","DOI":"10.1145\/1465482.1465560"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Araki, T., et al.: Generalizing the SPDZ compiler for other protocols. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 880\u2013895 (2018)","DOI":"10.1145\/3243734.3243854"},{"issue":"490\u2013491","key":"9_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1515\/crll.1997.490.101","volume":"1997","author":"M Bhargava","year":"1997","unstructured":"Bhargava, M.: P-orderings and polynomial functions on arbitrary subsets of dedekind rings. Journal f\u00fcr die reine und angewandte Mathematik (Crelles Journal) 1997(490\u2013491), 101\u2013128 (1997). https:\/\/doi.org\/10.1515\/crll.1997.490.101","journal-title":"Journal f\u00fcr die reine und angewandte Mathematik (Crelles Journal)"},{"key":"9_CR5","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":"9_CR6","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Goldwasser, S. (ed.) ITCS 2012: 3rd Innovations in Theoretical Computer Science, pp. 309\u2013325. Association for Computing Machinery, January 2012. https:\/\/doi.org\/10.1145\/2090236.2090262","DOI":"10.1145\/2090236.2090262"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Carlitz, L.: Functions and polynomials (mod $$p^n$$). Acta Arith. 9(1), 67\u201378 (1964). http:\/\/eudml.org\/doc\/207463","DOI":"10.4064\/aa-9-1-67-78"},{"key":"9_CR8","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, Part I. LNCS, vol. 10820, pp. 315\u2013337. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_12"},{"issue":"1\u20133","key":"9_CR9","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0012-365X(93)E0162-W","volume":"137","author":"Z Chen","year":"1995","unstructured":"Chen, Z.: On polynomial functions from $$\\mathbb{Z} _n$$ to $$\\mathbb{Z} _m$$. Discret. Math. 137(1\u20133), 137\u2013145 (1995)","journal-title":"Discret. Math."},{"key":"9_CR10","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Report 2012\/144 (2012). http:\/\/eprint.iacr.org\/2012\/144"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed.) 41st Annual ACM Symposium on Theory of Computing, pp. 169\u2013178. ACM Press (May\/June 2009). https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-20465-4_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"C Gentry","year":"2011","unstructured":"Gentry, C., Halevi, S.: Implementing gentry\u2019s fully-homomorphic encryption scheme. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 129\u2013148. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_9"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-30057-8_1","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"C Gentry","year":"2012","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Better bootstrapping in fully homomorphic encryption. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 1\u201316. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30057-8_1"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s00453-013-9799-7","volume":"71","author":"A Guha","year":"2015","unstructured":"Guha, A., Dukkipati, A.: An algorithmic characterization of polynomial functions over $$\\mathbb{Z} _{p^n}$$. Algorithmica 71(1), 201\u2013218 (2015)","journal-title":"Algorithmica"},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-020-09368-7","volume":"34","author":"S Halevi","year":"2021","unstructured":"Halevi, S., Shoup, V.: Bootstrapping for helib. J. Cryptol. 34(1), 1\u201344 (2021)","journal-title":"J. Cryptol."},{"issue":"4","key":"9_CR16","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1215\/S0012-7094-68-03589-8","volume":"35","author":"G Keller","year":"1968","unstructured":"Keller, G., Olson, F.R.: Counting polynomial functions (mod $$p^n$$). Duke Math. J. 35(4), 835\u2013838 (1968)","journal-title":"Duke Math. J."},{"issue":"2","key":"9_CR17","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1090\/S0002-9947-1921-1501173-4","volume":"22","author":"AJ Kempner","year":"1921","unstructured":"Kempner, A.J.: Polynomials and their residue systems. Trans. Am. Math. Soc. 22(2), 240\u2013288 (1921)","journal-title":"Trans. Am. Math. Soc."},{"key":"9_CR18","unstructured":"Lee, J.W., Lee, E., Lee, Y., Kim, Y.S., No, J.S.: Optimal minimax polynomial approximation of modular reduction for bootstrapping of approximate homomorphic encryption. Cryptology ePrint Archive, Paper 2020\/552 (2020). https:\/\/eprint.iacr.org\/archive\/2020\/552\/20200803:084202"},{"key":"9_CR19","unstructured":"Li, S.: Null polynomials modulo m. arXiv preprint math\/0510217 (2005)"},{"issue":"1","key":"9_CR20","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/0202007","volume":"2","author":"MS Paterson","year":"1973","unstructured":"Paterson, M.S., Stockmeyer, L.J.: On the number of nonscalar multiplications necessary to evaluate polynomials. SIAM J. Comput. 2(1), 60\u201366 (1973)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"9_CR21","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0022-314X(74)90031-6","volume":"6","author":"D Singmaster","year":"1974","unstructured":"Singmaster, D.: On polynomial functions (mod $$m$$). J. Number Theory 6(5), 345\u2013352 (1974)","journal-title":"J. Number Theory"},{"issue":"1","key":"9_CR22","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10623-012-9720-4","volume":"71","author":"NP Smart","year":"2014","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic SIMD operations. Des. Codes Cryptogr. 71(1), 57\u201381 (2014)","journal-title":"Des. Codes Cryptogr."},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Specker, E., Hungerb\u00fchler, N., Wasem, M.: The ring of polyfunctions over $$\\mathbb{Z}\/n\\mathbb{Z} $$ (2021)","DOI":"10.1080\/00927872.2022.2092628"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30620-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T22:03:22Z","timestamp":1744754602000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30620-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306198","9783031306204"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30620-4_9","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":"15 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"23 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.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":"415","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":"109","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":"26% - 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":"16","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)"}}]}}