Anti-collusion attack image retrieval privacy protection scheme for ASPE

被引:0
|
作者
Ying C. [1 ]
Meng Z. [1 ]
Xin L. [1 ]
Yu Z. [1 ]
Yanfang F. [1 ]
机构
[1] Department of Computer Science and Technology, Beijing Information Science and Technology University, Beijing
关键词
cloud computing; collusion attacks; image retrieval; locality sensitive hashing; privacy-preserving techniques;
D O I
10.19665/j.issn1001-2400.20230408
中图分类号
学科分类号
摘要
The existing algorithm based on Asymmetric Scalar-Product-Preserving Encryption (ASPE) realizes privacy protection in image retrieval under cloud computing. But due to untrustworthy cloud service providers and retrieval users during retrieval and the existence of an external adversary, it cannot resist the collusion attack of malicious users and cloud servers, which may lead to the leakage of image data containing sensitive information. Aiming at multi-user scenarios, an Anti-collusion attack image retrieval privacy protection scheme for ASPE is proposed. First, the scheme uses proxy re-encryption to solve the problem of image key leakage caused by transmitting private keys to untrusted users. Second, the feature key leakage problem between the cloud service provider and the retrieval user due to collusion attacks is solved by adding a diagonal matrix encryption at the client side. Finally, linear discriminant analysis is used to solve the problem of retrieval accuracy drop caused by dimensionality reduction when locality sensitive hashing is used to construct an index. The security analysis proves that the scheme is safe and effective and that it can not only resist collusion attacks from cloud service providers and untrusted users, ciphertext-only attacks, known background attacks and known plaintext attacks, but also realize protection of images and private keys during the process. Experimental results show that under the premise of protecting image privacy and ensuring retrieval efficiency, the retrieval accuracy of the proposed scheme in the ciphertext domain and that in the plaintext domain are only about 2% different. © 2023 Science Press. All rights reserved.
引用
收藏
页码:156 / 165
页数:9
相关论文
共 19 条
  • [1] YANG Haibin, LI Ruifeng, YI Zhengge, Et al., Efficient Cloud Storage Data Auditing Scheme without Bilinear Pairing [J], Journal of Xidian University, 49, 1, pp. 47-54, (2022)
  • [2] ZHANG M, CAI Y, ZHANG Y, Et al., A Survey on Content-Based Encrypted Image Retrieval in Cloud Computing, 2021 3rd International Conference on Big Data and Security, pp. 312-325, (2022)
  • [3] WENG W, YAKIMENK Y, LIN Y, Et al., Generative Adversarial User Privacy in Lossy Single-Server Information Retrieval, IEEE Transactions on Information Forensics and Security, 17, pp. 3495-3510, (2022)
  • [4] YAN Xixi, ZHAO Qiang, TANG Yongli, Et al., Multi-Keyword Search Encryption Scheme Supporting Flexible Access Control, Journal of Xidian University, 49, 1, pp. 55-66, (2022)
  • [5] LI Y, MA J, MIAO Y, Et al., Traceable and Controllable Encrypted Cloud Image Search in Multi-User Settings, IEEE Transactions on Cloud Computing, 10, 4, pp. 2936-2948, (2022)
  • [6] LI Y, MA J, MIAO Y, Et al., DVREI: Dynamic Verifiable Retrieval Over Encrypted Images [J], IEEE Transactions on Computers, 71, 8, pp. 1755-1769, (2022)
  • [7] DONG X, ZHANG W, SHAH M, Et al., Watermarking-Based Secure Plaintext Image Protocols for Storage, Show, Deletion and Retrieval in the Cloud, IEEE Transactions on Services Computing, 15, 3, pp. 1678-1692, (2022)
  • [8] SONG L, MIAO Y, WENG J, Et al., Privacy-Preserving Threshold-Based Image Retrieval in Cloud-Assisted Internet of ThingsLJ], IEEE Internet of Things Journal, 9, 15, pp. 13598-13611, (2022)
  • [9] XIA Z, JIANG L, LIU D, Et al., BOEW: A Content-Based Image Retrieval Scheme Using Bag-of-Encrypted-Words in Cloud Computing, IEEE Transactions on Services Computing, 15, 1, pp. 202-214, (2022)
  • [10] SONG Fuyuan, QIN Zheng, ZHANG Jixin, Et al., Efficient and Secure Multi-User Outsourced Image Retrieval Scheme with Access Control, Chinese Journal of Network and Information Security, 7, 5, pp. 29-39, (2021)