{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:17:34Z","timestamp":1761621454910,"version":"3.40.5"},"reference-count":34,"publisher":"IGI Global","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"abstract":"<jats:p>Fully homomorphic encryption schemes (FHE) are a type of encryption algorithm dedicated to data security in cloud computing. It allows for performing computations over ciphertext. In addition to this characteristic, a verifiable FHE scheme has the capacity to allow an end user to verify the correctness of the computations done by a cloud server on his encrypted data. Since FHE schemes are known to be greedy in term of processing consumption and slow in terms of runtime execution, it is very useful to look for improvement techniques and tools to improve FHE performance. Parallelizing computations is among the best tools one can use for FHE improvement. Batching is a kind of parallelization of computations when applied to an FHE scheme, it gives it the capacity of encrypting and homomorphically processing a vector of plaintexts as a single ciphertext. This is used in the context of cloud computing to perform a known function on several ciphertexts for multiple clients at the same time. The advantage here is in optimizing resources on the cloud side and improving the quality of services provided by the cloud computing. In this article, the authors will present a detailed survey of different FHE improvement techniques in the literature and apply the batching technique to a promising verifiable FHE (VFHE) recently presented by the authors at the WINCOM17 conference.<\/jats:p>","DOI":"10.4018\/ijertcs.2019070101","type":"journal-article","created":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T15:45:04Z","timestamp":1559835904000},"page":"1-20","source":"Crossref","is-referenced-by-count":1,"title":["About Fully Homomorphic Encryption Improvement Techniques"],"prefix":"10.4018","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9385-7315","authenticated-orcid":true,"given":"Ahmed","family":"El-Yahyaoui","sequence":"first","affiliation":[{"name":"Mohammed V University in Rabat, Morocco"}]},{"given":"Mohamed Daifr Ech-Cherif","family":"El Kettani","sequence":"additional","affiliation":[{"name":"Mohammed V University, Rabat, Morocco"}]}],"member":"2432","reference":[{"key":"IJERTCS.2019070101-0","unstructured":"Armknecht, F., Boyd, C., Carr, C., Gj\u00f8steen, K., J\u00a8aschke, A., Reuter, C., & Strand, M. (2015). A Guide to Fully Homomorphic Encryption."},{"key":"IJERTCS.2019070101-1","first-page":"483","article-title":"Multiparty computation with low communication, computation and interaction via threshold FHE.","author":"G.Asharov","year":"2012","journal-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques"},{"key":"IJERTCS.2019070101-2","doi-asserted-by":"crossref","unstructured":"Bourse, F., Minelli, M., Minihold, M., & Paillier, P. (2017). Fast Homomorphic Evaluation of Deep Discretized Neural Networks.","DOI":"10.1007\/978-3-319-96878-0_17"},{"key":"IJERTCS.2019070101-3","doi-asserted-by":"crossref","unstructured":"Brakerski, Z. (2012). Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP.","DOI":"10.1007\/978-3-642-32009-5_50"},{"issue":"3","key":"IJERTCS.2019070101-4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/2633600","article-title":"(Leveled) fully homomorphic encryption without bootstrapping.","volume":"6","author":"Z.Brakerski","year":"2014","journal-title":"ACM Transactions on Computation Theory"},{"key":"IJERTCS.2019070101-5","doi-asserted-by":"publisher","DOI":"10.15514\/ISPRAS-2014-26(5)-5"},{"key":"IJERTCS.2019070101-6","doi-asserted-by":"crossref","unstructured":"Carpov, S., & Sirdey, R. (2015). A compression method for homomorphic ciphertexts.","DOI":"10.1145\/2898445.2898452"},{"key":"IJERTCS.2019070101-7","doi-asserted-by":"publisher","DOI":"10.1049\/cje.2015.07.038"},{"key":"IJERTCS.2019070101-8","doi-asserted-by":"crossref","unstructured":"Coron, J., Lepoint, T., & Tibouchi, M. (2012). Batch fully homomorphic encryption over the integers.","DOI":"10.1007\/978-3-642-22792-9_28"},{"key":"IJERTCS.2019070101-9","doi-asserted-by":"crossref","unstructured":"Coron, J., Mandal, A., Naccache, D., & Tibouch, M. (2011). Fully Homomorphic Encryption over the Integers with Shorter Public Keys.","DOI":"10.1007\/978-3-642-22792-9_28"},{"journal-title":"The Theory and Implementation of an Electronic Voting System","year":"2002","author":"I.Damg\u00e5rd","key":"IJERTCS.2019070101-10"},{"key":"IJERTCS.2019070101-11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"IJERTCS.2019070101-12","doi-asserted-by":"crossref","unstructured":"El-yahyaoui, A., & Ech-cherif EL kettani, M. (2018). Batch Verifiable Fully Homomorphic Encryption Scheme to Optimize Computations over Encrypted Cloud Data. In The 1st International Conference on Networking, Information Systems & Security (NISS18), Tangier, Morocco: Springer.","DOI":"10.3390\/technologies7010021"},{"key":"IJERTCS.2019070101-13","first-page":"1","article-title":"A verifiable fully homomorphic encryption scheme to secure big data in cloud computing.","author":"A.El-Yahyaoui","year":"2017","journal-title":"2017 International Conference on Wireless Networks and Mobile Communications (WINCOM)"},{"key":"IJERTCS.2019070101-14","first-page":"10","article-title":"Fully homomorphic encryption: Searching over encrypted cloud data.","author":"A.El-Yahyaoui","year":"2017","journal-title":"Proceedings of the 2nd international Conference on Big Data, Cloud and Applications"},{"key":"IJERTCS.2019070101-15","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1145\/2660267.2660366","article-title":"Efficiently verifiable computation on encrypted data.","author":"D.Fiore","year":"2014","journal-title":"Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security"},{"key":"IJERTCS.2019070101-16","doi-asserted-by":"crossref","unstructured":"Gao, S. (2018). Efficient Fully Homomorphic Encryption Scheme.","DOI":"10.1155\/2018\/8706940"},{"key":"IJERTCS.2019070101-17","first-page":"465","article-title":"Non-interactive verifiable computing: Outsourcing computation to untrusted workers.","author":"R.Gennaro","year":"2010","journal-title":"Annual Cryptology Conference"},{"journal-title":"A fully homomorphic encryption scheme","year":"2009","author":"C.Gentry","key":"IJERTCS.2019070101-18"},{"key":"IJERTCS.2019070101-19","doi-asserted-by":"crossref","unstructured":"Gentry, C., & Halevi, S. (2011, October). Fully homomorphic encryption without squashing using depth-3 arithmetic circuits. In 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (pp. 107-109). IEEE.","DOI":"10.1109\/FOCS.2011.94"},{"key":"IJERTCS.2019070101-20","first-page":"465","article-title":"Fully homomorphic encryption with polylog overhead.","author":"C.Gentry","year":"2012","journal-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques"},{"key":"IJERTCS.2019070101-21","first-page":"75","article-title":"Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based.","author":"C.Gentry","year":"2013","journal-title":"Annual Cryptology Conference"},{"key":"IJERTCS.2019070101-22","doi-asserted-by":"crossref","unstructured":"Gordon, A. (2016). The Official (ISC)2 Guide to the CCSPSM CBK.","DOI":"10.1201\/b18257"},{"key":"IJERTCS.2019070101-23","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214086"},{"key":"IJERTCS.2019070101-24","unstructured":"Mishra, P. K., Rathee, D., Duong, D. H., & Yasuda, M. Fast Secure Matrix Multiplications over Ring-Based Homomorphic Encryption."},{"key":"IJERTCS.2019070101-25","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/2046660.2046682","article-title":"Can homomorphic encryption be practical?","author":"M.Naehrig","year":"2011","journal-title":"Proceedings of the 3rd ACM workshop on Cloud computing security workshop"},{"key":"IJERTCS.2019070101-26","first-page":"537","article-title":"Batch) fully homomorphic encryption over integers for non-binary message spaces.","author":"K.Nuida","year":"2015","journal-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques"},{"key":"IJERTCS.2019070101-27","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"IJERTCS.2019070101-28","unstructured":"Rivest, R. L., Adleman, L., & Dertouzos, M. L. (1978). On data banks and privacy homomorphisms. Foundations of secure computation, 4(11), 169-180."},{"key":"IJERTCS.2019070101-29","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9720-4"},{"key":"IJERTCS.2019070101-30","first-page":"420","article-title":"Fully homomorphic encryption with relatively small key and ciphertext sizes.","author":"N. P.Smart","year":"2010","journal-title":"International Workshop on Public Key Cryptography"},{"issue":"7","key":"IJERTCS.2019070101-31","doi-asserted-by":"crossref","DOI":"10.53829\/ntr201407fa5","article-title":"Fully Homomorphic Encryption over the Integers: From Theory to Practice.","volume":"12","author":"M.Tibouchi","year":"2014","journal-title":"NTT Technical Review"},{"key":"IJERTCS.2019070101-32","first-page":"24","article-title":"Fully homomorphic encryption over the integers.","author":"M.Van Dijk","year":"2010","journal-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques"},{"journal-title":"Efficient Fully Homomorphic Encryption from (Standard)","year":"2011","author":"V.Vikuntanathan","key":"IJERTCS.2019070101-33"}],"container-title":["International Journal of Embedded and Real-Time Communication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=231457","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,19]],"date-time":"2024-07-19T07:27:31Z","timestamp":1721374051000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJERTCS.2019070101"}},"subtitle":["NISS2018 Conference Paper"],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":34,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.4018\/ijertcs.2019070101","relation":{},"ISSN":["1947-3176","1947-3184"],"issn-type":[{"type":"print","value":"1947-3176"},{"type":"electronic","value":"1947-3184"}],"subject":[],"published":{"date-parts":[[2019,7]]}}}