Sedghi, S. and van Liesdonk, P. and Doumen, J.M. and Hartel, P.H. and Jonker, W.
Adaptively Secure Computationally Efficient Searchable Symmetric Encryption.
Technical Report TR-CTIT-09-13,
Centre for Telematics and Information Technology University of Twente, Enschede.
Full text available as:
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
|Item Type:||Internal Report (Technical Report)|
|Research Group:||EWI-DIES: Distributed and Embedded Security, EWI-DB: Databases|
|Research Program:||CTIT-ISTRICE: Integrated Security and Privacy in a Networked World|
|Research Project:||SEDAN: Searchable Data Encryption|
|Uncontrolled Keywords:||Searchable Encryption, Efficient Search, Efficient Update|
|Deposited On:||29 April 2009|
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item