{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:25:05Z","timestamp":1759332305398,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030896539"},{"type":"electronic","value":"9783030896546"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89654-6_27","type":"book-chapter","created":{"date-parts":[[2021,10,22]],"date-time":"2021-10-22T20:34:24Z","timestamp":1634934864000},"page":"377-390","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hybrid Algorithm for Symmetric Based Fully Homomorphic Encryption"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9258-3810","authenticated-orcid":false,"given":"Kamaldeen Jimoh","family":"Muhammed","sequence":"first","affiliation":[]},{"given":"Rafiu Mope","family":"Isiaka","sequence":"additional","affiliation":[]},{"given":"Ayisat Wuraola","family":"Asaju-Gbolagade","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0155-7949","authenticated-orcid":false,"given":"Kayode Sakariyah","family":"Adewole","sequence":"additional","affiliation":[]},{"given":"Kazeem Alagbe","family":"Gbolagade","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,23]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Song, X., Wang, Y.: Homomorphic cloud computing scheme based on hybrid homomorphic encryption. In: 2017 3rd IEEE International Conference on Computer and Communications (ICCC), pp. 2450\u20132453. IEEE (2017)","DOI":"10.1109\/CompComm.2017.8322975"},{"key":"27_CR2","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-030-12500-4_5","volume-title":"Recent Advances in Computational Intelligence","author":"B Seth","year":"2019","unstructured":"Seth, B., Dalal, S., Kumar, R.: Hybrid homomorphic encryption scheme for secure cloud data storage. In: Kumar, R., Wiil, U.K. (eds.) Recent Advances in Computational Intelligence. SCI, vol. 823, pp. 71\u201392. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12500-4_5"},{"issue":"11","key":"27_CR3","first-page":"169","volume":"4","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. Found. Secur. Computat. 4(11), 169\u2013180 (1978)","journal-title":"Found. Secur. Computat."},{"key":"27_CR4","unstructured":"Gentry, C.: A fully homomorphic encryption scheme (no. 09). Stanford University Stanford (2009)"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Stoc, vol. 9, no. 2009, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S.: Fully homomorphic encryption without squashing using depth-3 arithmetic circuits. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 107\u2013109. IEEE (2011)","DOI":"10.1109\/FOCS.2011.94"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-22792-9_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Z Brakerski","year":"2011","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 505\u2013524. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_29"},{"issue":"2","key":"27_CR8","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/120868669","volume":"43","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. SIAM J. Comput. 43(2), 831\u2013871 (2014)","journal-title":"SIAM J. Comput."},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Chen, Y., Gu, B., Zhang, C., Shu, H.: Reliable fully homomorphic disguising matrix computation outsourcing scheme. In: 2018 14th International Wireless Communications and Mobile Computing Conference (IWCMC), pp. 482\u2013487. IEEE (2018)","DOI":"10.1109\/IWCMC.2018.8450417"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-53887-6_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"I Chillotti","year":"2016","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: Faster fully homomorphic encryption: Bootstrapping in less than 0.1 seconds. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 3\u201333. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_1"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-662-46800-5_24","volume-title":"Advances in Cryptology -- EUROCRYPT 2015","author":"L Ducas","year":"2015","unstructured":"Ducas, L., Micciancio, D.: FHEW: bootstrapping homomorphic encryption in less than a second. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 617\u2013640. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_24"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"C Gentry","year":"2013","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 75\u201392. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5"},{"key":"27_CR13","unstructured":"Hu, Y.: Improving the efficiency of homomorphic encryption schemes (Doctoral dissertation, Worcester Polytechnic Institute) (2013)"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-13190-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"M van Dijk","year":"2010","unstructured":"van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 24\u201343. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_2"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Brakerski, Z.: Fundamentals of fully homomorphic encryption. In: Providing Sound Foundations for Cryptography, pp. 543\u2013563. ACM (2019)","DOI":"10.1145\/3335741.3335762"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Alaya, B., Laouamer, L., Msilini, N.: Homomorphic encryption systems statement: trends and challenges. Comput. Sci. Rev. 36, 100235 (2020)","DOI":"10.1016\/j.cosrev.2020.100235"},{"issue":"5","key":"27_CR17","doi-asserted-by":"publisher","first-page":"1052","DOI":"10.1109\/TIFS.2015.2398359","volume":"10","author":"JH Cheon","year":"2015","unstructured":"Cheon, J.H., Kim, J.: A hybrid scheme of public-key encryption and somewhat homomorphic encryption. IEEE Trans. Inf. Forensics Secur. 10(5), 1052\u20131063 (2015)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Burtyka, P., Makarevich, O.: Symmetric fully homomorphic encryption using decidable matrix equations. In: Proceedings of the 7th International Conference on Security of Information and Networks, p. 186. ACM (2014)","DOI":"10.1145\/2659651.2659693"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Gupta, C., Sharma, I.: A fully homomorphic encryption scheme with symmetric keys with application to private data processing in clouds.: In: 2013 Fourth International Conference on the Network of the Future (NoF), pp. 1\u20134. IEEE (2013)","DOI":"10.1109\/NOF.2013.6724526"},{"key":"27_CR20","first-page":"641","volume":"2015","author":"J Li","year":"2015","unstructured":"Li, J., Wang, L.: Noise-free symmetric fully homomorphic encryption based on noncommutative rings. IACR Cryptol. ePrint Archive 2015, 641 (2015)","journal-title":"IACR Cryptol. ePrint Archive"},{"issue":"12","key":"27_CR21","doi-asserted-by":"publisher","first-page":"3675","DOI":"10.1007\/s11128-013-0626-5","volume":"12","author":"M Liang","year":"2013","unstructured":"Liang, M.: Symmetric quantum fully homomorphic encryption with perfect security. Quantum Inf. Process. 12(12), 3675\u20133687 (2013). https:\/\/doi.org\/10.1007\/s11128-013-0626-5","journal-title":"Quantum Inf. Process."},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Umadevi, C., Gopalan, N.: Outsourcing private cloud using symmetric fully homomorphic encryption using Qnp matrices with enhanced access control. In: 2018 International Conference on Inventive Research in Computing Applications (ICIRCA), pp. 328\u2013332. IEEE (2018)","DOI":"10.1109\/ICIRCA.2018.8597241"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Qu, Q., Wang, B., Ping, Y., Zhang, Z.: Improved cryptanalysis of a fully homomorphic symmetric encryption scheme. Secur. Commun. Netw. 2019, 1\u20136 (2019)","DOI":"10.1155\/2019\/8319508"},{"issue":"2","key":"27_CR24","doi-asserted-by":"publisher","first-page":"40","DOI":"10.24017\/science.2019.2.12","volume":"4","author":"MA Mohammed","year":"2019","unstructured":"Mohammed, M.A., Abed, F.S.: An improved fully homomorphic encryption model based on N-primes. Kurdistan J. Appl. Res. 4(2), 40\u201349 (2019)","journal-title":"Kurdistan J. Appl. Res."},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"Vaudenay, D.V.S.: Cryptanalysis of enhanced MORE. Tatra Mt. Math. Publ. 73, 163\u2013178 (2019)","DOI":"10.2478\/tmmp-2019-0012"},{"key":"27_CR26","first-page":"233","volume":"34","author":"K Hariss","year":"2017","unstructured":"Hariss, K., Noura, H., Samhat, A.E.: Fully enhanced homomorphic encryption algorithm of MORE approach for real world applications. J. Inf. Secur. Appl. 34, 233\u2013242 (2017)","journal-title":"J. Inf. Secur. Appl."},{"key":"27_CR27","doi-asserted-by":"crossref","unstructured":"Hariss, K., Noura, H., Samhat, A.E., Chamoun, M.: An efficient solution towards secure homomorphic symmetric encryption algorithms. In: ITM Web of Conferences, vol. 27, p. 05002. EDP Sciences (2019)","DOI":"10.1051\/itmconf\/20192705002"},{"key":"27_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-319-76687-4_9","volume-title":"Risks and Security of Internet and Systems","author":"K Hariss","year":"2018","unstructured":"Hariss, K., Noura, H., Samhat, A.E., Chamoun, M.: Design and realization of a fully homomorphic encryption algorithm for cloud applications. In: Cuppens, N., Cuppens, F., Lanet, J.-L., Legay, A., Garcia-Alfaro, J. (eds.) CRiSIS 2017. LNCS, vol. 10694, pp. 127\u2013139. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76687-4_9"},{"key":"27_CR29","first-page":"637","volume":"2012","author":"A Kipnis","year":"2012","unstructured":"Kipnis, A., Hibshoosh, E.: Efficient methods for practical fully homomorphic symmetric-key encrypton, randomization and verification. IACR Cryptol. ePrint Archive 2012, 637 (2012)","journal-title":"IACR Cryptol. ePrint Archive"},{"issue":"2","key":"27_CR30","first-page":"288","volume":"52","author":"D Viz\u00e1r","year":"2015","unstructured":"Viz\u00e1r, D., Vaudenay, S.: Cryptanalysis of chosen symmetric homomorphic schemes. Stud. Sci. Math. Hung. 52(2), 288\u2013306 (2015)","journal-title":"Stud. Sci. Math. Hung."},{"key":"27_CR31","doi-asserted-by":"crossref","unstructured":"Muhammed, K.J., Gbolagade, K.: Enhanced MORE algorithm for fully homomorphic encryption based on secret information moduli set. In: 2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), pp. 469\u2013473. IEEE (2019)","DOI":"10.1109\/IEEM44572.2019.8978501"},{"key":"27_CR32","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-030-66288-2_8","volume-title":"Machine Learning and Data Mining for Emerging Trend in Cyber Dynamics","author":"KJ Muhammed","year":"2021","unstructured":"Muhammed, K.J., Isiaka, R.M., Asaju-Gbolagade, A.W., Adewole, K.S., Gbolagade, K.A.: Improved cloud-based N-primes model for symmetric-based fully homomorphic encryption using residue number system. In: Chiroma, H., Abdulhamid, S.M., Fournier-Viger, P., Garcia, N.M. (eds.) Machine Learning and Data Mining for Emerging Trend in Cyber Dynamics, pp. 197\u2013216. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-66288-2_8"}],"container-title":["Communications in Computer and Information Science","Applied Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89654-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,22]],"date-time":"2021-10-22T21:07:08Z","timestamp":1634936828000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89654-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030896539","9783030896546"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89654-6_27","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"23 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icai22021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icai.itiud.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"89","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}