计算机科学
同态加密
正确性
访问控制
加密
情报检索
可验证秘密共享
云计算
理论计算机科学
方案(数学)
计算机安全
算法
操作系统
数学分析
数学
集合(抽象数据类型)
程序设计语言
作者
Qiuyun Tong,Yinbin Miao,Lei Chen,Jian Weng,Ximeng Liu,Kim‐Kwang Raymond Choo,Robert H. Deng
标识
DOI:10.1109/tsc.2021.3083512
摘要
To ensure the security of images outsourced to the malicious cloud without affecting searchability on such outsourced (typically encrypted) images, one could use privacy-preserving Content-Based Image Retrieval (CBIR) primitive. However, conventional privacy-preserving CBIR schemes based on Searchable Symmetric Encryption (SSE) are not capable of supporting efficient fine-grained access control and result verification simultaneously. Therefore, in this article, we propose a V erifiable F ine-grained encrypted I mage R etrieval scheme in the M ulti-owner multi-user settings (VFIRM). VFIRM first utilizes a novel polynomial-based access strategy to provide efficient fine-grained access control. Then, it employs the dual secure $k$ -nearest neighbor technique to distribute distinct keys to different data owners and data users, and finally implements an adapted homomorphic MAC technique to check the correctness of search results. Our formal security analysis shows that VFIRM is non-adaptive semantic secure if the client's search key is generated randomly and keeps in secret. Our empirical experiments using two real-world datasets (i.e., Caltech101 and Corel5k) demonstrate the practicality of VFIRM.
科研通智能强力驱动
Strongly Powered by AbleSci AI