Dynamic Searchable Encryption via Blind Storage

By Muhammad Naveed, Manoj M. Prabhakaran, Carl A. Gunter. IEEE Symposium on Security and Privacy, 2014

337 citations recorded by the source corpus.

Dynamic Searchable Symmetric Encryption allows a client to store a dynamic collection of encrypted documents with a server, and later quickly carry out keyword searches on these encrypted documents, while revealing minimal information to the server. In this paper we present a new dynamic SSE scheme that is simpler and more efficient than existing schemes while revealing less information to the server than prior schemes, achieving fully adaptive security against honest-but-curious servers. We implemented a prototype of our scheme and demonstrated its efficiency on datasets from prior work. Apart from its concrete efficiency, our scheme is also simpler: in particular, it does not require the server to support any operation other than upload and download of data. Thus the server in our scheme can be based solely on a cloud storage service, rather than a cloud computation service as well, as in prior work. In building our dynamic SSE scheme, we introduce a new primitive called Blind Storage, which allows a client to store a set of files on a remote server in such a way that the server does not learn how many files are stored, or the lengths of the individual files, as each file is retrieved, the server learns about its existence (and can notice the same file being downloaded subsequently), but the file's name and contents are not revealed. This is a primitive with several applications other than SSE, and is of independent interest.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/9cd2f09c090933b20b9d910a84dde4a46885b3e7

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computer Vision and Pattern Recognition

Citations in the corpus

Blockchain based searchable encryption for electronic health record sharing (2019, methodology): “Such schemes include multi-keyword SSE schemes [4-7], dynamic SSE schemes [8-11] and verifiable SSE schemes [12-16].”
Path ORAM: an extremely simple oblivious RAM protocol (2012, neutral): “We ﬁrst describe the Path ORAM protocol with N/χ + O (log N ) · ω (1) blocks of client storage, and then later in Section 3.7 we explain how the client storage can be reduced to O (log 2 N/ log χ ) · ω (1) blocks via recursion.”
A Survey on IoT Security: Application Areas, Security Threats, and Solution Architectures (2019, background): “A dynamic symmetric search-able scheme is introduced in [167].”
All Your Queries Are Belong to Us: The Power of File-Injection Attacks on Searchable Encryption (2016, background): “In light of the above, researchers have focused on the development of novel SE schemes that are much more efficient, at the expense of allowing some information to “leak” to the server [19, 9, 8, 11, 6, 16, 12, 20, 13, 5].”
Security and Privacy in the Internet of Things (2017, background): “During the past decade, many provably secure SSE schemes [56, 147, 48, 94, 93, 118, 47, 81, 135] have been proposed, which make trade-offs among security, search performance and storage overhead by exploring static- [56, 147, 48] and dynamic datasets [94, 93, 118, 47, 81, 135] as well as various dat”
Securing Fog Computing for Internet of Things Applications: Challenges and Solutions (2018, background): “[169] introduced a new primitive called blind”