EEMCS EPrints Service
Bösch, C.T. and Peter, A. and Leenders, B. and Lim, Hoon Wei and Tang, Qiang and Wang, Huaxiong and Hartel, P.H. and Jonker, W. (2014) Distributed Searchable Symmetric Encryption. In: Twelfth Annual International Conference on Privacy, Security and Trust, PST 2014, 23-24 July 2014, Toronto, Canada. pp. 330-337. IEEE. ISBN 978-1-4799-3502-4
Full text available as:
Official URL: http://dx.doi.org/10.1109/PST.2014.6890956
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.
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item