Towards an Information Theoretic Analysis of Searchable Encryption

S. Sedghi, J.M. Doumen, Pieter H. Hartel, Willem Jonker

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

5 Citations (Scopus)
42 Downloads (Pure)

Abstract

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.
Original languageEnglish
Title of host publication10th international conference on information and communication security
Place of PublicationBerlin
PublisherSpringer
Pages345-360
Number of pages24
ISBN (Print)978-3-540-88624-2
DOIs
Publication statusPublished - 22 Oct 2008
Event10th International Conference on Information and Communications Security, ICICS 2008 - Hyatt Regency, Birmingham, United Kingdom
Duration: 20 Oct 200822 Oct 2008
Conference number: 10
http://events.cs.bham.ac.uk/icics08/

Publication series

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

Conference

Conference10th International Conference on Information and Communications Security, ICICS 2008
Abbreviated titleICICS
CountryUnited Kingdom
CityBirmingham
Period20/10/0822/10/08
Internet address

Keywords

  • EWI-13866
  • IR-62495
  • METIS-252082
  • SCS-Cybersecurity

Fingerprint Dive into the research topics of 'Towards an Information Theoretic Analysis of Searchable Encryption'. Together they form a unique fingerprint.

  • Cite this

    Sedghi, S., Doumen, J. M., Hartel, P. H., & Jonker, W. (2008). Towards an Information Theoretic Analysis of Searchable Encryption. In 10th international conference on information and communication security (pp. 345-360). (Lecture Notes in Computer Science; Vol. 5308, No. 1). Berlin: Springer. https://doi.org/10.1007/978-3-540-88625-9_23