EEMCS

Full text available as:

PDF - Univ. of Twente only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 220 Kb

Official URL: http://dx.doi.org/10.1007/978-3-642-15546-8_7

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.
Fulltext Preview

Export this item as:

• BibTeX
• XML

To request a copy of the PDF please email us request copy

To correct this item please ask your editor

Repository Staff Only: edit this item