Efficient Tree Search in Encrypted Data

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

Research output: Contribution to conferencePaper

58 Downloads (Pure)

Abstract

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
Pages126-135
Number of pages10
Publication statusPublished - Apr 2004
Event2nd International Workshop on Security In Information Systems, WOSIS 2004 - Porto, Portugal
Duration: 14 Apr 200417 Apr 2004
Conference number: 2

Conference

Conference2nd International Workshop on Security In Information Systems, WOSIS 2004
Abbreviated titleWOSIS
CountryPortugal
CityPorto
Period14/04/0417/04/04

Keywords

  • IR-65546
  • SCS-Cybersecurity
  • DB-SDM: SECURE DATA MANAGEMENT
  • EWI-1734

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

  • Cite this

    Brinkman, R., Feng, L., Doumen, J. M., Hartel, P. H., & Jonker, W. (2004). Efficient Tree Search in Encrypted Data. 126-135. Paper presented at 2nd International Workshop on Security In Information Systems, WOSIS 2004, Porto, Portugal.