@conference {19599,
	title = {Dynamic Searchable Symmetric Encryption},
	booktitle = {CCS {\textquoteright}12 Proceedings of the 2012 ACM Conference on Computer and Communications Security },
	series = {CCS {\textquoteright}12},
	year = {2012},
	month = {2012///},
	pages = {965 - 976},
	publisher = {ACM},
	organization = {ACM},
	abstract = {Searchable symmetric encryption (SSE) allows a client to encrypt its data in such a way that this data can still be searched. The most immediate application of SSE is to cloud storage, where it enables a client to securely outsource its data to an untrusted cloud provider without sacrificing the ability to search over it. SSE has been the focus of active research and a multitude of schemes that achieve various levels of security and efficiency have been proposed. Any practical SSE scheme, however, should (at a minimum) satisfy the following properties: sublinear search time, security against adaptive chosen-keyword attacks, compact indexes and the ability to add and delete files efficiently. Unfortunately, none of the previously-known SSE constructions achieve all these properties at the same time. This severely limits the practical value of SSE and decreases its chance of deployment in real-world cloud storage systems. To address this, we propose the first SSE scheme to satisfy all the properties outlined above. Our construction extends the inverted index approach (Curtmola et al., CCS 2006) in several non-trivial ways and introduces new techniques for the design of SSE. In addition, we implement our scheme and conduct a performance evaluation, showing that our approach is highly efficient and ready for deployment.},
	keywords = {Cloud computing, cloud storage, searchable symmetric encryption},
	isbn = {978-1-4503-1651-4},
	url = {http://doi.acm.org/10.1145/2382196.2382298},
	author = {Kamara, Seny and Charalampos Papamanthou and Roeder, Tom}
}
