Research on dynamic searchable encryption method based on Bloom filter

Abstract

Data outsourcing become more and more popular due to its low cost and flexibility. However, there is a problem that the cloud server used to store data is partially trusted. Searchable encryption is an efficient technology is devoted to helping people conduct accurate searches without leaking information. Nonetheless, most existing schemes can’t support dynamic update or meet the privacy requirements of all users. There have been some experiments to solve these issues by implementing a dynamically searchable asymmetric encryption scheme. This paper proposes an efficient searchable encryption scheme based on the Authen-ticator Bloom Filter (ABF). The solution can support dynamic update, multiuser and meet the forward and backward security. This paper uses ABF to improve the efficiency of search and update, while playing a significant role in dynamic update. This paper designs a new token encryption scheme and file set encryption scheme, which not only helps users reduce time in search and update, but also supports multiuser mode. Experiments show that the proposed scheme takes less time in searching and updating algorithms, especially when the keyword does not exist. The solution also takes into account the problem of history storage when updating, which reduces the unnecessary consumption of memory and avoids multiple storage states of the same file.