Sedghi, S. and Doumen, J.M. and Hartel, P.H. and Jonker, W.
Towards an Information Theoretic Analysis of Searchable Encryption (Extended Version).
Technical Report TR-CTIT-08-50,
Centre for Telematics and Information Technology University of Twente, Enschede.
There is a more recent version of this eprint available. Click here to view it.
Full text available as:
Searchable encryption is a technique that allows a client to store
data in encrypted form on a curious server, such that data can be
retrieved while leaking a minimal amount of information to the
server. Many searchable encryption schemes have been proposed and
proved secure in their own computational model. In this paper we
propose a generic model for the analysis of searchable
encryptions. We then identify the security parameters of
searchable encryption schemes and prove information theoretical
bounds on the security of the parameters. We argue that perfectly
secure searchable encryption schemes cannot be efficient. We
classify the seminal schemes in two categories: the schemes that
leak information upfront during the storage phase, and schemes
that leak some information at every search. This helps designers
to choose the right scheme for an application.
|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|
|Deposited On:||05 August 2008|
Available Versions of this Item
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item