Efficient Tree Search in Encrypted Data

R. Brinkman, L. Feng, J. Doumen, P.H. Hartel, W. Jonker

Research output: Contribution to journalArticleAcademicpeer-review

123 Downloads (Pure)


Sometimes there is a need to store sensitive data on an untrusted database server. Song Wagner and Perrig have introduced a way to search for the existence of a word in an encrypted textual document. The search speed is linear in the size of the document. It does not scale well for a large database. We have developed a tree search algorithm based on the linear search algorithm that is suitable for XML databases. It is more efficient since it exploits the structure of XML. We have built prototype implementations for both the linear and the tree search case. Experiments show a major improvement in search time.
Original languageEnglish
Pages (from-to)14-21
Number of pages8
JournalInformation systems security
Issue number3
Publication statusPublished - Jul 2004


  • SCS-Cybersecurity


Dive into the research topics of 'Efficient Tree Search in Encrypted Data'. Together they form a unique fingerprint.

Cite this