Adaptively Secure Computationally Efficient Searchable Symmetric Encryption

Share/Save/Bookmark

Sedghi, S. and Liesdonk, P. van and Doumen, J.M. and Hartel, P.H. and Jonker, W. (2009) Adaptively Secure Computationally Efficient Searchable Symmetric Encryption. [Report]

open access
[img]
Preview
PDF
237kB
Abstract:Searchable encryption is a technique that allows a client to store documents on a server in encrypted form. Stored documents can be retrieved selectively while revealing as little information as
possible to the server. In the symmetric searchable encryption domain, the storage and the retrieval are performed by the same client. Most conventional searchable encryption schemes suffer
from two disadvantages.
First, searching the stored documents takes time linear in the size of the database, and/or uses heavy arithmetic operations.
Secondly, the existing schemes do not consider adaptive attackers;
a search-query will reveal information even about documents stored
in the future. If they do consider this, it is at a significant
cost to updates.
In this paper we propose a novel symmetric searchable encryption
scheme that offers searching at constant time in the number of
unique keywords stored on the server. We present two variants of
the basic scheme which differ in the efficiency of search and
update. We show how each scheme could be used in a personal health
record system.
Item Type:Report
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/65475
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 263829