{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T17:03:23Z","timestamp":1771261403776,"version":"3.50.1"},"reference-count":40,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2023,4,28]],"date-time":"2023-04-28T00:00:00Z","timestamp":1682640000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>In today\u2019s hyperconnected world, the Internet of Things and Cloud Computing complement each other in several areas. Cloud Computing provides IoT systems with an efficient and flexible environment that supports application requirements such as real-time control\/monitoring, scalability, fault tolerance, and numerous security services. Hardware and software limitations of IoT devices can be mitigated using the massive on-demand cloud resources. However, IoT cloud-based solutions pose some security and privacy concerns, specifically when an untrusted cloud is used. This calls for strong encryption schemes that allow operations on data in an encrypted format without compromising the encryption. This paper presents an asymmetric multi-key and partially homomorphic encryption scheme. The scheme provides the addition operation by encrypting each decimal digit of the given integer number separately using a special key. In addition, data integrity processes are performed when an untrusted third party performs homomorphic operations on encrypted data. The proposed work considers the most widely known issues like the encrypted data size, slow operations at the hardware level, and high computing costs at the provider level. The size of generated ciphertext is almost equal to the size of the plaintext, and order-preserving is ensured using an asymmetrical encryption version.<\/jats:p>","DOI":"10.3390\/info14050263","type":"journal-article","created":{"date-parts":[[2023,4,28]],"date-time":"2023-04-28T09:54:53Z","timestamp":1682675693000},"page":"263","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["A Multi-Key with Partially Homomorphic Encryption Scheme for Low-End Devices Ensuring Data Integrity"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0285-3181","authenticated-orcid":false,"given":"Saci","family":"Medileh","sequence":"first","affiliation":[{"name":"LIAP Laboratory, University of El Oued, P.O. Box 789, El Oued 39000, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8175-8467","authenticated-orcid":false,"given":"Abdelkader","family":"Laouid","sequence":"additional","affiliation":[{"name":"LIAP Laboratory, University of El Oued, P.O. Box 789, El Oued 39000, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Hammoudeh","sequence":"additional","affiliation":[{"name":"Information and Computer Science Department, King Fahd University of Petroleum and Minerals (KFUPM), Academic Belt Road, Dhahran 31261, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5736-8039","authenticated-orcid":false,"given":"Mostefa","family":"Kara","sequence":"additional","affiliation":[{"name":"LIAP Laboratory, University of El Oued, P.O. Box 789, El Oued 39000, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tarek","family":"Bejaoui","sequence":"additional","affiliation":[{"name":"Computer Engineering Department, University of Carthage, Amilcar 1054, Tunisia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2025-3027","authenticated-orcid":false,"given":"Amna","family":"Eleyan","sequence":"additional","affiliation":[{"name":"Department of Computing and Mathematics, Manchester Metropolitan University, Manchester M1 5GD, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1655-8514","authenticated-orcid":false,"given":"Mohammed","family":"Al-Khalidi","sequence":"additional","affiliation":[{"name":"Department of Computing and Mathematics, Manchester Metropolitan University, Manchester M1 5GD, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,4,28]]},"reference":[{"key":"ref_1","unstructured":"Alsbou\u00ed, T., Hammoudeh, M., Bandar, Z., and Nisbet, A. (2011, January 21\u201327). An overview and classification of approaches to information extraction in wireless sensor networks. Proceedings of the 5th International Conference on Sensor Technologies and Applications (SENSORCOMM\u201911), Saint Laurent du Var, France."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Kara, M., Laouid, A., Bounceur, A., Lalem, F., AlShaikh, M., Kebache, R., and Sayah, Z. (2021, January 20\u201321). A novel delegated proof of work consensus protocol. Proceedings of the 2021 International Conference on Artificial Intelligence for Cyber Security Systems and Privacy (AI-CSP), El Oued, Algeria.","DOI":"10.1109\/AI-CSP52968.2021.9671096"},{"key":"ref_3","unstructured":"Kara, M., Laouid, A., and Hammoudeh, M. (2023, April 03). An Efficient Multi-Signature Scheme for Blockchain. Cryptology ePrint Archive, Paper 2023\/078. Available online: https:\/\/eprint.iacr.org\/2023\/078."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Chait, K., Laouid, A., Laouamer, L., and Kara, M. (2021, January 20\u201321). A Multi-Key Based Lightweight Additive Homomorphic Encryption Scheme. Proceedings of the 2021 International Conference on Artificial Intelligence for Cyber Security Systems and Privacy (AI-CSP), El Oued, Algeria.","DOI":"10.1109\/AI-CSP52968.2021.9671216"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Ghafir, I., Prenosil, V., Hammoudeh, M., Han, L., and Raza, U. (2017, January 19\u201320). Malicious ssl certificate detection: A step towards advanced persistent threat defence. Proceedings of the International Conference on Future Networks and Distributed Systems, New York, NY, USA.","DOI":"10.1145\/3102304.3102331"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Sniatala, P., Iyengar, S., and Ramani, S.K. (2021). Evolution of Smart Sensing Ecosystems with Tamper Evident Security, Springer.","DOI":"10.1007\/978-3-030-77764-7"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","article-title":"A Method for Obtaining Digital Signatures and Public-Key Cryptosystems","volume":"21","author":"Rivest","year":"1978","journal-title":"Commun. ACM"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","article-title":"A public key cryptosystem and a signature scheme based on discrete logarithms","volume":"31","author":"Elgamal","year":"1985","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Naccache, D., and Stern, J. (1998, January 2\u20135). A New Public Key Cryptosystem Based on Higher Residues. Proceedings of the 5th ACM Conference on Computer and Communications Security (CCS \u201998), New York, NY, USA.","DOI":"10.1145\/288090.288106"},{"key":"ref_10","unstructured":"Paillier, P. (1999, January 2\u20136). Public-key cryptosystems based on composite degree residuosity classes. Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, Prague, Czech Republic."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s00145-001-0015-6","article-title":"Elliptic curve Paillier schemes","volume":"15","author":"Galbraith","year":"2002","journal-title":"J. Cryptol."},{"key":"ref_12","unstructured":"Kawachi, A., Tanaka, K., and Xagawa, K. (2007, January 16\u201320). Multi-bit cryptosystems based on lattice problems. Proceedings of the International Workshop on Public Key Cryptography, Beijing, China."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2633600","article-title":"(Leveled) fully homomorphic encryption without bootstrapping","volume":"6","author":"Brakerski","year":"2014","journal-title":"ACM Trans. Comput. Theory TOCT"},{"key":"ref_14","first-page":"125","article-title":"Fundamentals of Fully Homomorphic Encryption-A Survey","volume":"25","author":"Brakerski","year":"2018","journal-title":"Proc. Electron. Colloq. Comput. Complex."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Smart, N.P., and Vercauteren, F. (2010, January 26\u201328). Fully homomorphic encryption with relatively small key and ciphertext sizes. Proceedings of the International Workshop on Public Key Cryptography, Paris, France.","DOI":"10.1007\/978-3-642-13013-7_25"},{"key":"ref_16","unstructured":"Kilian, J. (2005, January 10\u201312). Evaluating 2-DNF Formulas on Ciphertexts. Proceedings of the Theory of Cryptography, Cambridge, MA, USA."},{"key":"ref_17","unstructured":"Ishai, Y., and Paskin, A. (2007, January 21\u201324). Evaluating branching programs on encrypted data. Proceedings of the Theory of Cryptography Conference, Amsterdam, The Netherlands."},{"key":"ref_18","unstructured":"Gentry, C. (2009). A Fully Homomorphic Encryption Scheme, Stanford University ProQuest Dissertations Publishing."},{"key":"ref_19","unstructured":"Van Dijk, M., Gentry, C., Halevi, S., and Vaikuntanathan, V. (June, January 30). Fully homomorphic encryption over the integers. Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, France."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., and Vaikuntanathan, V. (2011, January 14\u201318). Fully homomorphic encryption from ring-LWE and security for key dependent messages. Proceedings of the Annual Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-642-22792-9_29"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Alt, A., Tromer, E., and Vaikuntanathan, V. (2012, January 19\u201322). On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, New York, NY, USA.","DOI":"10.1145\/2213977.2214086"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"3131","DOI":"10.1109\/JSYST.2020.3001316","article-title":"Privacy-preserving association rule mining using homomorphic encryption in a multikey environment","volume":"15","author":"Pang","year":"2020","journal-title":"IEEE Syst. J."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/978-3-662-44774-1_17","article-title":"Toward Practical Homomorphic Evaluation of Block Ciphers Using Prince","volume":"Volume 8438","author":"Shahverdi","year":"2014","journal-title":"International Conference on Financial Cryptography and Data Security"},{"key":"ref_24","first-page":"357","article-title":"A lightweight fully homomorphic encryption scheme for cloud security","volume":"13","author":"Biksham","year":"2020","journal-title":"Int. J. Inf. Comput. Secur."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1109\/TST.2014.6919824","article-title":"Targeted fully homomorphic encryption based on a double decryption algorithm for polynomials","volume":"19","author":"Yang","year":"2014","journal-title":"Tsinghua Sci. Technol."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Yagoub, M.A., Abdelkader, L., Kazar, O., Bounceur, A., Euler, R., and AlShaikh, M. (2018, January 26\u201327). An adaptive and efficient fully homomorphic encryption technique. Proceedings of the 2nd International Conference on Future Networks and Distributed Systems, New York, NY, USA.","DOI":"10.1145\/3231053.3231088"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/s11859-016-1142-0","article-title":"A novel fully homomorphic encryption scheme bsed on LWE","volume":"21","author":"Ding","year":"2016","journal-title":"Wuhan Univ. J. Nat. Sci."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1137\/120868669","article-title":"Efficient fully homomorphic encryption from (standard) LWE","volume":"43","author":"Brakerski","year":"2014","journal-title":"Siam J. Comput."},{"key":"ref_29","unstructured":"Zhou, T., Zhang, Z., Chen, L., Che, X., Liu, W., and Yang, X. (2023, April 03). Multi-key Fully Homomorphic Encryption Scheme with Compact Ciphertext. Cryptology ePrint Archive, Paper 2021\/1131. Available online: https:\/\/eprint.iacr.org\/2021\/1131."},{"key":"ref_30","unstructured":"Kara, M., Laouid, A., Hammoudeh, M., and Bounceur, A. (2023, April 03). One Digit Checksum for Data Integrity Verification of Cloud-executed Homomorphic Encryption Operations. Cryptology ePrint Archive, Paper 2023\/231. Available online: https:\/\/eprint.iacr.org\/2023\/231."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"433","DOI":"10.22331\/q-2021-04-15-433","article-title":"How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits","volume":"5","author":"Gidney","year":"2021","journal-title":"Quantum"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Gai, K., Qiu, M., Li, Y., and Liu, X.Y. (2017, January 26\u201328). Advanced fully homomorphic encryption scheme over real numbers. Proceedings of the 2017 IEEE 4th International Conference on Cyber Security and Cloud Computing (CSCloud), New York, NY, USA.","DOI":"10.1109\/CSCloud.2017.61"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Yang, H.M., Xia, Q., Wang, X.F., and Tang, D.H. (2012, January 5\u20136). A new somewhat homomorphic encryption scheme over integers. Proceedings of the 2012 International Conference on Computer Distributed Control and Intelligent Environmental Monitoring, Zhangjiajie, China.","DOI":"10.1109\/CDCIEM.2012.21"},{"key":"ref_34","first-page":"10","article-title":"Towards practical homomorphic encryption with efficient public key generation","volume":"3","author":"Ramaiah","year":"2012","journal-title":"Int. J. Netw. Secur."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Coron, J.S., Kim, J., Lee, M.S., Lepoint, T., Tibouchi, M., and Yun, A. (2013, January 26\u201330). Batch fully homomorphic encryption over the integers. Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece.","DOI":"10.1007\/978-3-642-38348-9_20"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Kara, M., Laouid, A., Euler, R., Yagoub, M.A., Bounceur, A., Hammoudeh, M., and Medileh, S. (2020, January 26\u201327). A Homomorphic Digit Fragmentation Encryption Scheme Based on the Polynomial Reconstruction Problem. Proceedings of the 4th International Conference on Future Networks and Distributed Systems (ICFNDS), New York, NY, USA.","DOI":"10.1145\/3440749.3442592"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1007\/s10586-017-1368-4","article-title":"Enhanced DNA and ElGamal cryptosystem for secure data storage and retrieval in cloud","volume":"21","author":"Thangavel","year":"2018","journal-title":"Clust. Comput."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Rogaway, P. (2011, January 14\u201318). Fully Homomorphic Encryption over the Integers with Shorter Public Keys. Proceedings of the Advances in Cryptology\u2014CRYPTO 2011, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-642-22792-9"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1016\/j.pisc.2016.06.061","article-title":"Design of a Polynomial Ring based Symmetric Homomorphic Encryption Scheme","volume":"8","author":"Dasgupta","year":"2016","journal-title":"Perspect. Sci."},{"key":"ref_40","unstructured":"Boer, D., and Kramer, S. (2020). Secure Sum Outperforms Homomorphic Encryption in (Current) Collaborative Deep Learning. arXiv."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/14\/5\/263\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:25:51Z","timestamp":1760124351000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/14\/5\/263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,28]]},"references-count":40,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2023,5]]}},"alternative-id":["info14050263"],"URL":"https:\/\/doi.org\/10.3390\/info14050263","relation":{},"ISSN":["2078-2489"],"issn-type":[{"value":"2078-2489","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,28]]}}}