{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T09:06:28Z","timestamp":1780045588047,"version":"3.53.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2022,2,25]],"date-time":"2022-02-25T00:00:00Z","timestamp":1645747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,25]],"date-time":"2022-02-25T00:00:00Z","timestamp":1645747200000},"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":["Multimed Tools Appl"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s11042-022-12043-7","type":"journal-article","created":{"date-parts":[[2022,2,25]],"date-time":"2022-02-25T12:03:19Z","timestamp":1645790599000},"page":"14403-14449","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Towards a fully homomorphic symmetric cipher scheme resistant to plain-text\/cipher-text attacks"],"prefix":"10.1007","volume":"81","author":[{"given":"Khalil","family":"Hariss","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hassan","family":"Noura","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,2,25]]},"reference":[{"issue":"2","key":"12043_CR1","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1109\/MSP.2012.2230219","volume":"30","author":"C Aguilar-Melchor","year":"2013","unstructured":"Aguilar-Melchor C, Fau S, Fontaine C, Gogniat G, Sirdey R (2013) Recent advances in homomorphic encryption: A possible future for signal processing in the encrypted domain. IEEE Signal Proc Mag 30(2):108\u2013117","journal-title":"IEEE Signal Proc Mag"},{"key":"12043_CR2","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Gentry C, Halevi S (2013) Packed ciphertexts in LWE-based homomorphic encryption. In: Kurosawa K, Hanaoka G (eds) Public-Key Cryptography \u2013 PKC 2013. Springer, Berlin, pp 1\u201313","DOI":"10.1007\/978-3-642-36362-7_1"},{"key":"12043_CR3","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Gentry C, Vinod V (2014) (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory 6(3)","DOI":"10.1145\/2633600"},{"key":"#cr-split#-12043_CR4.1","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Vaikuntanathan V (2011) Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Rogaway P","DOI":"10.1007\/978-3-642-22792-9_29"},{"key":"#cr-split#-12043_CR4.2","unstructured":"(ed) Advances in cryptology - CRYPTO 2011. Springer, Berlin, pp 505-524"},{"key":"12043_CR5","doi-asserted-by":"crossref","unstructured":"Catalano D, Cramer R, Damg\u00e5rd IB (2005) Contemporary cryptology. Advanced courses in mathematics: CRM Barcelona Birkh\u00e4user Di Crescenzo G, Pointcheval D (eds)","DOI":"10.1007\/3-7643-7394-6"},{"key":"#cr-split#-12043_CR6.1","doi-asserted-by":"crossref","unstructured":"Coron J-S, Mandal A, Naccache D, Tibouchi M (2011) Fully homomorphic encryption over the integers with shorter public keys. In: Rogaway P","DOI":"10.1007\/978-3-642-22792-9_28"},{"key":"#cr-split#-12043_CR6.2","unstructured":"(ed) Advances in cryptology - CRYPTO 2011. Springer, Berlin, pp 487-504"},{"key":"12043_CR7","doi-asserted-by":"crossref","unstructured":"Domingo-Ferrer J (2002) A provably secure additive and multiplicative privacy homomorphism. In: Chan AH, Gligor V (eds) Information security. Springer, Berlin, pp 471\u2013483","DOI":"10.1007\/3-540-45811-5_37"},{"key":"12043_CR8","doi-asserted-by":"crossref","unstructured":"Gentry C (2009) A fully homomorphic encryption scheme. PhD thesis, Stanford University. crypto.stanford.edu\/craig","DOI":"10.1145\/1536414.1536440"},{"key":"12043_CR9","doi-asserted-by":"crossref","unstructured":"Gentry C (2009) Fully homomorphic encryption using ideal lattices. In: Proceedings of the forty-first annual ACM symposium on theory of computing, STOC \u201909. Association for Computing Machinery, New York, pp 169\u2013178","DOI":"10.1145\/1536414.1536440"},{"key":"12043_CR10","doi-asserted-by":"crossref","unstructured":"Gentry C, Sahai A, Waters B (2013) Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti R, Garay JA (eds) Advances in cryptology \u2013 CRYPTO 2013, Springer, pp 75\u201392","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"12043_CR11","doi-asserted-by":"crossref","unstructured":"Hariss K, Chamoun M, Samhat AE (2017) On DGHV and BGV fully homomorphic encryption schemes. In: 2017 1St cyber security in networking conference (CSNet), pp 1\u20139","DOI":"10.1109\/CSNET.2017.8242007"},{"key":"12043_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.jisa.2017.02.001","volume":"34","author":"K Hariss","year":"2017","unstructured":"Hariss K, Noura H, Samhat AE (2017) Fully enhanced homomorphic encryption algorithm of MORE approach for real world applications. Journal of Information Security and Applications 34:233\u2013242","journal-title":"Journal of Information Security and Applications"},{"key":"12043_CR13","doi-asserted-by":"crossref","unstructured":"Hariss K, Noura H, Samhat AE, Chamoun M (2018) 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) Risks and Security of Internet and Systems. Springer International Publishing, Cham, pp 127\u2013139","DOI":"10.1007\/978-3-319-76687-4_9"},{"key":"12043_CR14","doi-asserted-by":"crossref","unstructured":"Im J, Choi J, Nyang D, Lee M (2016) Privacy-preserving palm print authentication using homomorphic encryption. In: 2016 IEEE 14Th intl conf on dependable, autonomic and secure computing, 14th intl conf on pervasive intelligence and computing, 2nd intl conf on big data intelligence and computing and cyber science and technology congress(DASC\/picom\/datacom\/cyberscitech), pp 878\u2013881","DOI":"10.1109\/DASC-PICom-DataCom-CyberSciTec.2016.150"},{"key":"12043_CR15","doi-asserted-by":"crossref","unstructured":"Katz J, Lindell Y (2014) Introduction to Modern Cryptography. Chapman & hall\/CRC, 2nd edn","DOI":"10.1201\/b17668"},{"key":"12043_CR16","unstructured":"Khalil H, Samhat AE, Chamoun M (2019) An efficient fhe scheme to secure cloud computing. In: Proceedings of the 16th International Joint Conference on e-Business and Telecommunications - Vol 2: SECRYPT, INSTICC, SciTePress, pp 341\u2013349"},{"key":"12043_CR17","first-page":"965","volume":"2015","author":"Miran Kim","year":"2015","unstructured":"Kim Miran, Lauter KE (2015) Private genome analysis through homomorphic encryption. IACR Cryptol ePrint Arch 2015:965","journal-title":"IACR Cryptol ePrint Arch"},{"key":"12043_CR18","first-page":"4195852:1","volume":"2020","author":"T Kim","year":"2020","unstructured":"Kim T, Oh Y, Kim H (2020) Efficient privacy-preserving fingerprint-based authentication system using fully homomorphic encryption. Commun Networks 2020:4195852:1\u20134195852:11","journal-title":"Commun Networks"},{"key":"12043_CR19","first-page":"637","volume":"2012","author":"A Kipnis","year":"2012","unstructured":"Kipnis A, Hibshoosh E (2012) Efficient methods for practical fully homomorphic symmetric-key encrypton, randomization and verification. IACR Cryptology ePrint Archive 2012:637","journal-title":"IACR Cryptology ePrint Archive"},{"key":"12043_CR20","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.neucom.2013.10.005","volume":"131","author":"L Leng","year":"2014","unstructured":"Leng L, Teoh ABJ, Li M, Khan MK (2014) Analysis of correlation of 2dpalmhash code and orientation range suitable for transposition. Neurocomputing 131:377\u2013387","journal-title":"Neurocomputing"},{"issue":"6","key":"12043_CR21","doi-asserted-by":"publisher","first-page":"1979","DOI":"10.1016\/j.jnca.2011.07.003","volume":"34","author":"L Leng","year":"2011","unstructured":"Leng L, Zhang J (2011) Dual-key-binding cancelable palmprint cryptosystem for palmprint protection and information security. J Netw Comput Appl 34 (6):1979\u20131989","journal-title":"J Netw Comput Appl"},{"key":"12043_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.neucom.2012.08.028","volume":"108","author":"L Leng","year":"2013","unstructured":"Leng L, Zhang J (2013) Palmhash code vs. palmphasor code. Neurocomputing 108:1\u201312","journal-title":"Neurocomputing"},{"issue":"20","key":"12043_CR23","doi-asserted-by":"publisher","first-page":"20739","DOI":"10.1007\/s11042-016-3971-4","volume":"76","author":"Xin Liao","year":"2017","unstructured":"Liao Xin, Li Kaide, Yin Jiaojiao (2017) Separable data hiding in encrypted image based on compressive sensing and discrete fourier transform. Multimed Tools Appl 76(20):20739\u201320753","journal-title":"Multimed Tools Appl"},{"key":"12043_CR24","doi-asserted-by":"crossref","unstructured":"Liao X, Yin J, Chen M, Qin Z (2020) Adaptive payload distribution in multiple images steganography based on image texture features. IEEE Transactions on Dependable and Secure Computing","DOI":"10.1109\/TDSC.2020.3004708"},{"issue":"3","key":"12043_CR25","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1109\/TCSVT.2019.2896270","volume":"30","author":"X Liao","year":"2019","unstructured":"Liao X, Yu Y, Li B, Li Z, Qin Z (2019) A new payload partition strategy in color image steganography. IEEE Trans Circuits Syst Video Technol 30 (3):685\u2013696","journal-title":"IEEE Trans Circuits Syst Video Technol"},{"key":"12043_CR26","doi-asserted-by":"crossref","unstructured":"Micciancio D, Peikert C (2013) Hardness of SIS and LWE with small parameters. In: Canetti R, Garay JA (eds) Advances in cryptology \u2013 CRYPTO 2013. Springer, Berlin, pp 21\u201339","DOI":"10.1007\/978-3-642-40041-4_2"},{"issue":"14","key":"12043_CR27","doi-asserted-by":"publisher","first-page":"18383","DOI":"10.1007\/s11042-018-5660-y","volume":"77","author":"H Noura","year":"2018","unstructured":"Noura H, Chehab A, Sleem L, Noura M, Couturier R, Mansour MM (2018) One round cipher algorithm for multimedia IoT devices. Multimedia Tools and Applications 77(14):18383\u201318413","journal-title":"Multimedia Tools and Applications"},{"key":"12043_CR28","doi-asserted-by":"crossref","unstructured":"Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: Stern J (ed) Advances in cryptology \u2014 EUROCRYPT \u201999. Springer, Berlin, pp 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"key":"12043_CR29","doi-asserted-by":"crossref","unstructured":"Regev Oded (September 2009) On lattices, learning with errors, random linear codes, and cryptography. j. ACM 56(6)","DOI":"10.1145\/1568318.1568324"},{"issue":"2","key":"12043_CR30","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest RL, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120\u2013126","journal-title":"Commun ACM"},{"key":"12043_CR31","unstructured":"Schwarzweller C (2009) The chinese remainder theorem, its proofs and its generalizations in mathematical repositories. Studies in Logic, Grammar and Rhetoric, 18(31)"},{"issue":"1","key":"12043_CR32","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10623-012-9720-4","volume":"71","author":"NP Smart","year":"2014","unstructured":"Smart NP, Vercauteren F (2014) Fully homomorphic SIMD operations. Des Codes Cryptography 71(1):57\u201381","journal-title":"Des Codes Cryptography"},{"issue":"2","key":"12043_CR33","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1108\/IJPCC-02-2015-0012","volume":"11","author":"WAA Torres","year":"2015","unstructured":"Torres WAA, Bhattacharjee N, Srinivasan B (2015) Privacy-preserving biometrics authentication systems using fully homomorphic encryption. International Journal of Pervasive Computing and Communications 11(2):151\u2013168","journal-title":"International Journal of Pervasive Computing and Communications"},{"issue":"1","key":"12043_CR34","doi-asserted-by":"publisher","first-page":"163","DOI":"10.2478\/tmmp-2019-0012","volume":"73","author":"D Viz\u00e1r","year":"2019","unstructured":"Viz\u00e1r D, Vaudenay S (2019) Cryptanalysis of enhanced more. Tatra Mountains Mathematical Publications 73(1):163\u2013178","journal-title":"Tatra Mountains Mathematical Publications"},{"key":"12043_CR35","doi-asserted-by":"crossref","unstructured":"Wagner D (2003) Cryptanalysis of an algebraic privacy homomorphism. In: CBoyd D, Mao W (eds) Information security. Springer, Berlin, pp 234\u2013239","DOI":"10.1007\/10958513_18"},{"key":"12043_CR36","first-page":"193","volume":"2012","author":"L Xiao","year":"2012","unstructured":"Xiao L, Bastani O, Yen I-L (2012) An efficient homomorphic encryption protocol for multi-user systems. IACR Cryptology ePrint Archive 2012:193","journal-title":"IACR Cryptology ePrint Archive"},{"key":"12043_CR37","doi-asserted-by":"crossref","unstructured":"Yi X, Paulet R, Bertino E (2014) Homomorphic encryption and applications. Springer Publishing Company, Incorporated","DOI":"10.1007\/978-3-319-12229-8"},{"key":"#cr-split#-12043_CR38.1","doi-asserted-by":"crossref","unstructured":"van Dijk M, Gentry C, Halevi S, Vaikuntanathan V (2010) Fully homomorphic encryption over the integers. In: Gilbert H","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"#cr-split#-12043_CR38.2","unstructured":"(ed) Advances in cryptology - EUROCRYPT 2010. Springer, Berlin, pp 24-43"},{"key":"12043_CR39","first-page":"294","volume":"2015","author":"E \u00d6zt\u00fcrk","year":"2015","unstructured":"\u00d6zt\u00fcrk E, Dor\u00f6z Y, Sunar B, Savas E (2015) Accelerating somewhat homomorphic evaluation using FPGAs. IACR Cryptology ePrint Archive 2015:294","journal-title":"IACR Cryptology ePrint Archive"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-022-12043-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-022-12043-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-022-12043-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T08:29:11Z","timestamp":1651048151000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-022-12043-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,25]]},"references-count":42,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["12043"],"URL":"https:\/\/doi.org\/10.1007\/s11042-022-12043-7","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"value":"1380-7501","type":"print"},{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,25]]},"assertion":[{"value":"8 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}