[en] Searchable Symmetric Encryption (SSE) allows a client to store encrypted data on a storage provider in such a way, that the client is able to search and retrieve the data selectively without the storage provider learning the contents of the data or the words being searched for. Practical SSE schemes usually leak (sensitive) information during or after a query (e.g., the search pattern). Secure schemes on the other hand are not practical, namely they are neither efficient in the computational search complexity, nor scalable with large data sets. To achieve efficiency and security at the same time, we introduce the concept of distributed SSE (DSSE), which uses a query proxy in addition to the storage provider. We give a construction that combines an inverted index approach (for efficiency) with scrambling functions used in private information retrieval (PIR) (for security). The proposed scheme, which is entirely based on XOR operations and pseudo-random functions, is efficient and does not leak the search pattern. For instance, a secure search in an index over one million documents and 500 keywords is executed in less than 1 second.
Disciplines :
Computer science
Author, co-author :
Bosch
Peter, Andreas
Leenders, Bram
Lim, Hoon Wei
TANG, Qiang ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
Wang, Huaxiong
Hartel, Pieter
Jonker, Willem
Language :
English
Title :
Distributed Searchable Symmetric Encryption
Publication date :
2014
Event name :
PST2014 International Conference on Privacy, Security and Trust
Event date :
23-07-2014 to 24-07-2014
Audience :
International
Main work title :
PST2014 International Conference on Privacy, Security and Trust
scite shows how a scientific paper has been cited by providing the context of the citation, a classification describing whether it supports, mentions, or contrasts the cited claim, and a label indicating in which section the citation was made.
Bibliography
Similar publications
Sorry the service is unavailable at the moment. Please try again later.