Computationally efficient searchable symmetric encryption

P.P. Liesdonk, van, S. Sedghi, J.M. Doumen, P.H. Hartel, W. Jonker

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

128 Citaten (Scopus)
7 Downloads (Pure)


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.
Originele taal-2Engels
TitelSecure Data Management (7th VLDB workshop, SDM 2010, Singapore, September 17, 2010. Proceedings)
RedacteurenW. Jonker, M. Petkovic
Plaats van productieBerlin
ISBN van geprinte versie978-3-642-15545-1
StatusGepubliceerd - 2010

Publicatie series

NaamLecture Notes in Computer Science
ISSN van geprinte versie0302-9743


Duik in de onderzoeksthema's van 'Computationally efficient searchable symmetric encryption'. Samen vormen ze een unieke vingerafdruk.

Citeer dit