Fuzzy Dynamical Searchable Encryption Scheme Based on Balanced Binary Tree

In recent years, the issues of data security and privacy in the field of cloud computing have garnered increasing attention. To prevent data leakage, data owners choose to encrypt their data documents before uploading them. However, effectively retrieving such data has become a new challenge. In this paper, we propose an innovative dynamic searchable encryption scheme that supports fuzzy search. Our scheme employs a balanced binary tree as the index, storing document identifiers with the same keywords in leaf nodes and generating Bloom filters for them. Additionally, we introduce random values during the index generation process, thereby enhancing the security of the index. Leveraging the unique structure of this tree-based index, we have successfully reduced the time complexity of search operations, lowering time costs, and enabling dynamic updates. Finally, through theoretical analysis and experimental validation, we demonstrate the outstanding efficiency of our scheme in achieving retrieval and a lower time complexity compared to other schemes.