Affiliations: [a] Department of Computer Science, New Jersey Institute of Technology, Newark, NJ, USA. E-mail: crix@njit.edu | [b] AT&T Labs – Research, Florham Park, NJ, USA. E-mail: garay@research.att.com | [c] Microsoft Research, Redmond, WA, USA. E-mail: senyk@microsoft.com | [d] Department of Computer Science, UCLA, Los Angeles, CA, USA. E-mail: rafail@cs.ucla.edu
Abstract: Searchable symmetric encryption (SSE) allows a party to outsource the storage of his data to another party in a private manner, while maintaining the ability to selectively search over it. This problem has been the focus of active research and several security definitions and constructions have been proposed. In this paper we begin by reviewing existing notions of security and propose new and stronger security definitions. We then present two constructions that we show secure under our new definitions. Interestingly, in addition to satisfying stronger security guarantees, our constructions are more efficient than all previous constructions. Further, prior work on SSE only considered the setting where only the owner of the data is capable of submitting search queries. We consider the natural extension where an arbitrary group of parties other than the owner can submit search queries. We formally define SSE in this multi-user setting, and present an efficient construction.
