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.Category / Keywords: secret-key cryptography / searchable symmetric encryption, cloud computing, cloud storage Publication Info: Full version of a paper to be published in ACM CCS 2012 Date: received 7 Sep 2012, last revised 8 Sep 2012 Contact author: throeder at microsoft com Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation Version: 20120908:161455 (All versions of this report) Short URL: ia.cr/2012/530 Discussion forum: Show discussion | Start new discussion