View article

We propose a scheme to index encrypted documents on an untrusted server and evaluate keyword search queries against them. The proposed scheme provides better security than deterministic encryption schemes and is far more efficient than existing searchable encryption schemes in literature. Furthermore, it provides the user with a set of control parameters to adjust the level of exposure against the efficiency of the indexing scheme. It also allows easy updates and deletions unlike most existing encrypted searching schemes. We carry out preliminary experiments to test the effectiveness of the proposed scheme and give an intuition for the security properties along with a fairly detailed outline of the security formalism that we are currently developing to analyze the security of our scheme.