An Approach for Searching on Encrypted Data Based on Bloom Filter

It is desirable to store data on data storage servers such as file servers in encrypted form to reduce security risks. But this usually implies that one has to sacrifice functionality for security. For example, if a client wishes to retrieve only documents containing certain words, it was not previously known how to let the data storage server perform the search and answer the query without loss of data confidentiality. In this paper, we describe our schemes for the problem of searching on encrypted data based on Bloom Filter. Our schemes have a number of crucial advantages: The untrusted server cannot learn anything about the plaintext when only given the ciphertext in our solution. Our schemes provide query isolation for searches, meaning that the untrusted server cannot learn anything more about the plaintext than the search result. The algorithms we present are simple, fast, and introduce almost no space and communication overhead.