Efficient Tree Search in Encrypted Data

Richard Brinkman, L. Feng, J.M. Doumen, Pieter H. Hartel, Willem Jonker

Research output: Book/ReportReportOther research output

14 Citations (Scopus)
117 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 languageUndefined
Place of PublicationEnschede
PublisherCentre for Telematics and Information Technology (CTIT)
Number of pages10
Publication statusPublished - Mar 2004

Publication series

NameCTIT technical report series
PublisherUniversity of Twente, Centre for Telematics and Information Technology (CTIT)


  • SCS-Cybersecurity
  • IR-57002
  • EWI-5789

Cite this