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 language | English |
|---|---|
| Pages | 126-135 |
| Number of pages | 10 |
| Publication status | Published - Apr 2004 |
| Event | 2nd International Workshop on Security In Information Systems, WOSIS 2004 - Porto, Portugal Duration: 14 Apr 2004 → 17 Apr 2004 Conference number: 2 |
Conference
| Conference | 2nd International Workshop on Security In Information Systems, WOSIS 2004 |
|---|---|
| Abbreviated title | WOSIS |
| Country | Portugal |
| City | Porto |
| Period | 14/04/04 → 17/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.