An improved secure designated server public key searchable encryption scheme with multi-ciphertext indistinguishability

Abstract

In the cloud, users prefer to store their sensitive data in encrypted form. Searching keywords over encrypted data without loss of data confidentiality is an important issue. In 2004, Boneh et al. proposed the first public-key searchable encryption scheme which allows users to search by the private key. However, most existing public-key searchable encryption schemes are vulnerable to keyword guessing attack and can not satisfy multi-ciphertext indistinguishability. In this paper, we construct a secure designated server public-key searchable encryption based on Diffie-Hellman problem. Our security analysis shows that our proposed scheme can resist against keyword guessing attack and provide multi-ciphertext indistinguishability for any adversity. Furthermore, the proposed scheme can achieve multi-trapdoor privacy for external attackers. Moreover, the simulation results between our scheme and previous schemes demonstrate our new scheme is suitable for practical application.

Research on dynamic searchable encryption method based on Bloom filter

“…Guo et al [18] analyse the scheme of Li et al [19] and demonstrate that its Trapdoor indistinguishability is not satisfied. A security scheme that satisfies the requirements of the test-specified server and provides stronger security guarantees for the confidentiality of keywords is also proposed.…”

“…There are four situations that need to be determined during the update: 1. When the keyword corresponding to the updated document does not exist (line [8][9][10][11][12][13][14][15][16][17][18]. At this point, you need to initialize the keyword and its files, and update the ABF; 2, when the keyword exists, and the corresponding first document is the target document (line 20-28).…”

Research on Dynamic Searchable Encryption Method Based on Bloom Filter

“…Guo et al [17] analyze the scheme of Li et al [18] and demonstrate that its trapdoor indistinguishability is not satisfied. A security scheme that satisfies the requirements of the test-specified server and provides stronger security guarantees for the confidentiality of keywords is also proposed.…”

“…When the keyword corresponding to the updated document does not exist (line [8][9][10][11][12][13][14][15][16][17][18]. At this point, you need to initialize the keyword and its files and update the ABF;…”