Dynamic Searchable Symmetric Encryption With Small Leakage And Physical Delete

Symmetric-key encryption with keyword search allows clients to upload their keyword searchable ciphertexts to a server, then delegate keyword search to the server and retrieve all matched ciphertexts, ?nally, the client decrypts these related ciphertexts. Dynamic Searchable Symmetric Encryption(DSSE) allows a client not only to search over ciphertexts as traditional SSE, but also update these ciphertexts according to user's requirements. It has been recognized as a fundamental and promising method to build secure cloud storage.A practical SSE scheme should satisfy the following requirement: efficient searching performance, security against adaptive chosen keyword attacks, dynamic update with small leakage and compact indexes. Unfortunately, previous schemes can't achieve all these properties at the same time. We design a new dynamic searchable symmetric encryption scheme to overcome all the limitations of previous schemes. The biggest challenge in our work is to achieve the physical deletion with small leakage. We leverage the cooperation of logical and physical deletions, and run physical deletion in due course to avoid extra information leakage.We compared our DSSE with previous schemes. We coded DSSE scheme and tested its performance in initialization phase, searching phase and dynamic update phase on a simulated database with millions ?le keyword pairs. The overall testing results showed that DSSE with small leakage and physical deletion can perform ciphertexts operations effectively.