Retrieving Encrypted Images Using Convolution Neural Network and Fully Homomorphic Encryption

被引:9
|
作者
Alsaedi, Emad M. [1 ]
Farhan, Alaa Kadhim [1 ]
机构
[1] Univ Technol Baghdad, Comp Sci Dept, Baghdad, Iraq
关键词
CKKS; CNN; Content based image retrieval; Homomorphic encryption; Random forest;
D O I
10.21123/bsj.2022.6550
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
A content-based image retrieval (CBIR) is a technique used to retrieve images from an image database. However, the CBIR process suffers from less accuracy to retrieve images from an extensive image database and ensure the privacy of images. This paper aims to address the issues of accuracy utilizing deep learning techniques as the CNN method. Also, it provides the necessary privacy for images using fully homomorphic encryption methods by Cheon, Kim, Kim, and Song (CKKS). To achieve these aims, a system has been proposed, namely RCNN_CKKS, that includes two parts. The first part (offline processing) extracts automated high-level features based on a flatting layer in a convolutional neural network (CNN) and then stores these features in a new dataset. In the second part (online processing), the client sends the encrypted image to the server, which depends on the CNN model trained to extract features of the sent image. Next, the extracted features are compared with the stored features using a Hamming distance method to retrieve all similar images. Finally, the server encrypts all retrieved images and sends them to the client. Deep-learning results on plain images were 97.94% for classification and 98.94% for retriever images. At the same time, the NIST test was used to check the security of CKKS when applied to Canadian Institute for Advanced Research (CIFAR-10) dataset. Through these results, researchers conclude that deep learning is an effective method for image retrieval and that a CKKS method is appropriate for image privacy protection.
引用
收藏
页码:206 / 220
页数:15
相关论文
共 50 条
  • [31] Improved Delegation of Computation Using Fully Homomorphic Encryption
    Chung, Kai-Min
    Kalai, Yael
    Vadhan, Salil
    ADVANCES IN CRYPTOLOGY - CRYPTO 2010, 2010, 6223 : 483 - +
  • [32] Fully Homomorphic Encryption Using Hidden Ideal Lattice
    Plantard, Thomas
    Susilo, Willy
    Zhang, Zhenfei
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2013, 8 (12) : 2127 - 2137
  • [33] Secure Face Matching Using Fully Homomorphic Encryption
    Boddeti, Vishnu Naresh
    2018 IEEE 9TH INTERNATIONAL CONFERENCE ON BIOMETRICS THEORY, APPLICATIONS AND SYSTEMS (BTAS), 2018,
  • [34] Evaluation of encrypted matching criteria using homomorphic encryption based FSM
    Mahmoud AbdelHafeez Sayed
    Mostafa Taha
    Journal of Cryptographic Engineering, 2025, 15 (1)
  • [35] Input-Output History Feedback Controller for Encrypted Control With Leveled Fully Homomorphic Encryption
    Teranishi, Kaoru
    Sadamoto, Tomonori
    Kogiso, Kiminao
    IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, 2024, 11 (01): : 271 - 283
  • [37] RETRACTED ARTICLE: Secret image sharing scheme with encrypted shadow images using optimal homomorphic encryption technique
    K. Shankar
    Mohamed Elhoseny
    R. Satheesh Kumar
    S. K. Lakshmanaprabu
    Xiaohui Yuan
    Journal of Ambient Intelligence and Humanized Computing, 2020, 11 : 1821 - 1833
  • [38] Retraction Note: Secret image sharing scheme with encrypted shadow images using optimal homomorphic encryption technique
    K. Shankar
    Mohamed Elhoseny
    R. Satheesh Kumar
    S. K. Lakshmanaprabu
    Xiaohui Yuan
    Journal of Ambient Intelligence and Humanized Computing, 2023, 14 (9) : 13035 - 13035
  • [39] Oblivious Neural Network Computing via Homomorphic Encryption
    Orlandi, C.
    Piva, A.
    Barni, M.
    EURASIP JOURNAL ON INFORMATION SECURITY, 2007, (01):
  • [40] Rotation Key Reduction for Client-Server Systems of Deep Neural Network on Fully Homomorphic Encryption
    Lee, Joon-Woo
    Lee, Eunsang
    Kim, Young-Sik
    No, Jong-Seon
    ADVANCES IN CRYPTOLOGY, ASIACRYPT 2023, PART VI, 2023, 14443 : 36 - 68