{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T09:44:33Z","timestamp":1766223873472,"version":"3.48.0"},"reference-count":20,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025,4,14]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The term \u201chomomorphism\u201d was introduced in cryptography by Rivest, Adleman, and Dertouzos in 1978 to address performing calculations on encrypted data without decryption. Since then, researchers have increasingly aimed to design schemes supporting numerous operations. This article aims to synthesize the current state of the art in the so-called somewhat homomorphic encryption.<\/jats:p>","DOI":"10.1515\/jmc-2024-0041","type":"journal-article","created":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T09:00:26Z","timestamp":1744621226000},"source":"Crossref","is-referenced-by-count":0,"title":["Modern techniques in somewhat homomorphic encryption"],"prefix":"10.1515","volume":"19","author":[{"given":"Massimo","family":"Giulietti","sequence":"first","affiliation":[{"name":"Dipartimento di Matematica e Informatica, University of Perugia , Via Vanvitelli , 1 - 06123 Perugia , Italy"}]},{"given":"Paolo","family":"Martinelli","sequence":"additional","affiliation":[{"name":"Dipartimento di Matematica e Informatica, University of Perugia , Via Vanvitelli , 1 - 06123 Perugia , Italy"}]},{"given":"Marco","family":"Timpanella","sequence":"additional","affiliation":[{"name":"Dipartimento di Matematica e Informatica, University of Perugia , Via Vanvitelli , 1 - 06123 Perugia , Italy"}]}],"member":"374","published-online":{"date-parts":[[2025,4,14]]},"reference":[{"key":"2025122009205599130_j_jmc-2024-0041_ref_001","doi-asserted-by":"crossref","unstructured":"Acar A, Aksu H, Uluagac AS, Conti M. A survey on homomorphic encryption schemes: Theory and implementation. ACM Comput Surv. 2018 Jul;51(4):Art. 79. 10.1145\/3214303.","DOI":"10.1145\/3214303"},{"key":"2025122009205599130_j_jmc-2024-0041_ref_002","doi-asserted-by":"crossref","unstructured":"Fellows M, Koblitz N. Combinatorial cryptosystems galore! In: Finite fields: theory, applications, and algorithms (Las Vegas, NV, 1993). vol. 168 of Contemporary Mathematics. American Mathematical Society, Providence, RI, 1994. p. 51\u201361. 10.1090\/conm\/168\/01688.","DOI":"10.1090\/conm\/168\/01688"},{"key":"2025122009205599130_j_jmc-2024-0041_ref_003","doi-asserted-by":"crossref","unstructured":"Levy-dit Vehel F, Perret L. A Polly Cracker system based on satisfiability. In: Coding, cryptography and combinatorics. vol. 23 of Progr. Comput. Sci. Appl. Logic. Birkh\u00e4user, Basel; 2004. p. 177\u201392.","DOI":"10.1007\/978-3-0348-7865-4_11"},{"key":"2025122009205599130_j_jmc-2024-0041_ref_004","doi-asserted-by":"crossref","unstructured":"Ly LV. Polly two: a new algebraic polynomial-based public-key scheme. Appl Algebra Engrg Comm Comput. 2006;17(3\u20134):267\u201383. 10.1007\/s00200-006-0010-0.","DOI":"10.1007\/s00200-006-0010-0"},{"key":"2025122009205599130_j_jmc-2024-0041_ref_005","doi-asserted-by":"crossref","unstructured":"Sander T, Young A, Yung M. Non-interactive cryptocomputing for NC1. In: 40th Annual Symposium on Foundations of Computer Science (New York, 1999). IEEE Computer Soc., Los Alamitos, CA; 1999. p. 554\u201366. 10.1109\/SFFCS.1999.814630.","DOI":"10.1109\/SFFCS.1999.814630"},{"key":"2025122009205599130_j_jmc-2024-0041_ref_006","doi-asserted-by":"crossref","unstructured":"Ishai Y, Paskin A. Evaluating branching programs on encrypted data. In: Theory of cryptography. vol. 4392 of Lecture Notes in Comput. Sci., Berlin: Springer; 2007. p. 575\u201394. 10.1007\/978-3-540-70936-7_31.","DOI":"10.1007\/978-3-540-70936-7_31"},{"key":"2025122009205599130_j_jmc-2024-0041_ref_007","doi-asserted-by":"crossref","unstructured":"Aguilar Melchor C, Gaborit P, Herranz J. Additively homomorphic encryption with d-operand multiplications. In: Advances in cryptology-CRYPTO 2010. vol. 6223 of Lecture Notes in Comput. Sci. Berlin: Springer; 2010. p. 138\u201354. 10.1007\/978-3-642-14623-7_8.","DOI":"10.1007\/978-3-642-14623-7_8"},{"key":"2025122009205599130_j_jmc-2024-0041_ref_008","doi-asserted-by":"crossref","unstructured":"Boneh D, Goh EJ, Nissim K. Evaluating 2-DNF formulas on ciphertexts. In: Theory of cryptography. vol. 3378 of Lecture Notes in Comput. Sci. Berlin: Springer; 2005. p. 325\u201341. 10.1007\/978-3-540-30576-7_18.","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"2025122009205599130_j_jmc-2024-0041_ref_009","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Vaikuntanathan V. Efficient fully homomorphic encryption from (standard) LWE. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science; 2011. p. 97\u2013106.","DOI":"10.1109\/FOCS.2011.12"},{"key":"2025122009205599130_j_jmc-2024-0041_ref_010","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V, Peikert C, Regev O. On ideal lattices and learning with errors over rings. J ACM. 2013;60(6):Art. 43, 35. 10.1145\/2535925.","DOI":"10.1145\/2535925"},{"key":"2025122009205599130_j_jmc-2024-0041_ref_011","unstructured":"Fan J, Vercauteren F. Somewhat practical fully homomorphic encryption. 2012. https:\/\/eprint.iacr.org\/2012\/144."},{"key":"2025122009205599130_j_jmc-2024-0041_ref_012","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Gentry C, Vaikuntanathan V. (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans Comput Theory. 2014;6(3):Art. 13, 36. 10.1145\/2633600.","DOI":"10.1145\/2633600"},{"key":"2025122009205599130_j_jmc-2024-0041_ref_013","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: STOC\u201912-Proceedings of the 2012 ACM Symposium on Theory of Computing. New York: ACM; 2012. p. 1219\u201334. 10.1145\/2213977.2214086.","DOI":"10.1145\/2213977.2214086"},{"key":"2025122009205599130_j_jmc-2024-0041_ref_014","unstructured":"Cheon JH, Kim A, Kim M, Song Y. Homomorphic encryption for arithmetic of approximate numbers; 2016. https:\/\/eprint.iacr.org\/2016\/421. Cryptology ePrint Archive, Paper 2016\/421. https:\/\/eprint.iacr.org\/2016\/421."},{"key":"2025122009205599130_j_jmc-2024-0041_ref_015","unstructured":"Li B, Micciancio D. On the security of homomorphic encryption on approximate numbers; 2020. https:\/\/eprint.iacr.org\/2020\/1533. Cryptology ePrint Archive, Paper 2020\/1533."},{"key":"2025122009205599130_j_jmc-2024-0041_ref_016","doi-asserted-by":"crossref","unstructured":"Hoffstein J, Pipher J, Silverman JH. NTRU: A ring-based public key cryptosystem. In: Buhler JP, editor. Algorithmic number theory. Berlin, Heidelberg: Springer Berlin Heidelberg; 1998. p. 267\u201388.","DOI":"10.1007\/BFb0054868"},{"key":"2025122009205599130_j_jmc-2024-0041_ref_017","unstructured":"Stehl D, Steinfeld R. Making NTRUEncrypt and NTRUSign as secure as standard worst-case problems over ideal lattices; 2013. https:\/\/eprint.iacr.org\/2013\/004. Cryptology ePrint Archive, Paper 2013\/004."},{"key":"2025122009205599130_j_jmc-2024-0041_ref_018","doi-asserted-by":"crossref","unstructured":"Albrecht M, Bai S, Ducas L. A subfield lattice attack on overstretched NTRU assumptions: Cryptanalysis of some FHE and graded encoding schemes; 2016. https:\/\/eprint.iacr.org\/2016\/127. Cryptology ePrint Archive, Paper 2016\/127.","DOI":"10.1007\/978-3-662-53018-4_6"},{"key":"2025122009205599130_j_jmc-2024-0041_ref_019","doi-asserted-by":"crossref","unstructured":"Kluczniak K. NTRU-\u03bd-um: Secure fully homomorphic encryption from NTRU with small modulus; 2022. https:\/\/eprint.iacr.org\/2022\/089. Cryptology ePrint Archive, Paper 2022\/089.","DOI":"10.1145\/3548606.3560700"},{"key":"2025122009205599130_j_jmc-2024-0041_ref_020","unstructured":"van Dijk M, Gentry C, Halevi S, Vaikuntanathan V. Fully homomorphic encryption over the integers; 2009. https:\/\/eprint.iacr.org\/2009\/616. Cryptology ePrint Archive, Paper 2009\/616."}],"container-title":["Journal of Mathematical Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2024-0041\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2024-0041\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T09:40:11Z","timestamp":1766223611000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2024-0041\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,1]]},"references-count":20,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,4,14]]},"published-print":{"date-parts":[[2025,4,14]]}},"alternative-id":["10.1515\/jmc-2024-0041"],"URL":"https:\/\/doi.org\/10.1515\/jmc-2024-0041","relation":{},"ISSN":["1862-2984"],"issn-type":[{"type":"electronic","value":"1862-2984"}],"subject":[],"published":{"date-parts":[[2025,1,1]]},"article-number":"20240041"}}