Efficient Dynamic Searchable Encryption with Forward Privacy
Open Access
- 1 January 2018
- journal article
- research article
- Published by Privacy Enhancing Technologies Symposium Advisory Board in Proceedings on Privacy Enhancing Technologies
- Vol. 2018 (1) , 5-20
Abstract
Searchable symmetric encryption (SSE) enables a client to perform searches over its outsourced encrypted files while preserving privacy of the files and queries. Dynamic schemes, where files can be added or removed, leak more information than static schemes. For dynamic schemes, forward privacy requires that a newly added file cannot be linked to previous searches. We present a new dynamic SSE scheme that achieves forward privacy by replacing the keys revealed to the server on each search. Our scheme is efficient and parallelizable and outperforms the best previous schemes providing forward privacy, and achieves competitive performance with dynamic schemes without forward privacy. We provide a full security proof in the random oracle model. In our experiments on the Wikipedia archive of about four million pages, the server takes one second to perform a search with 100,000 results.Keywords
All Related Versions
This publication has 25 references indexed in Scilit:
- ∑oφoς2016
- Leakage-Abuse Attacks Against Searchable Encryption2015
- On the Difficulty of Securing Web Applications Using CryptDB2014
- Distributed Searchable Symmetric Encryption2014
- Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation2014
- Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries2013
- On distributing load in cloud computing: A real application for very-large image datasetsProcedia Computer Science, 2010
- Structured Encryption and Controlled Disclosure2010
- Privacy Preserving Keyword Searches on Remote Encrypted Data2005
- Public Key Encryption with Keyword Search2004