Attribute-based multi-user collaborative searchable encryption in COVID-19

被引:4
作者
Zhao, Fan [1 ]
Peng, Changgen [1 ,2 ]
Xu, Dequan [1 ]
Liu, Yicen [3 ]
Niu, Kun [1 ]
Tang, Hanlin [4 ]
机构
[1] Guizhou Univ, Coll Comp Sci & Technol, State Key Lab Publ Big Data, Guiyang 550025, Peoples R China
[2] Guizhou Univ, Guizhou Big Data Acad, Guiyang 550025, Peoples R China
[3] Natl Key Lab Signal Blind Proc, Chengdu 610000, Peoples R China
[4] Guizhou Data Treasure Network Technol Co Ltd, Guiyang 550000, Peoples R China
关键词
Searchable encryption; Security and privacy; Collaborative search; Attribute-based searchable encryption; PUBLIC-KEY ENCRYPTION; KEYWORD SEARCH; ACCESS-CONTROL; SECURE;
D O I
10.1016/j.comcom.2023.04.003
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the outbreak of COVID-19, the government has been forced to collect a large amount of detailed information about patients in order to effectively curb the epidemic of the disease, including private data of patients. Searchable encryption is an essential technology for ciphertext retrieval in cloud computing environments, and many searchable encryption schemes are based on attributes to control user's search permissions to protect their data privacy. The existing attribute-based searchable encryption (ABSE) scheme can only implement the situation where the search permission of one person meets the search policy and does not support users to obtain the search permission through collaboration. In this paper, we proposed a new attribute-based collaborative searchable encryption scheme in multi-user setting (ABCSE-MU), which takes the access tree as the access policy and introduces the translation nodes to implement collaborative search. The cooperation can only be reached on the translation node and the flexibility of search permission is achieved on the premise of data security. ABCSE-MU scheme solves the problem that a single user has insufficient search permissions but still needs to search, making the user's access policy more flexible. We use random blinding to ensure the confidentiality and security of the secret key, further prove that our scheme is secure under the Decisional Bilinear Diffie-Hellman (DBDH) assumption. Security analysis further shows that the scheme can ensure the confidentiality of data under chosen-keyword attacks and resist collusion attacks.
引用
收藏
页码:118 / 126
页数:9
相关论文
共 34 条
  • [1] Attrapadung N, 2011, LECT NOTES COMPUT SC, V6571, P90, DOI 10.1007/978-3-642-19379-8_6
  • [2] Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P506
  • [3] Boneh D, 2007, LECT NOTES COMPUT SC, V4392, P535
  • [4] [曹素珍 Cao Suzhen], 2020, [计算机工程, Computer Engineering], V46, P181
  • [5] Public key encryption with keyword search secure against keyword guessing attacks without random oracle
    Fang, Liming
    Susilo, Willy
    Ge, Chunpeng
    Wang, Jiandong
    [J]. INFORMATION SCIENCES, 2013, 238 : 221 - 241
  • [6] Verifiable searchable symmetric encryption for conjunctive keyword queries in cloud storage
    Gan, Qingqing
    Liu, Joseph K.
    Wang, Xiaoming
    Yuan, Xingliang
    Sun, Shi-Feng
    Huang, Daxin
    Zuo, Cong
    Wang, Jianfeng
    [J]. FRONTIERS OF COMPUTER SCIENCE, 2022, 16 (06)
  • [7] Secure conjunctive keyword search over encrypted data
    Golle, P
    Staddon, J
    Waters, B
    [J]. APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, PROCEEDINGS, 2004, 3089 : 31 - 45
  • [8] An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks
    Huang, Qiong
    Li, Hongbo
    [J]. INFORMATION SCIENCES, 2017, 403 : 1 - 14
  • [9] Forward Secure Dynamic Searchable Symmetric Encryption with Efficient Updates
    Kim, Kee Sung
    Kim, Minkyu
    Lee, Dongsoo
    Park, Je Hong
    Kim, Woo-Hwan
    [J]. CCS'17: PROCEEDINGS OF THE 2017 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2017, : 1449 - 1463
  • [10] Achieving Secure and Efficient Dynamic Searchable Symmetric Encryption over Medical Cloud Data
    Li, Hongwei
    Yang, Yi
    Dai, Yuanshun
    Yu, Shui
    Xiang, Yong
    [J]. IEEE TRANSACTIONS ON CLOUD COMPUTING, 2020, 8 (02) : 484 - 494