Telecommunications Science ›› 2023, Vol. 39 ›› Issue (11): 116-127.doi: 10.11959/j.issn.1000-0801.2023237

• Research and Development • Previous Articles    

Attribute-based multi-keyword searchable encryption scheme based on counting Bloom filters

Zhidan LI1, Yongqun CHEN1,2, Wei WANG1,2   

  1. 1 The 36th Research Institute of China Electronics Technology Group Corporation, Jiaxing 314033, China
    2 National Key Laboratory of Electromagnetic Space Security, Jiaxing 314033, China
  • Revised:2023-11-14 Online:2023-11-01 Published:2023-11-01
  • Supported by:
    The National Natural Science Foundation of China(U20B2050)

Abstract:

To address the problems of low retrieval efficiency of searchable encryption scheme under traditional public key cryptosystem, high storage overhead of keyword index, and index does not support dynamic update, based on the good space and time efficiency of counting Bloom filter to determine whether an element belongs to a certain set, the feature into searchable encryption was applied to establish keyword index, thus, the keyword set was mapped into a binary vector, thereby reducing the keyword storage cost.Simultaneously, the feature of counting Bloom filter can be deleted was used to realize the dynamic update of keyword index.In addition, to prevent adversaries from inferring keyword plaintext information from binary vectors through statistical analysis, the binary vector was blinded by permutation, and then the permutation was encrypted by attribute-based encryption for secret sharing.After legitimate users generated keyword traps correctly, the service provider helped users complete keyword matching queries based on the user’s keyword trapdoor.Finally, the security and efficiency of the scheme were proved through security analysis and simulation experiments.

Key words: searchable encryption, counting Bloom filter, attribute-based encryption, permutation

CLC Number: 

No Suggested Reading articles found!