Benchmarking Dynamic Searchable Symmetric Encryption with Search Pattern Hiding
Date Issued
2015
Date
2015
Author(s)
Wu, Chia-Feng
Abstract
Searchable symmetric encryption (SSE) is a more and more important technique for cloud computing. It lets us can store critical data by encryption in the untrusted cloud server but allows us search the encrypted data with the keyword. The server will not know the keyword and the data content but it can retrieval the correct data to us. However, a database with SSE is not enough practical because the data is not invariable. In general, we modify the data frequently even if it stores in the remote server. The server must can update the encrypted data without decryption. Dynamic searchable symmetric encryption (DSSE) is designed to support the above function. We can add or delete the encrypted data on the server but with no need for decryption. The previous research proposes many schemes for constructing a DSSE system. It can be based on link-list structure or a new primitive called Blind Storage. Each of them has respective advantage and drawback about its function extensibility and efficiency. Nevertheless, for a real available system, the most important key is the tradeoff between performance and security. In this paper, we will implement different DSSE systems to compare their efficiency and security. We can find the disadvantage of the existing DSSE scheme and try to improve it by analyzing the experiment result.
Subjects
Searchable encryption
Dynamic searchable encryption
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-104-R02921048-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):996b4dbeade5ade32b1720bce73215da