Title
Computationally efficient searchable symmetric encryption
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 the performance of 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 storage. We show how each scheme could be used in a personal health record system.
Year
Venue
Keywords
2010
Secure Data Management
stored document,computationally efficient searchable symmetric,existing scheme,basic scheme,novel symmetric searchable encryption,adaptive attacker,encrypted form,constant time,symmetric searchable encryption domain,searchable encryption,conventional searchable encryption scheme,symmetric encryption
Field
DocType
Volume
Multiple encryption,Client-side encryption,Computer science,Encryption,40-bit encryption,Probabilistic encryption,Filesystem-level encryption,On-the-fly encryption,Database,56-bit encryption
Conference
6358
ISSN
ISBN
Citations 
0302-9743
3-642-15545-6
26
PageRank 
References 
Authors
1.51
14
5
Name
Order
Citations
PageRank
Peter Van Liesdonk1522.39
Saeed Sedghi2644.52
Jeroen Doumen332621.84
Pieter Hartel41159115.28
Willem Jonker564055.71