Computationally Efficient Searchable Symmetric Encryption

Peter van Liesdonk, S. Sedghi, J.M. Doumen, Pieter H. Hartel

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

127 Citations (Scopus)


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
Original languageUndefined
Title of host publicationProceedings of the Seventh International Workshop on Secure Data Management, SDM 2010
EditorsWillem Jonker, M. Petkovic
Place of PublicationBerlin
Number of pages14
ISBN (Print)978-3-642-15545-1
Publication statusPublished - 17 Sep 2010
Event7th VLDB Workshop on Secure Data Management, SDM 2010 - Singapore
Duration: 17 Sep 201017 Sep 2010

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Verlag
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Workshop7th VLDB Workshop on Secure Data Management, SDM 2010
Other17 Sep 2010


  • METIS-271132
  • SCS-Cybersecurity
  • EWI-18809
  • IR-74619

Cite this