Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
Secure Content-Based Image Retrieval in the Cloud With Key Confidentiality
Ist Teil von
IEEE access, 2020, Vol.8, p.114940-114952
Ort / Verlag
Piscataway: IEEE
Erscheinungsjahr
2020
Quelle
EZB Free E-Journals
Beschreibungen/Notizen
Owing to the rapid development of cloud services and personal privacy demand, secure cloud storage services and search over encrypted datasets have become an important issue. Recently, the leaking of images such as identification and driver's licenses catches much attention. The trend towards secure computation has been widely discussed, especially asymmetric scalar-product-preserving encryption (ASPE) and homomorphic encryption (HE). Although ASPE have ability to encrypt and determine the similarity between ciphertexts efficiently, it is not a practical methodology due to its assumption that the users are fully trusted in real world and it also may have key leakage problem. Contrary to ASPE, HE can execute addition and multiplication in the encrypted domain and solve key leakage problem. Hence, in this paper, we combine the opinions of HE and ASPE to propose new privacy-preserving content-based image retrieval with key confidentiality scheme against the attacks from data owner, cloud server and users. Our privacy preserving image retrieval scheme is developed under strong threat model that is close to real world. Furthermore, to the best of our knowledge, our work is the first one that developing scheme under the assumption that all the entities involved in privacy-preserving image retrieval system are semi-trusted. Our scheme ensures the confidentiality of key and privacy of query information at the same time. In addition, we provide a lightweight verification to check whether the search query is fake or not. Finally, the experiment results show that the computation overheads and search precision are acceptable at the same time.