Selective Document Retrieval from Encrypted Database

C.T. Bösch, Qiang Tang, Pieter H. Hartel, Willem Jonker

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

19 Citations (Scopus)
182 Downloads (Pure)


We propose the concept of selective document retrieval (SDR) from an encrypted database which allows a client to store encrypted data on a third-party server and perform efficient search remotely. We propose a new SDR scheme based on the recent advances in fully homomorphic encryption schemes. The proposed scheme is secure in our security model and can be adapted to support many useful search features, including aggregating search results, supporting conjunctive keyword search queries, advanced keyword search, search with keyword occurrence frequency, and search based on inner product. To evaluate the performance, we implement the search algorithm of our scheme in C. The experiment results show that a search query takes only 47 seconds in an encrypted database with 1000 documents on a Linux server, and it demonstrates that our scheme is much more efficient, i.e., around 1250 times faster, than a solution based on the SSW scheme with similar security guarantees.
Original languageUndefined
Title of host publication15th International Conference on Information Security (ISC)
Place of PublicationBerlin
Number of pages18
ISBN (Print)978-3-642-33383-5
Publication statusPublished - Sep 2012
Event15th International Conference on Information Security, ISC 2012 - Passau, Germany
Duration: 19 Sep 201221 Sep 2012
Conference number: 15

Publication series

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


Conference15th International Conference on Information Security, ISC 2012
Abbreviated titleISC


  • METIS-287907
  • IR-80856
  • Searchable Encryption
  • EWI-22012
  • Privacy
  • SCS-Cybersecurity
  • DIES-Data Security
  • Homomorphic Encryption

Cite this