{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T13:42:45Z","timestamp":1772458965951,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,5,28]],"date-time":"2015-05-28T00:00:00Z","timestamp":1432771200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10623-015-0095-1","type":"journal-article","created":{"date-parts":[[2015,5,27]],"date-time":"2015-05-27T03:37:24Z","timestamp":1432697844000},"page":"333-358","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":45,"title":["Homomorphic AES evaluation using the modified LTV scheme"],"prefix":"10.1007","volume":"80","author":[{"given":"Yark\u0131n","family":"Dor\u00f6z","sequence":"first","affiliation":[]},{"given":"Yin","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Berk","family":"Sunar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,28]]},"reference":[{"key":"95_CR1","doi-asserted-by":"crossref","unstructured":"Gentry C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, Ser. STOC \u201909, pp. 169\u2013178. ACM, New York (2009).","DOI":"10.1145\/1536414.1536440"},{"key":"95_CR2","unstructured":"Rivest R., Adleman L., Dertouzos M.: On Data Banks and Privacy Homomorphisms, pp. 169\u2013177. Academic Press, New York (1978)."},{"key":"95_CR3","doi-asserted-by":"crossref","unstructured":"Gentry C., Halevi S.: Implementing gentrys fully-homomorphic encryption scheme. In: Paterson K. (ed.) Advances in Cryptology (EUROCRYPT 2011). Lecture Notes in Computer Science, vol. 6632, pp. 129\u2013148. Springer, Berlin (2011).","DOI":"10.1007\/978-3-642-20465-4_9"},{"key":"95_CR4","doi-asserted-by":"crossref","unstructured":"Wang W., Hu Y., Chen L., Huang X., Sunar B.: Accelerating fully homomorphic encryption using GPU. In: High Performance Extreme Computing (HPEC), Sept 2012, pp. 1\u20135 (2012).","DOI":"10.1109\/HPEC.2012.6408660"},{"key":"95_CR5","doi-asserted-by":"crossref","unstructured":"Brakerski Z., Gentry C., Vaikuntanathan V.: (leveled) fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (ITCS \u201912), pp. 309\u2013325. ACM, New York (2012).","DOI":"10.1145\/2090236.2090262"},{"key":"95_CR6","doi-asserted-by":"publisher","unstructured":"Gentry C., Halevi S., Smart N.: Homomorphic evaluation of the AES circuit. In: Safavi-Naini R., Canetti R. (eds.) Advances in Cryptology (CRYPTO 2012). Lecture Notes in Computer Science, vol. 7417, pp. 850\u2013867. Springer, Berlin (2012). doi: 10.1007\/978-3-642-32009-5_49 .","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"95_CR7","doi-asserted-by":"publisher","unstructured":"Gentry C., Halevi S., Smart N.: Fully homomorphic encryption with polylog overhead. In: Pointcheval D., Johansson T. (eds.) Advances in Cryptology (EUROCRYPT 2012). Lecture Notes in Computer Science, vol. 7237, pp. 465\u2013482. Springer, Berlin (2012). doi: 10.1007\/978-3-642-29011-4_28 .","DOI":"10.1007\/978-3-642-29011-4_28"},{"key":"95_CR8","doi-asserted-by":"publisher","unstructured":"Smart N., Vercauteren F.: Fully homomorphic SIMD operations. Des. Codes Cryptogr. 71(1), 57\u201381, (2014). doi: 10.1007\/s10623-012-9720-4 .","DOI":"10.1007\/s10623-012-9720-4"},{"key":"95_CR9","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Alt A., Tromer E., Vaikuntanathan V.: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In: Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC \u201912), pp. 1219\u20131234. ACM, New York (2012).","DOI":"10.1145\/2213977.2214086"},{"key":"95_CR10","doi-asserted-by":"publisher","unstructured":"Hoffstein J., Pipher J., Silverman J.: NTRU: a ring-based public key cryptosystem. In: Buhler J. (ed.) Algorithmic Number Theory. Lecture Notes in Computer Science, vol. 1423, pp. 267\u2013288. Springer, Berlin. doi: 10.1007\/BFb0054868 .","DOI":"10.1007\/BFb0054868"},{"key":"95_CR11","doi-asserted-by":"publisher","unstructured":"Stehl D., Steinfeld R.: Making NTRU as secure as worst-case problems over ideal lattices. In: Paterson K. (ed.) Advances in Cryptology (EUROCRYPT 2011). Lecture Notes in Computer Science, vol. 6632, pp. 27\u201347. Springer, Berlin (2011). doi: 10.1007\/978-3-642-20465-4_4 .","DOI":"10.1007\/978-3-642-20465-4_4"},{"key":"95_CR12","doi-asserted-by":"publisher","unstructured":"Bos J., Lauter K., Loftus J., Naehrig M.: Improved security for a ring-based fully homomorphic encryption scheme. In: Stam M. (ed.) Cryptography and Coding. Lecture Notes in Computer Science, vol. 8308, pp. 45\u201364. Springer, Berlin (2013). doi: 10.1007\/978-3-642-45239-0_4 .","DOI":"10.1007\/978-3-642-45239-0_4"},{"key":"95_CR13","doi-asserted-by":"publisher","unstructured":"Brakerski Z.: Fully homomorphic encryption without modulus switching from classical gapSVP. In: Safavi-Naini R., Canetti R. (eds.) Advances in Cryptology (CRYPTO 2012). Lecture Notes in Computer Science, vol. 7417, pp. 868\u2013886. Springer, Berlin (2012). doi: 10.1007\/978-3-642-32009-5_50 .","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"95_CR14","doi-asserted-by":"publisher","unstructured":"Micciancio D., Regev O.: Worst-case to average-case reductions based on gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007). doi: 10.1137\/S0097539705447360 .","DOI":"10.1137\/S0097539705447360"},{"key":"95_CR15","doi-asserted-by":"publisher","unstructured":"Lyubashevsky V., Peikert C., Regev O.: On ideal lattices and learning with errors over rings. In: Gilbert H. (ed.) Advances in Cryptology (EUROCRYPT 2010). Lecture Notes in Computer Science, vol. 6110, pp. 1\u201323. Springer, Berlin (2010). doi: 10.1007\/978-3-642-13190-5_1 .","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"95_CR16","doi-asserted-by":"publisher","unstructured":"Micciancio D., Regev O.: Lattice-based cryptography. In: Bernstein D., Buchmann J., Dahmen E. (eds.) Post-quantum Cryptography, pp. 147\u2013191. Springer, Berlin (2009). doi: 10.1007\/978-3-540-88702-7_5 .","DOI":"10.1007\/978-3-540-88702-7_5"},{"key":"95_CR17","doi-asserted-by":"publisher","unstructured":"Lindner R., Peikert C.: Better key sizes (and attacks) for LWE-based encryption. In: Kiayias A. (ed.) Topics in Cryptology (CT-RSA 2011). Lecture Notes in Computer Science, vol. 6558, pp. 319\u2013339. Springer, Berlin (2011). doi: 10.1007\/978-3-642-19074-2_21 .","DOI":"10.1007\/978-3-642-19074-2_21"},{"key":"95_CR18","unstructured":"Hoffstein J., Silverman J.H., Whyte W.: Estimated breaking times for NTRU lattices. version 2, NTRU Cryptosystems, Technical Report (2003)."},{"key":"95_CR19","doi-asserted-by":"publisher","unstructured":"Gama N., Nguyen P.: Predicting lattice reduction. In: Smart N. (ed.) Advances in Cryptology (EUROCRYPT 2008). Lecture Notes in Computer Science, vol. 4965, pp. 31\u201351. Springer, Berlin (2008). doi: 10.1007\/978-3-540-78967-3_3 .","DOI":"10.1007\/978-3-540-78967-3_3"},{"key":"95_CR20","doi-asserted-by":"publisher","unstructured":"Coppersmith D., Shamir A.: Lattice attacks on NTRU. In: Fumy W. (ed.) Advances in Cryptology (EUROCRYPT 97). Lecture Notes in Computer Science, vol. 1233, pp. 52\u201361. Springer, Berlin (1997). doi: 10.1007\/3-540-69053-0_5 .","DOI":"10.1007\/3-540-69053-0_5"},{"key":"95_CR21","doi-asserted-by":"publisher","unstructured":"Schnorr C., Euchner M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program., 66(1\u20133), 181\u2013199 (1994). doi: 10.1007\/BF01581144 .","DOI":"10.1007\/BF01581144"},{"key":"95_CR22","unstructured":"Shoup V.: NTL: A Library for Doing Number Theory. http:\/\/www.shoup.net\/ntl"},{"key":"95_CR23","doi-asserted-by":"publisher","unstructured":"van de Pol J., Smart N.: Estimating key sizes for high dimensional lattice-based systems. In: Stam M. (ed.) Cryptography and Coding. Lecture Notes in Computer Science, vol. 8308, pp. 290\u2013303. Springer, Berlin (2013). doi: 10.1007\/978-3-642-45239-0_17 .","DOI":"10.1007\/978-3-642-45239-0_17"},{"key":"95_CR24","doi-asserted-by":"publisher","unstructured":"Chen Y., Nguyen P.: BKZ 2.0: better lattice security estimates. In: Lee D., Wang X. (eds.) Advances in Cryptology (ASIACRYPT 2011). Lecture Notes in Computer Science, vol. 7073, pp. 1\u201320. Springer, Berlin (2011). doi: 10.1007\/978-3-642-25385-0_1 .","DOI":"10.1007\/978-3-642-25385-0_1"},{"key":"95_CR25","doi-asserted-by":"publisher","unstructured":"Lepoint T., Naehrig M.: A comparison of the homomorphic encryption schemes FV and YASHE. In: Pointcheval D., Vergnaud D. (eds.) Progress in Cryptology (AFRICACRYPT 2014). Lecture Notes in Computer Science, vol. 8469, pp. 318\u2013335. Springer, Berlin (2014). doi: 10.1007\/978-3-319-06734-6_20 .","DOI":"10.1007\/978-3-319-06734-6_20"},{"key":"95_CR26","unstructured":"Chen Y., Nguyen P.: BKZ 2.0: Better Lattice Security Estimates. (2013). http:\/\/www.di.ens.fr\/ychen\/research\/Full_BKZ.pdf ."},{"key":"95_CR27","unstructured":"Silverman J.H.: Invertibility in Truncated Polynomial Rings. Technical report, NTRU Cryptosystems (1998)."},{"key":"95_CR28","doi-asserted-by":"crossref","unstructured":"Schnhage A., Strassen V.: Schnelle multiplikation gro\u00dfer zahlen. Computing 7(3\u20134), 281\u2013292 (1971).","DOI":"10.1007\/BF02242355"},{"key":"95_CR29","doi-asserted-by":"publisher","unstructured":"Canright D.: A very compact S-Box for AES. In: Rao J., Sunar B. (eds.) Cryptographic Hardware and Embedded Systems (CHES 2005). Lecture Notes in Computer Science, vol. 3659, pp. 441\u2013455. Springer, Berlin (2005). doi: 10.1007\/11545262_32 .","DOI":"10.1007\/11545262_32"},{"key":"95_CR30","unstructured":"Gentry C., Halevi S., Smart N.: Homomorphic evaluation of the AES circuit (updated implementation). (2015). https:\/\/eprint.iacr.org\/2012\/099.pdf ."},{"key":"95_CR31","doi-asserted-by":"publisher","unstructured":"Mella S., Susella R.: On the homomorphic computation of symmetric cryptographic primitives. In: Stam M. (ed.) Cryptography and Coding. Lecture Notes in Computer Science, vol. 8308, pp. 28\u201344. Springer, Berlin (2013). doi: 10.1007\/978-3-642-45239-0_3 .","DOI":"10.1007\/978-3-642-45239-0_3"},{"key":"95_CR32","unstructured":"Helib: A Software Library that Implements Homomorphic Encryption (HE). https:\/\/github.com\/shaih\/HElib ."},{"key":"95_CR33","unstructured":"Dai W., Dor\u00f6z Y., Sunar B.: Accelerating NTRU based homomorphic encryption using GPUs. IACR Cryptology ePrint Archive, vol. 389 (2014). http:\/\/eprint.iacr.org\/2014\/389 ."},{"key":"95_CR34","unstructured":"\u00d6zt\u00fcrk E., Dor\u00f6z Y., Sunar B., Sava\u015f E.: Accelerating somewhat homomorphic evaluation using FPGAs. Cryptology ePrint Archive, Report 2015\/294 (2015). http:\/\/eprint.iacr.org\/ ."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0095-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-015-0095-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0095-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:40Z","timestamp":1559246320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-015-0095-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,28]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["95"],"URL":"https:\/\/doi.org\/10.1007\/s10623-015-0095-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,28]]}}}