{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:54:50Z","timestamp":1773327290099,"version":"3.50.1"},"reference-count":27,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,6,14]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>We propose a new FHE scheme F-NTRU that adopts the flattening technique proposed in GSW to derive an NTRU based scheme that (similar to GSW) does not require evaluation keys or key switching. Our scheme eliminates the decision small polynomial ratio assumption but relies only on the standard R-LWE assumption. It uses wide key distributions, and hence is immune to Subfield Lattice Attack. In practice, our scheme achieves competitive timings compared to the existing schemes. We are able to compute a homomorphic multiplication in 24.4 msec and 76.0 msec for 5 and 30 levels, respectively, without amortization. Furthermore, our scheme features small ciphertexts, e.g. 2376 KB for 30 levels. The assurance gained by using wide key distributions along with the message space flexibility of the scheme, i.e. bits, binary polynomials, and integers with a large message space, allows the use of the proposed scheme in a wide array of applications.<\/jats:p>","DOI":"10.1515\/jmc-2015-0052","type":"journal-article","created":{"date-parts":[[2020,6,15]],"date-time":"2020-06-15T13:48:20Z","timestamp":1592228900000},"page":"66-83","source":"Crossref","is-referenced-by-count":10,"title":["Flattening NTRU for Evaluation Key Free Homomorphic Encryption"],"prefix":"10.1515","volume":"14","author":[{"given":"Yark\u0131n","family":"Dor\u00f6z","sequence":"first","affiliation":[{"name":"Worcester Polytechnic Institute , Worcester, MA , United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Berk","family":"Sunar","sequence":"additional","affiliation":[{"name":"Worcester Polytechnic Institute , Worcester, MA , United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2020,6,14]]},"reference":[{"key":"2025120600161800512_j_jmc-2015-0052_ref_001_w2aab3b7e1785b1b6b1ab2b1b1Aa","unstructured":"Martin Albrecht, lwe-estimator, https:\/\/bitbucket.org\/malb\/lwe-estimator."},{"key":"2025120600161800512_j_jmc-2015-0052_ref_002_w2aab3b7e1785b1b6b1ab2b1b2Aa","doi-asserted-by":"crossref","unstructured":"Joppe W. Bos, Kristin Lauter, Jake Loftus and Michael Naehrig, Cryptography and Coding: 14th IMA International Conference, IMACC 2013, Oxford, UK, December 17-19, 2013. Proceedings, ch. Improved Security for a ing-Based Fully Homomorphic Encryption Scheme, pp. 45\u201364, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013.","DOI":"10.1007\/978-3-642-45239-0_4"},{"key":"2025120600161800512_j_jmc-2015-0052_ref_003_w2aab3b7e1785b1b6b1ab2b1b3Aa","doi-asserted-by":"crossref","unstructured":"Zvika Brakerski, Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP, pp. 868\u2013886, Springer Berlin Heidelberg, Berlin, Heidelberg, 2012.","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"2025120600161800512_j_jmc-2015-0052_ref_004_w2aab3b7e1785b1b6b1ab2b1b4Aa","unstructured":"Zvika Brakerski, Craig Gentry and Vinod Vaikuntanathan, Fully Homomorphic Encryption without Bootstrapping, Electronic Colloquium on Computational Complexity (ECCC)18 (2011), 111."},{"key":"2025120600161800512_j_jmc-2015-0052_ref_005_w2aab3b7e1785b1b6b1ab2b1b5Aa","doi-asserted-by":"crossref","unstructured":"Zvika Brakerski and Vinod Vaikuntanathan, Efficient Fully Homomorphic Encryption from (Standard) LWE, in: FOCS, pp. 97\u2013106, 2011.","DOI":"10.1109\/FOCS.2011.12"},{"key":"2025120600161800512_j_jmc-2015-0052_ref_006_w2aab3b7e1785b1b6b1ab2b1b6Aa","doi-asserted-by":"crossref","unstructured":"Yuanmi Chen and Phong Q. Nguyen, BKZ 2.0: Better Lattice Security Estimates, in: ASIACRYPT, pp. 1\u201320, 2011.","DOI":"10.1007\/978-3-642-25385-0_1"},{"key":"2025120600161800512_j_jmc-2015-0052_ref_007_w2aab3b7e1785b1b6b1ab2b1b7Aa","doi-asserted-by":"crossref","unstructured":"Jean-S\u00e9bastien Coron, Avradip Mandal, David Naccache and Mehdi Tibouchi, Fully Homomorphic Encryption over the Integers with Shorter Public Keys, in: CRYPTO, pp. 487\u2013504, 2011.","DOI":"10.1007\/978-3-642-22792-9_28"},{"key":"2025120600161800512_j_jmc-2015-0052_ref_008_w2aab3b7e1785b1b6b1ab2b1b8Aa","doi-asserted-by":"crossref","unstructured":"Jean-S\u00e9bastien Coron, David Naccache and Mehdi Tibouchi, Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers, in: EUROCRYPT, pp. 446\u2013464, 2012.","DOI":"10.1007\/978-3-642-29011-4_27"},{"key":"2025120600161800512_j_jmc-2015-0052_ref_009_w2aab3b7e1785b1b6b1ab2b1b9Aa","doi-asserted-by":"crossref","unstructured":"Yark\u0131n Dor\u00f6z, Yin Hu and Berk Sunar, Homomorphic AES evaluation using the modified LTV scheme, Designs, Codes and Cryptography (2015), 1\u201326.","DOI":"10.1007\/s10623-015-0095-1"},{"key":"2025120600161800512_j_jmc-2015-0052_ref_010_w2aab3b7e1785b1b6b1ab2b1c10Aa","unstructured":"Junfeng Fan and Frederik Vercauteren, Somewhat Practical Fully Homomorphic Encryption, IACR Cryptology ePrint Archive2012 (2012), 144."},{"key":"2025120600161800512_j_jmc-2015-0052_ref_011_w2aab3b7e1785b1b6b1ab2b1c11Aa","doi-asserted-by":"crossref","unstructured":"C. Gentry, A Fully Homomorphic Encryption Scheme, Ph.D. thesis, Stanford University, 2009.","DOI":"10.1145\/1536414.1536440"},{"key":"2025120600161800512_j_jmc-2015-0052_ref_012_w2aab3b7e1785b1b6b1ab2b1c12Aa","doi-asserted-by":"crossref","unstructured":"Craig Gentry and Shai Halevi, Implementing Gentry\u2019s Fully-Homomorphic Encryption Scheme, in: EUROCRYPT, pp. 129\u2013148, 2011.","DOI":"10.1007\/978-3-642-20465-4_9"},{"key":"2025120600161800512_j_jmc-2015-0052_ref_013_w2aab3b7e1785b1b6b1ab2b1c13Aa","doi-asserted-by":"crossref","unstructured":"Craig Gentry, Shai Halevi and Nigel P. Smart, Better Bootstrapping in Fully Homomorphic Encryption, pp. 1\u201316, Springer Berlin Heidelberg, Berlin, Heidelberg, 2012.","DOI":"10.1007\/978-3-642-30057-8_1"},{"key":"2025120600161800512_j_jmc-2015-0052_ref_014_w2aab3b7e1785b1b6b1ab2b1c14Aa","doi-asserted-by":"crossref","unstructured":"Craig Gentry, Shai Halevi and Nigel P. Smart, Fully Homomorphic Encryption with Polylog Overhead, pp. 465\u2013482, Springer Berlin Heidelberg, Berlin, Heidelberg, 2012.","DOI":"10.1007\/978-3-642-29011-4_28"},{"key":"2025120600161800512_j_jmc-2015-0052_ref_015_w2aab3b7e1785b1b6b1ab2b1c15Aa","doi-asserted-by":"crossref","unstructured":"Craig Gentry, Amit Sahai and Brent Waters, Advances in Cryptology \u2013 CRYPTO 2013: 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part I, ch. Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based, pp. 75\u201392, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013.","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"2025120600161800512_j_jmc-2015-0052_ref_016_w2aab3b7e1785b1b6b1ab2b1c16Aa","doi-asserted-by":"crossref","unstructured":"Jeffrey Hoffstein, Jill Pipher and Joseph H. Silverman, Algorithmic Number Theory: Third International Symposiun, ANTS-III Portland, Oregon, USA, June 21\u201325, 1998 Proceedings, ch. NTRU: A ring-based public key cryptosystem, pp. 267\u2013288, Springer Berlin Heidelberg, Berlin, Heidelberg, 1998.","DOI":"10.1007\/BFb0054868"},{"key":"2025120600161800512_j_jmc-2015-0052_ref_017_w2aab3b7e1785b1b6b1ab2b1c17Aa","doi-asserted-by":"crossref","unstructured":"Paul Kirchner and Pierre-Alain Fouque, Revisiting Lattice Attacks on Overstretched NTRU Parameters, pp. 3\u201326, Springer International Publishing, Cham, 2017.","DOI":"10.1007\/978-3-319-56620-7_1"},{"key":"2025120600161800512_j_jmc-2015-0052_ref_018_w2aab3b7e1785b1b6b1ab2b1c18Aa","doi-asserted-by":"crossref","unstructured":"Kristin Lauter, Adriana L\u00f3pez-Alt and Michael Naehrig, Progress in Cryptology - LATINCRYPT 2014: Third International Conference on Cryptology and Information Security in Latin America Florian\u00f3polis, Brazil, September 17\u201319, 2014 Revised Selected Papers, ch. Private Computation on Encrypted Genomic Data, pp. 3\u201327, Springer International Publishing, Cham, 2015.","DOI":"10.1007\/978-3-319-16295-9_1"},{"key":"2025120600161800512_j_jmc-2015-0052_ref_019_w2aab3b7e1785b1b6b1ab2b1c19Aa","doi-asserted-by":"crossref","unstructured":"Tancr\u00e9de Lepoint and Michael Naehrig, A Comparison of the Homomorphic Encryption Schemes FV and YASHE, pp. 318\u2013335, Springer International Publishing, Cham, 2014.","DOI":"10.1007\/978-3-319-06734-6_20"},{"key":"2025120600161800512_j_jmc-2015-0052_ref_020_w2aab3b7e1785b1b6b1ab2b1c20Aa","doi-asserted-by":"crossref","unstructured":"Adriana L\u00f3pez-Alt, Eran Tromer and Vinod Vaikuntanathan, On-the-fly Multiparty Computation on the Cloud via Multikey Fully Homomorphic Encryption, in: Proceedings of the Forty-fourth Annual ACM Symposium on Theory of Computing, STOC \u201812, pp. 1219\u20131234, ACM, New York, NY, USA, 2012.","DOI":"10.1145\/2213977.2214086"},{"key":"2025120600161800512_j_jmc-2015-0052_ref_021_w2aab3b7e1785b1b6b1ab2b1c21Aa","doi-asserted-by":"crossref","unstructured":"Vadim Lyubashevsky, Chris Peikert and Oded Regev, On Ideal Lattices and Learning with Errors over Rings, pp. 1\u201323, Springer Berlin Heidelberg, Berlin, Heidelberg, 2010.","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"2025120600161800512_j_jmc-2015-0052_ref_022_w2aab3b7e1785b1b6b1ab2b1c22Aa","doi-asserted-by":"crossref","unstructured":"L\u00e9o Ducas Martin Albrecht, Shi Bai, A subfield lattice attack on overstretched NTRU assumptions: Cryptanalysis of some FHE and Graded Encoding Schemes, Cryptology ePrint Archive, Report 2016\/127, 2016, http:\/\/eprint.iacr.org\/.","DOI":"10.1007\/978-3-662-53018-4_6"},{"key":"2025120600161800512_j_jmc-2015-0052_ref_023_w2aab3b7e1785b1b6b1ab2b1c23Aa","unstructured":"R. L. Rivest, L. Adleman and M. L. Dertouzos, On Data Banks and Privacy Homomorphisms, Foundations of Secure Computation (1978), 169\u2013180."},{"key":"2025120600161800512_j_jmc-2015-0052_ref_024_w2aab3b7e1785b1b6b1ab2b1c24Aa","unstructured":"Victor Shoup, NTL: A Library for doing Number Theory."},{"key":"2025120600161800512_j_jmc-2015-0052_ref_025_w2aab3b7e1785b1b6b1ab2b1c25Aa","doi-asserted-by":"crossref","unstructured":"D. Stehl\u00e9 and R. Steinfeld, Making NTRU as secure as worst-case problems over ideal lattices, Advances in Cryptology \u2013 EUROCRYPT \u201911 (2011), 27\u20134.","DOI":"10.1007\/978-3-642-20465-4_4"},{"key":"2025120600161800512_j_jmc-2015-0052_ref_026_w2aab3b7e1785b1b6b1ab2b1c26Aa","doi-asserted-by":"crossref","unstructured":"Joop van de Pol and Nigel P. Smart, Estimating Key Sizes for High Dimensional Lattice-Based Systems, pp. 290\u2013303, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013.","DOI":"10.1007\/978-3-642-45239-0_17"},{"key":"2025120600161800512_j_jmc-2015-0052_ref_027_w2aab3b7e1785b1b6b1ab2b1c27Aa","doi-asserted-by":"crossref","unstructured":"Marten van Dijk, Craig Gentry, Shai Halevi and Vinod Vaikuntanathan, Fully Homomorphic Encryption over the Integers, in: EUROCRYPT, pp. 24\u201343, 2010.","DOI":"10.1007\/978-3-642-13190-5_2"}],"container-title":["Journal of Mathematical Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/jmc\/14\/1\/article-p66.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2015-0052\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2015-0052\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:16:31Z","timestamp":1764980191000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2015-0052\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,1]]},"references-count":27,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,6,14]]},"published-print":{"date-parts":[[2020,6,14]]}},"alternative-id":["10.1515\/jmc-2015-0052"],"URL":"https:\/\/doi.org\/10.1515\/jmc-2015-0052","relation":{},"ISSN":["1862-2984","1862-2976"],"issn-type":[{"value":"1862-2984","type":"electronic"},{"value":"1862-2976","type":"print"}],"subject":[],"published":{"date-parts":[[2020,1,1]]}}}