{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T18:00:43Z","timestamp":1773424843228,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"German Ministry for Education and Research","award":["CISPA-Stanford Center for Cybersecurity (Funding number: 16KIS0)"],"award-info":[{"award-number":["CISPA-Stanford Center for Cybersecurity (Funding number: 16KIS0)"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3548606.3560700","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"1783-1797","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["NTRU-v-um"],"prefix":"10.1145","author":[{"given":"Kamil","family":"Kluczniak","sequence":"first","affiliation":[{"name":"CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"IEEE Standard Specification for Public Key Cryptographic Techniques Based on Hard Problems over Lattices","year":"2008","unstructured":"2009. IEEE Standard Specification for Public Key Cryptographic Techniques Based on Hard Problems over Lattices . IEEE Std 1363.1-- 2008 (2009), 1--81. https: \/\/doi.org\/10.1109\/IEEESTD.2009.4800404 10.1109\/IEEESTD.2009.4800404 2009. IEEE Standard Specification for Public Key Cryptographic Techniques Based on Hard Problems over Lattices. IEEE Std 1363.1--2008 (2009), 1--81. https: \/\/doi.org\/10.1109\/IEEESTD.2009.4800404"},{"key":"e_1_3_2_1_2_1","unstructured":"2021. PALISADE Lattice Cryptography Library (release 1.11.5). https:\/\/palisadecrypto.org\/.  2021. PALISADE Lattice Cryptography Library (release 1.11.5). https:\/\/palisadecrypto.org\/."},{"key":"e_1_3_2_1_3_1","unstructured":"2022. FHE-Deck. https:\/\/github.com\/FHE-Deck.  2022. FHE-Deck. https:\/\/github.com\/FHE-Deck."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Gorjan Alagic Jacob Alperin-Sheriff Daniel Apon David Cooper Quynh Dang John Kelsey Yi-Kai Liu Carl Miller Dustin Moody Rene Peralta etal 2020. Status report on the second round of the NIST post-quantum cryptography standardization process. US Department of Commerce NIST (2020).  Gorjan Alagic Jacob Alperin-Sheriff Daniel Apon David Cooper Quynh Dang John Kelsey Yi-Kai Liu Carl Miller Dustin Moody Rene Peralta et al. 2020. Status report on the second round of the NIST post-quantum cryptography standardization process. US Department of Commerce NIST (2020).","DOI":"10.6028\/NIST.IR.8240"},{"key":"e_1_3_2_1_5_1","volume-title":"Part I (Lecture Notes in Computer Science","volume":"178","author":"Albrecht Martin R.","year":"2016","unstructured":"Martin R. Albrecht , Shi Bai , and L\u00e9o Ducas . 2016 . A Subfield Lattice Attack on Overstretched NTRU Assumptions - Cryptanalysis of Some FHE and Graded Encoding Schemes. In Advances in Cryptology -- CRYPTO 2016 , Part I (Lecture Notes in Computer Science , Vol. 9814), Matthew Robshaw and Jonathan Katz (Eds.). Springer, Heidelberg, 153-- 178 . https:\/\/doi.org\/10.1007\/978--3--662--53018--4_6 10.1007\/978--3--662--53018--4_6 Martin R. Albrecht, Shi Bai, and L\u00e9o Ducas. 2016. A Subfield Lattice Attack on Overstretched NTRU Assumptions - Cryptanalysis of Some FHE and Graded Encoding Schemes. In Advances in Cryptology -- CRYPTO 2016, Part I (Lecture Notes in Computer Science, Vol. 9814), Matthew Robshaw and Jonathan Katz (Eds.). Springer, Heidelberg, 153--178. https:\/\/doi.org\/10.1007\/978--3--662--53018--4_6"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1515\/jmc-2015-0016"},{"key":"e_1_3_2_1_7_1","volume-title":"Part I (Lecture Notes in Computer Science","volume":"20","author":"Alperin-Sheriff Jacob","year":"2013","unstructured":"Jacob Alperin-Sheriff and Chris Peikert . 2013 . Practical Bootstrapping in Quasilinear Time. In Advances in Cryptology -- CRYPTO 2013 , Part I (Lecture Notes in Computer Science , Vol. 8042), Ran Canetti and Juan A. Garay (Eds.). Springer, Heidelberg, 1-- 20 . https:\/\/doi.org\/10.1007\/978--3--642--40041--4_1 10.1007\/978--3--642--40041--4_1 Jacob Alperin-Sheriff and Chris Peikert. 2013. Practical Bootstrapping in Quasilinear Time. In Advances in Cryptology -- CRYPTO 2013, Part I (Lecture Notes in Computer Science, Vol. 8042), Ran Canetti and Juan A. Garay (Eds.). Springer, Heidelberg, 1--20. https:\/\/doi.org\/10.1007\/978--3--642--40041--4_1"},{"key":"e_1_3_2_1_8_1","volume-title":"Part I (Lecture Notes in Computer Science","volume":"314","author":"Alperin-Sheriff Jacob","year":"2014","unstructured":"Jacob Alperin-Sheriff and Chris Peikert . 2014 . Faster Bootstrapping with Polynomial Error. In Advances in Cryptology -- CRYPTO 2014 , Part I (Lecture Notes in Computer Science , Vol. 8616), Juan A. Garay and Rosario Gennaro (Eds.). Springer, Heidelberg, 297-- 314 . https:\/\/doi.org\/10.1007\/978--3--662--44371--2_17 10.1007\/978--3--662--44371--2_17 Jacob Alperin-Sheriff and Chris Peikert. 2014. Faster Bootstrapping with Polynomial Error. In Advances in Cryptology -- CRYPTO 2014, Part I (Lecture Notes in Computer Science, Vol. 8616), Juan A. Garay and Rosario Gennaro (Eds.). Springer, Heidelberg, 297--314. https:\/\/doi.org\/10.1007\/978--3--662--44371--2_17"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"e_1_3_2_1_11_1","volume-title":"Vinodh Gopal, et al.","author":"Boemer Fabian","year":"2021","unstructured":"Fabian Boemer , Sejun Kim , Gelila Seifu , Fillipe DM de Souza , Vinodh Gopal, et al. 2021 . Intel HEXL ( release 1.2). https:\/\/github.com\/intel\/hexl. Fabian Boemer, Sejun Kim, Gelila Seifu, Fillipe DM de Souza, Vinodh Gopal, et al. 2021. Intel HEXL (release 1.2). https:\/\/github.com\/intel\/hexl."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-89339-6_13"},{"key":"e_1_3_2_1_13_1","volume-title":"Smart","author":"Bonte Charlotte","year":"2022","unstructured":"Charlotte Bonte , Ilia Iliashenko , Jeongeun Park , Hilder V. L. Pereira , and Nigel P . Smart . 2022 . FINAL : Faster FHE instantiated with NTRU and LWE. Cryptology ePrint Archive, Report 2022\/074. https:\/\/eprint.iacr.org\/2022\/074. Charlotte Bonte, Ilia Iliashenko, Jeongeun Park, Hilder V. L. Pereira, and Nigel P. Smart. 2022. FINAL: Faster FHE instantiated with NTRU and LWE. Cryptology ePrint Archive, Report 2022\/074. https:\/\/eprint.iacr.org\/2022\/074."},{"key":"e_1_3_2_1_14_1","volume-title":"Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme","author":"Bos Joppe W.","unstructured":"Joppe W. Bos , Kristin Lauter , Jake Loftus , and Michael Naehrig . 2013. Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme . In Cryptography and Coding, Martijn Stam (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg , 45--64. Joppe W. Bos, Kristin Lauter, Jake Loftus, and Michael Naehrig. 2013. Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme. In Cryptography and Coding, Martijn Stam (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 45--64."},{"key":"e_1_3_2_1_15_1","volume-title":"Part I (Lecture Notes in Computer Science","volume":"617","author":"Bossuat Jean-Philippe","year":"2021","unstructured":"Jean-Philippe Bossuat , Christian Mouchet , Juan Ram\u00f3n Troncoso-Pastoriza , and Jean-Pierre Hubaux . 2021 . Efficient Bootstrapping for Approximate Homomorphic Encryption with Non-sparse Keys. In Advances in Cryptology -- EUROCRYPT 2021 , Part I (Lecture Notes in Computer Science , Vol. 12696), Anne Canteaut and Fran\u00e7ois-Xavier Standaert (Eds.). Springer, Heidelberg, 587-- 617 . https:\/\/doi.org\/10.1007\/978--3-030--77870--5_21 10.1007\/978--3-030--77870--5_21 Jean-Philippe Bossuat, Christian Mouchet, Juan Ram\u00f3n Troncoso-Pastoriza, and Jean-Pierre Hubaux. 2021. Efficient Bootstrapping for Approximate Homomorphic Encryption with Non-sparse Keys. In Advances in Cryptology -- EUROCRYPT 2021, Part I (Lecture Notes in Computer Science, Vol. 12696), Anne Canteaut and Fran\u00e7ois-Xavier Standaert (Eds.). Springer, Heidelberg, 587--617. https:\/\/doi.org\/10.1007\/978--3-030--77870--5_21"},{"key":"e_1_3_2_1_16_1","volume-title":"Part III (Lecture Notes in Computer Science","volume":"512","author":"Bourse Florian","year":"2018","unstructured":"Florian Bourse , Michele Minelli , Matthias Minihold , and Pascal Paillier . 2018 . Fast Homomorphic Evaluation of Deep Discretized Neural Networks. In Advances in Cryptology -- CRYPTO 2018 , Part III (Lecture Notes in Computer Science , Vol. 10993), Hovav Shacham and Alexandra Boldyreva (Eds.). Springer, Heidelberg, 483-- 512 . https:\/\/doi.org\/10.1007\/978--3--319--96878-0_17 10.1007\/978--3--319--96878-0_17 Florian Bourse, Michele Minelli, Matthias Minihold, and Pascal Paillier. 2018. Fast Homomorphic Evaluation of Deep Discretized Neural Networks. In Advances in Cryptology -- CRYPTO 2018, Part III (Lecture Notes in Computer Science, Vol. 10993), Hovav Shacham and Alexandra Boldyreva (Eds.). Springer, Heidelberg, 483--512. https:\/\/doi.org\/10.1007\/978--3--319--96878-0_17"},{"key":"e_1_3_2_1_17_1","volume-title":"Advances in Cryptology -- CRYPTO 2012 (Lecture Notes in Computer Science","author":"Brakerski Zvika","year":"2009","unstructured":"Zvika Brakerski . 2012. Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP . In Advances in Cryptology -- CRYPTO 2012 (Lecture Notes in Computer Science , Vol. 7417), Reihaneh Safavi-Naini and Ran Canetti (Eds.). Springer, Heidelberg, 868-- 886 . https:\/\/doi.org\/10.1007\/978--3--642--3 2009 --5_50 10.1007\/978--3--642--32009--5_50 Zvika Brakerski. 2012. Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP. In Advances in Cryptology -- CRYPTO 2012 (Lecture Notes in Computer Science, Vol. 7417), Reihaneh Safavi-Naini and Ran Canetti (Eds.). Springer, Heidelberg, 868--886. https:\/\/doi.org\/10.1007\/978--3--642--32009--5_50"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.12"},{"key":"e_1_3_2_1_20_1","volume-title":"Topics in Cryptology -- CT-RSA 2019 (Lecture Notes in Computer Science","author":"Carpov Sergiu","unstructured":"Sergiu Carpov , Malika Izabach\u00e8ne , and Victor Mollimard . 2019. New Techniques for Multi-value Input Homomorphic Evaluation and Applications . In Topics in Cryptology -- CT-RSA 2019 (Lecture Notes in Computer Science , Vol. 11405), Mitsuru Matsui (Ed.). Springer, Heidelberg, 106-- 126 . https:\/\/doi.org\/10.1007\/978--3-030- 12612--4_6 10.1007\/978--3-030- Sergiu Carpov, Malika Izabach\u00e8ne, and Victor Mollimard. 2019. New Techniques for Multi-value Input Homomorphic Evaluation and Applications. In Topics in Cryptology -- CT-RSA 2019 (Lecture Notes in Computer Science, Vol. 11405), Mitsuru Matsui (Ed.). Springer, Heidelberg, 106--126. https:\/\/doi.org\/10.1007\/978--3-030- 12612--4_6"},{"key":"e_1_3_2_1_21_1","volume-title":"Part II (Lecture Notes in Computer Science","volume":"54","author":"Chen Hao","year":"2019","unstructured":"Hao Chen , Ilaria Chillotti , and Yongsoo Song . 2019 . Improved Bootstrapping for Approximate Homomorphic Encryption. In Advances in Cryptology -- EUROCRYPT 2019 , Part II (Lecture Notes in Computer Science , Vol. 11477), Yuval Ishai and Vincent Rijmen (Eds.). Springer, Heidelberg, 34-- 54 . https:\/\/doi.org\/10.1007\/978- 3-030--17656--3_2 10.1007\/978- Hao Chen, Ilaria Chillotti, and Yongsoo Song. 2019. Improved Bootstrapping for Approximate Homomorphic Encryption. In Advances in Cryptology -- EUROCRYPT 2019, Part II (Lecture Notes in Computer Science, Vol. 11477), Yuval Ishai and Vincent Rijmen (Eds.). Springer, Heidelberg, 34--54. https:\/\/doi.org\/10.1007\/978- 3-030--17656--3_2"},{"key":"e_1_3_2_1_22_1","volume-title":"Part I (Lecture Notes in Computer Science","volume":"337","author":"Chen Hao","year":"2018","unstructured":"Hao Chen and Kyoohyung Han . 2018 . Homomorphic Lower Digits Removal and Improved FHE Bootstrapping. In Advances in Cryptology -- EUROCRYPT 2018 , Part I (Lecture Notes in Computer Science , Vol. 10820), Jesper Buus Nielsen and Vincent Rijmen (Eds.). Springer, Heidelberg, 315-- 337 . https:\/\/doi.org\/10.1007\/978- 3--319--78381--9_12 10.1007\/978- Hao Chen and Kyoohyung Han. 2018. Homomorphic Lower Digits Removal and Improved FHE Bootstrapping. In Advances in Cryptology -- EUROCRYPT 2018, Part I (Lecture Notes in Computer Science, Vol. 10820), Jesper Buus Nielsen and Vincent Rijmen (Eds.). Springer, Heidelberg, 315--337. https:\/\/doi.org\/10.1007\/978- 3--319--78381--9_12"},{"key":"e_1_3_2_1_23_1","volume-title":"Part I (Lecture Notes in Computer Science","volume":"384","author":"Cheon Jung Hee","year":"2018","unstructured":"Jung Hee Cheon , Kyoohyung Han , Andrey Kim , Miran Kim , and Yongsoo Song . 2018 . Bootstrapping for Approximate Homomorphic Encryption. In Advances in Cryptology -- EUROCRYPT 2018 , Part I (Lecture Notes in Computer Science , Vol. 10820), Jesper Buus Nielsen and Vincent Rijmen (Eds.). Springer, Heidelberg, 360-- 384 . https:\/\/doi.org\/10.1007\/978--3--319--78381--9_14 10.1007\/978--3--319--78381--9_14 Jung Hee Cheon, Kyoohyung Han, Andrey Kim, Miran Kim, and Yongsoo Song. 2018. Bootstrapping for Approximate Homomorphic Encryption. In Advances in Cryptology -- EUROCRYPT 2018, Part I (Lecture Notes in Computer Science, Vol. 10820), Jesper Buus Nielsen and Vincent Rijmen (Eds.). Springer, Heidelberg, 360--384. https:\/\/doi.org\/10.1007\/978--3--319--78381--9_14"},{"key":"e_1_3_2_1_24_1","volume-title":"A","author":"Cheon Jung Hee","year":"2016","unstructured":"Jung Hee Cheon , Jinhyuck Jeong , and Changmin Lee . 2016. An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a lowlevel encoding of zero. LMS Journal of Computation and Mathematics 19 , A ( 2016 ), 255--266. https:\/\/doi.org\/10.1112\/S1461157016000371 10.1112\/S1461157016000371 Jung Hee Cheon, Jinhyuck Jeong, and Changmin Lee. 2016. An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a lowlevel encoding of zero. LMS Journal of Computation and Mathematics 19, A (2016), 255--266. https:\/\/doi.org\/10.1112\/S1461157016000371"},{"key":"e_1_3_2_1_25_1","volume-title":"Part I (Lecture Notes in Computer Science","volume":"437","author":"Cheon Jung Hee","year":"2017","unstructured":"Jung Hee Cheon , Andrey Kim , Miran Kim , and Yong Soo Song . 2017 . Homomorphic Encryption for Arithmetic of Approximate Numbers. In Advances in Cryptology -- ASIACRYPT 2017 , Part I (Lecture Notes in Computer Science , Vol. 10624), Tsuyoshi Takagi and Thomas Peyrin (Eds.). Springer, Heidelberg, 409-- 437 . https:\/\/doi.org\/10.1007\/978--3--319--70694--8_15 10.1007\/978--3--319--70694--8_15 Jung Hee Cheon, Andrey Kim, Miran Kim, and Yong Soo Song. 2017. Homomorphic Encryption for Arithmetic of Approximate Numbers. In Advances in Cryptology -- ASIACRYPT 2017, Part I (Lecture Notes in Computer Science, Vol. 10624), Tsuyoshi Takagi and Thomas Peyrin (Eds.). Springer, Heidelberg, 409--437. https:\/\/doi.org\/10.1007\/978--3--319--70694--8_15"},{"key":"e_1_3_2_1_26_1","volume-title":"Part I (Lecture Notes in Computer Science","volume":"33","author":"Chillotti Ilaria","year":"2016","unstructured":"Ilaria Chillotti , Nicolas Gama , Mariya Georgieva , and Malika Izabach\u00e8ne . 2016 . Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds. In Advances in Cryptology -- ASIACRYPT 2016 , Part I (Lecture Notes in Computer Science , Vol. 10031), Jung Hee Cheon and Tsuyoshi Takagi (Eds.). Springer, Heidelberg, 3-- 33 . https:\/\/doi.org\/10.1007\/978--3--662--53887--6_1 10.1007\/978--3--662--53887--6_1 Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, and Malika Izabach\u00e8ne. 2016. Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds. In Advances in Cryptology -- ASIACRYPT 2016, Part I (Lecture Notes in Computer Science, Vol. 10031), Jung Hee Cheon and Tsuyoshi Takagi (Eds.). Springer, Heidelberg, 3--33. https:\/\/doi.org\/10.1007\/978--3--662--53887--6_1"},{"key":"e_1_3_2_1_27_1","volume-title":"Part I (Lecture Notes in Computer Science","volume":"408","author":"Chillotti Ilaria","year":"2017","unstructured":"Ilaria Chillotti , Nicolas Gama , Mariya Georgieva , and Malika Izabach\u00e8ne . 2017 . Faster Packed Homomorphic Operations and Efficient Circuit Bootstrapping for TFHE. In Advances in Cryptology -- ASIACRYPT 2017 , Part I (Lecture Notes in Computer Science , Vol. 10624), Tsuyoshi Takagi and Thomas Peyrin (Eds.). Springer, Heidelberg, 377-- 408 . https:\/\/doi.org\/10.1007\/978--3--319--70694--8_14 10.1007\/978--3--319--70694--8_14 Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, and Malika Izabach\u00e8ne. 2017. Faster Packed Homomorphic Operations and Efficient Circuit Bootstrapping for TFHE. In Advances in Cryptology -- ASIACRYPT 2017, Part I (Lecture Notes in Computer Science, Vol. 10624), Tsuyoshi Takagi and Thomas Peyrin (Eds.). Springer, Heidelberg, 377--408. https:\/\/doi.org\/10.1007\/978--3--319--70694--8_14"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-019-09319-x"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92078-4_23"},{"key":"e_1_3_2_1_30_1","volume-title":"Smart","author":"Costache Ana","year":"2016","unstructured":"Ana Costache and Nigel P . Smart . 2016 . Which Ring Based Somewhat Homomorphic Encryption Scheme is Best?. In Topics in Cryptology -- CT-RSA 2016 (Lecture Notes in Computer Science , Vol. 9610), Kazue Sako (Ed.). Springer, Heidelberg, 325-- 340 . https:\/\/doi.org\/10.1007\/978--3--319--29485--8_19 10.1007\/978--3--319--29485--8_19 Ana Costache and Nigel P. Smart. 2016. Which Ring Based Somewhat Homomorphic Encryption Scheme is Best?. In Topics in Cryptology -- CT-RSA 2016 (Lecture Notes in Computer Science, Vol. 9610), Kazue Sako (Ed.). Springer, Heidelberg, 325--340. https:\/\/doi.org\/10.1007\/978--3--319--29485--8_19"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/11496137_12"},{"key":"e_1_3_2_1_32_1","volume-title":"Part I (Lecture Notes in Computer Science","volume":"640","author":"Ducas L\u00e9o","year":"2015","unstructured":"L\u00e9o Ducas and Daniele Micciancio . 2015 . FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second. In Advances in Cryptology -- EUROCRYPT 2015 , Part I (Lecture Notes in Computer Science , Vol. 9056), Elisabeth Oswald and Marc Fischlin (Eds.). Springer, Heidelberg, 617-- 640 . https:\/\/doi.org\/10.1007\/978--3--662- 46800--5_24 10.1007\/978--3--662- L\u00e9o Ducas and Daniele Micciancio. 2015. FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second. In Advances in Cryptology -- EUROCRYPT 2015, Part I (Lecture Notes in Computer Science, Vol. 9056), Elisabeth Oswald and Marc Fischlin (Eds.). Springer, Heidelberg, 617--640. https:\/\/doi.org\/10.1007\/978--3--662- 46800--5_24"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92068-5_1"},{"key":"e_1_3_2_1_35_1","volume-title":"Johnson","author":"Frigo Matteo","year":"2021","unstructured":"Matteo Frigo and Steven G . Johnson . 2021 . FFTW. https:\/\/www.fftw.org. Matteo Frigo and Steven G. Johnson. 2021. FFTW. https:\/\/www.fftw.org."},{"key":"e_1_3_2_1_36_1","volume-title":"Part II (Lecture Notes in Computer Science","volume":"502","author":"Genise Nicholas","year":"2019","unstructured":"Nicholas Genise , Craig Gentry , Shai Halevi , Baiyu Li , and Daniele Micciancio . 2019 . Homomorphic Encryption for Finite Automata. In Advances in Cryptology -- ASIACRYPT 2019 , Part II (Lecture Notes in Computer Science , Vol. 11922), Steven D. Galbraith and Shiho Moriai (Eds.). Springer, Heidelberg, 473-- 502 . https:\/\/doi. org\/10.1007\/978--3-030--34621--8_17 Nicholas Genise, Craig Gentry, Shai Halevi, Baiyu Li, and Daniele Micciancio. 2019. Homomorphic Encryption for Finite Automata. In Advances in Cryptology -- ASIACRYPT 2019, Part II (Lecture Notes in Computer Science, Vol. 11922), Steven D. Galbraith and Shiho Moriai (Eds.). Springer, Heidelberg, 473--502. https:\/\/doi. org\/10.1007\/978--3-030--34621--8_17"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_38_1","volume-title":"Asymptotically-Faster, Attribute-Based. In Advances in Cryptology -- CRYPTO","author":"Gentry Craig","year":"2013","unstructured":"Craig Gentry , Amit Sahai , and Brent Waters . 2013. Homomorphic Encryption from Learning with Errors: Conceptually-Simpler , Asymptotically-Faster, Attribute-Based. In Advances in Cryptology -- CRYPTO 2013 , Part I (Lecture Notes in Computer Science , Vol. 8042), Ran Canetti and Juan A. Garay (Eds.). Springer, Heidelberg, 75-- 92 . https:\/\/doi.org\/10.1007\/978--3--642--40041--4_5 10.1007\/978--3--642--40041--4_5 Craig Gentry, Amit Sahai, and Brent Waters. 2013. Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based. In Advances in Cryptology -- CRYPTO 2013, Part I (Lecture Notes in Computer Science, Vol. 8042), Ran Canetti and Juan A. Garay (Eds.). Springer, Heidelberg, 75--92. https:\/\/doi.org\/10.1007\/978--3--642--40041--4_5"},{"key":"e_1_3_2_1_39_1","volume-title":"Advances in Cryptology -- EUROCRYPT 2002 (Lecture Notes in Computer Science","author":"Gentry Craig","unstructured":"Craig Gentry and Michael Szydlo . 2002. Cryptanalysis of the Revised NTRU Signature Scheme . In Advances in Cryptology -- EUROCRYPT 2002 (Lecture Notes in Computer Science , Vol. 2332), Lars R. Knudsen (Ed.). Springer, Heidelberg, 299-- 320 . https:\/\/doi.org\/10.1007\/3--540--46035--7_20 10.1007\/3--540--46035--7_20 Craig Gentry and Michael Szydlo. 2002. Cryptanalysis of the Revised NTRU Signature Scheme. In Advances in Cryptology -- EUROCRYPT 2002 (Lecture Notes in Computer Science, Vol. 2332), Lars R. Knudsen (Ed.). Springer, Heidelberg, 299--320. https:\/\/doi.org\/10.1007\/3--540--46035--7_20"},{"key":"e_1_3_2_1_40_1","first-page":"2","article-title":"Revisiting the functional bootstrap in TFHE","volume":"2021","author":"Guimar\u00e3es Antonio","year":"2021","unstructured":"Antonio Guimar\u00e3es , Edson Borin , and Diego F. Aranha . 2021 . Revisiting the functional bootstrap in TFHE . IACR Transactions on Cryptographic Hardware and Embedded Systems 2021 , 2 (Feb. 2021), 229--253. https:\/\/doi.org\/10.46586\/tches. v2021.i2.229--253 10.46586\/tches Antonio Guimar\u00e3es, Edson Borin, and Diego F. Aranha. 2021. Revisiting the functional bootstrap in TFHE. IACR Transactions on Cryptographic Hardware and Embedded Systems 2021, 2 (Feb. 2021), 229--253. https:\/\/doi.org\/10.46586\/tches. v2021.i2.229--253","journal-title":"IACR Transactions on Cryptographic Hardware and Embedded Systems"},{"key":"e_1_3_2_1_41_1","volume-title":"Part I (Lecture Notes in Computer Science","volume":"670","author":"Halevi Shai","year":"2015","unstructured":"Shai Halevi and Victor Shoup . 2015 . Bootstrapping for HElib. In Advances in Cryptology -- EUROCRYPT 2015 , Part I (Lecture Notes in Computer Science , Vol. 9056), Elisabeth Oswald and Marc Fischlin (Eds.). Springer, Heidelberg, 641-- 670 . https:\/\/doi.org\/10.1007\/978--3--662--46800--5_25 10.1007\/978--3--662--46800--5_25 Shai Halevi and Victor Shoup. 2015. Bootstrapping for HElib. In Advances in Cryptology -- EUROCRYPT 2015, Part I (Lecture Notes in Computer Science, Vol. 9056), Elisabeth Oswald and Marc Fischlin (Eds.). Springer, Heidelberg, 641-- 670. https:\/\/doi.org\/10.1007\/978--3--662--46800--5_25"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-020-09368-7"},{"key":"e_1_3_2_1_43_1","volume-title":"Topics in Cryptology -- CT-RSA 2020 (Lecture Notes in Computer Science","author":"Han Kyoohyung","unstructured":"Kyoohyung Han and Dohyeong Ki. 2020. Better Bootstrapping for Approximate Homomorphic Encryption . In Topics in Cryptology -- CT-RSA 2020 (Lecture Notes in Computer Science , Vol. 12006), Stanislaw Jarecki (Ed.). Springer, Heidelberg, 364-- 390 . https:\/\/doi.org\/10.1007\/978--3-030--40186--3_16 10.1007\/978--3-030--40186--3_16 Kyoohyung Han and Dohyeong Ki. 2020. Better Bootstrapping for Approximate Homomorphic Encryption. In Topics in Cryptology -- CT-RSA 2020 (Lecture Notes in Computer Science, Vol. 12006), Stanislaw Jarecki (Ed.). Springer, Heidelberg, 364--390. https:\/\/doi.org\/10.1007\/978--3-030--40186--3_16"},{"key":"e_1_3_2_1_44_1","volume-title":"Packing Messages and Optimizing Bootstrapping in GSW-FHE. In PKC 2015: 18th International Conference on Theory and Practice of Public Key Cryptography (Lecture Notes in Computer Science","volume":"715","author":"Hiromasa Ryo","year":"2015","unstructured":"Ryo Hiromasa , Masayuki Abe , and Tatsuaki Okamoto . 2015 . Packing Messages and Optimizing Bootstrapping in GSW-FHE. In PKC 2015: 18th International Conference on Theory and Practice of Public Key Cryptography (Lecture Notes in Computer Science , Vol. 9020), Jonathan Katz (Ed.). Springer, Heidelberg, 699-- 715 . https:\/\/doi.org\/10.1007\/978--3--662--46447--2_31 10.1007\/978--3--662--46447--2_31 Ryo Hiromasa, Masayuki Abe, and Tatsuaki Okamoto. 2015. Packing Messages and Optimizing Bootstrapping in GSW-FHE. In PKC 2015: 18th International Conference on Theory and Practice of Public Key Cryptography (Lecture Notes in Computer Science, Vol. 9020), Jonathan Katz (Ed.). Springer, Heidelberg, 699--715. https:\/\/doi.org\/10.1007\/978--3--662--46447--2_31"},{"key":"e_1_3_2_1_45_1","volume-title":"Silverman","author":"Hoffstein Jeffrey","year":"1998","unstructured":"Jeffrey Hoffstein , Jill Pipher , and Joseph H . Silverman . 1998 . NTRU : A ring-based public key cryptosystem. In Algorithmic Number Theory, Joe P. Buhler (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg, 267--288. Jeffrey Hoffstein, Jill Pipher, and Joseph H. Silverman. 1998. NTRU: A ring-based public key cryptosystem. In Algorithmic Number Theory, Joe P. Buhler (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 267--288."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92078-4_21"},{"key":"e_1_3_2_1_47_1","volume-title":"Advances in Cryptology -- EUROCRYPT'99 (Lecture Notes in Computer Science","author":"Kipnis Aviad","unstructured":"Aviad Kipnis , Jacques Patarin , and Louis Goubin . 1999. Unbalanced Oil and Vinegar Signature Schemes . In Advances in Cryptology -- EUROCRYPT'99 (Lecture Notes in Computer Science , Vol. 1592), Jacques Stern (Ed.). Springer, Heidelberg, 206-- 222 . https:\/\/doi.org\/10.1007\/3--540--48910-X_15 10.1007\/3--540--48910-X_15 Aviad Kipnis, Jacques Patarin, and Louis Goubin. 1999. Unbalanced Oil and Vinegar Signature Schemes. In Advances in Cryptology -- EUROCRYPT'99 (Lecture Notes in Computer Science, Vol. 1592), Jacques Stern (Ed.). Springer, Heidelberg, 206--222. https:\/\/doi.org\/10.1007\/3--540--48910-X_15"},{"key":"e_1_3_2_1_48_1","volume-title":"Part I (Lecture Notes in Computer Science","volume":"26","author":"Kirchner Paul","year":"2017","unstructured":"Paul Kirchner and Pierre-Alain Fouque . 2017 . Revisiting Lattice Attacks on Overstretched NTRU Parameters. In Advances in Cryptology -- EUROCRYPT 2017 , Part I (Lecture Notes in Computer Science , Vol. 10210), Jean-S\u00e9bastien Coron and Jesper Buus Nielsen (Eds.). Springer, Heidelberg, 3-- 26 . https:\/\/doi.org\/10.1007\/ 978--3--319--56620--7_1 Paul Kirchner and Pierre-Alain Fouque. 2017. Revisiting Lattice Attacks on Overstretched NTRU Parameters. In Advances in Cryptology -- EUROCRYPT 2017, Part I (Lecture Notes in Computer Science, Vol. 10210), Jean-S\u00e9bastien Coron and Jesper Buus Nielsen (Eds.). Springer, Heidelberg, 3--26. https:\/\/doi.org\/10.1007\/ 978--3--319--56620--7_1"},{"key":"e_1_3_2_1_49_1","unstructured":"Kamil Kluczniak. 2022. NTRU-??-um: Secure Fully Homomorphic Encryption from NTRU with Small Modulus. Cryptology ePrint Archive Paper 2022\/089. https:\/\/eprint.iacr.org\/2022\/089 https:\/\/eprint.iacr.org\/2022\/089.  Kamil Kluczniak. 2022. NTRU-??-um: Secure Fully Homomorphic Encryption from NTRU with Small Modulus. Cryptology ePrint Archive Paper 2022\/089. https:\/\/eprint.iacr.org\/2022\/089 https:\/\/eprint.iacr.org\/2022\/089."},{"key":"e_1_3_2_1_50_1","volume-title":"FDFB: Full Domain Functional Bootstrapping Towards Practical Fully Homomorphic Encryption. Cryptology ePrint Archive, Report 2021\/1135. https:\/\/eprint.iacr.org\/2021\/1135.","author":"Kluczniak Kamil","year":"2021","unstructured":"Kamil Kluczniak and Leonard Schild . 2021 . FDFB: Full Domain Functional Bootstrapping Towards Practical Fully Homomorphic Encryption. Cryptology ePrint Archive, Report 2021\/1135. https:\/\/eprint.iacr.org\/2021\/1135. Kamil Kluczniak and Leonard Schild. 2021. FDFB: Full Domain Functional Bootstrapping Towards Practical Fully Homomorphic Encryption. Cryptology ePrint Archive, Report 2021\/1135. https:\/\/eprint.iacr.org\/2021\/1135."},{"key":"e_1_3_2_1_51_1","volume-title":"Part I (Lecture Notes in Computer Science","volume":"647","author":"Lee Joon-Woo","year":"2021","unstructured":"Joon-Woo Lee , Eunsang Lee , Yongwoo Lee , Young-Sik Kim , and Jong-Seon No . 2021 . High-Precision Bootstrapping of RNS-CKKS Homomorphic Encryption Using Optimal Minimax Polynomial Approximation and Inverse Sine Function. In Advances in Cryptology -- EUROCRYPT 2021 , Part I (Lecture Notes in Computer Science , Vol. 12696), Anne Canteaut and Fran\u00e7ois-Xavier Standaert (Eds.). Springer, Heidelberg, 618-- 647 . https:\/\/doi.org\/10.1007\/978--3-030--77870--5_22 10.1007\/978--3-030--77870--5_22 Joon-Woo Lee, Eunsang Lee, Yongwoo Lee, Young-Sik Kim, and Jong-Seon No. 2021. High-Precision Bootstrapping of RNS-CKKS Homomorphic Encryption Using Optimal Minimax Polynomial Approximation and Inverse Sine Function. In Advances in Cryptology -- EUROCRYPT 2021, Part I (Lecture Notes in Computer Science, Vol. 12696), Anne Canteaut and Fran\u00e7ois-Xavier Standaert (Eds.). Springer, Heidelberg, 618--647. https:\/\/doi.org\/10.1007\/978--3-030--77870--5_22"},{"key":"e_1_3_2_1_52_1","volume-title":"Part I (Lecture Notes in Computer Science","volume":"677","author":"Li Baiyu","year":"2021","unstructured":"Baiyu Li and Daniele Micciancio . 2021 . On the Security of Homomorphic Encryption on Approximate Numbers. In Advances in Cryptology -- EUROCRYPT 2021 , Part I (Lecture Notes in Computer Science , Vol. 12696), Anne Canteaut and Fran\u00e7ois-Xavier Standaert (Eds.). Springer, Heidelberg, 648-- 677 . https: \/\/doi.org\/10.1007\/978--3-030--77870--5_23 10.1007\/978--3-030--77870--5_23 Baiyu Li and Daniele Micciancio. 2021. On the Security of Homomorphic Encryption on Approximate Numbers. In Advances in Cryptology -- EUROCRYPT 2021, Part I (Lecture Notes in Computer Science, Vol. 12696), Anne Canteaut and Fran\u00e7ois-Xavier Standaert (Eds.). Springer, Heidelberg, 648--677. https: \/\/doi.org\/10.1007\/978--3-030--77870--5_23"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977"},{"key":"e_1_3_2_1_55_1","volume-title":"Advances in Cryptology -- EUROCRYPT 2010 (Lecture Notes in Computer Science","author":"Lyubashevsky Vadim","unstructured":"Vadim Lyubashevsky , Chris Peikert , and Oded Regev . 2010. On Ideal Lattices and Learning with Errors over Rings . In Advances in Cryptology -- EUROCRYPT 2010 (Lecture Notes in Computer Science , Vol. 6110), Henri Gilbert (Ed.). Springer, Heidelberg, 1-- 23 . https:\/\/doi.org\/10.1007\/978--3--642--13190--5_1 10.1007\/978--3--642--13190--5_1 Vadim Lyubashevsky, Chris Peikert, and Oded Regev. 2010. On Ideal Lattices and Learning with Errors over Rings. In Advances in Cryptology -- EUROCRYPT 2010 (Lecture Notes in Computer Science, Vol. 6110), Henri Gilbert (Ed.). Springer, Heidelberg, 1--23. https:\/\/doi.org\/10.1007\/978--3--642--13190--5_1"},{"key":"e_1_3_2_1_56_1","volume-title":"Bootstrapping in FHEW-like Cryptosystems","author":"Micciancio Daniele","unstructured":"Daniele Micciancio and Yuriy Polyakov . 2021. Bootstrapping in FHEW-like Cryptosystems . Association for Computing Machinery , New York, NY, USA , 17--28. https:\/\/doi.org\/10.1145\/3474366.3486924 10.1145\/3474366.3486924 Daniele Micciancio and Yuriy Polyakov. 2021. Bootstrapping in FHEW-like Cryptosystems. Association for Computing Machinery, New York, NY, USA, 17--28. https:\/\/doi.org\/10.1145\/3474366.3486924"},{"key":"e_1_3_2_1_57_1","volume-title":"Ring Packing and Amortized FHEW Bootstrapping. In ICALP 2018: 45th International Colloquium on Automata, Languages and Programming (LIPIcs","volume":"14","author":"Micciancio Daniele","year":"2018","unstructured":"Daniele Micciancio and Jessica Sorrell . 2018 . Ring Packing and Amortized FHEW Bootstrapping. In ICALP 2018: 45th International Colloquium on Automata, Languages and Programming (LIPIcs , Vol. 107), Ioannis Chatzigiannakis, Christos Kaklamanis, D\u00e1niel Marx, and Donald Sannella (Eds.). Schloss Dagstuhl, 100:1-- 100: 14 . https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.100 10.4230\/LIPIcs.ICALP.2018.100 Daniele Micciancio and Jessica Sorrell. 2018. Ring Packing and Amortized FHEW Bootstrapping. In ICALP 2018: 45th International Colloquium on Automata, Languages and Programming (LIPIcs, Vol. 107), Ioannis Chatzigiannakis, Christos Kaklamanis, D\u00e1niel Marx, and Donald Sannella (Eds.). Schloss Dagstuhl, 100:1-- 100:14. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.100"},{"key":"e_1_3_2_1_58_1","volume-title":"Dagstuhl Workshop on Cryptography","author":"Patarin Jacques","year":"1997","unstructured":"Jacques Patarin . 1997 . The oil and vinegar signature scheme . In Dagstuhl Workshop on Cryptography September, 1997. Jacques Patarin. 1997. The oil and vinegar signature scheme. In Dagstuhl Workshop on Cryptography September, 1997."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"e_1_3_2_1_60_1","volume-title":"Advances in Cryptology -- EUROCRYPT 2011 (Lecture Notes in Computer Science","author":"Stehl\u00e9 Damien","year":"2046","unstructured":"Damien Stehl\u00e9 and Ron Steinfeld . 2011. Making NTRU as Secure as Worst-Case Problems over Ideal Lattices . In Advances in Cryptology -- EUROCRYPT 2011 (Lecture Notes in Computer Science , Vol. 6632), Kenneth G. Paterson (Ed.). Springer, Heidelberg, 27-- 47 . https:\/\/doi.org\/10.1007\/978--3--642-- 2046 5--4_4 10.1007\/978--3--642--20465--4_4 Damien Stehl\u00e9 and Ron Steinfeld. 2011. Making NTRU as Secure as Worst-Case Problems over Ideal Lattices. In Advances in Cryptology -- EUROCRYPT 2011 (Lecture Notes in Computer Science, Vol. 6632), Kenneth G. Paterson (Ed.). Springer, Heidelberg, 27--47. https:\/\/doi.org\/10.1007\/978--3--642--20465--4_4"},{"key":"e_1_3_2_1_61_1","volume-title":"TOTA: Fully Homomorphic Encryption with Smaller Parameters and Stronger Security. Cryptology ePrint Archive, Report 2021\/1347. https:\/\/eprint.iacr.org\/2021\/1347.","author":"Yang Zhaomin","year":"2021","unstructured":"Zhaomin Yang , Xiang Xie , Huajie Shen , Shiying Chen , and Jun Zhou . 2021 . TOTA: Fully Homomorphic Encryption with Smaller Parameters and Stronger Security. Cryptology ePrint Archive, Report 2021\/1347. https:\/\/eprint.iacr.org\/2021\/1347. Zhaomin Yang, Xiang Xie, Huajie Shen, Shiying Chen, and Jun Zhou. 2021. TOTA: Fully Homomorphic Encryption with Smaller Parameters and Stronger Security. Cryptology ePrint Archive, Report 2021\/1347. https:\/\/eprint.iacr.org\/2021\/1347."}],"event":{"name":"CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security","location":"Los Angeles CA USA","acronym":"CCS '22","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3560700","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3560700","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:05Z","timestamp":1750182665000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3560700"}},"subtitle":["Secure Fully Homomorphic Encryption from NTRU with Small Modulus"],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":58,"alternative-id":["10.1145\/3548606.3560700","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3560700","relation":{},"subject":[],"published":{"date-parts":[[2022,11,7]]},"assertion":[{"value":"2022-11-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}