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 |
|---|---|
| Place of Publication | Enschede |
| Publisher | Centre for Telematics and Information Technology (CTIT) |
| Number of pages | 10 |
| Publication status | Published - Mar 2004 |
Publication series
| Name | CTIT technical report series |
|---|---|
| Publisher | University of Twente, Centre for Telematics and Information Technology (CTIT) |
| No. | TR-CTIT-04-15 |
| ISSN (Print) | 1381-3625 |
Keywords
- SCS-Cybersecurity
Fingerprint
Dive into the research topics of 'Efficient Tree Search in Encrypted Data'. Together they form a unique fingerprint.-
Efficient Tree Search in Encrypted Data
Brinkman, R., Feng, L., Doumen, J. M., Hartel, P. H. & Jonker, W., Apr 2004, p. 126-135. 10 p.Research output: Contribution to conference › Paper › peer-review
Open AccessFile -
Efficient Tree Search in Encrypted Data
Brinkman, R., Feng, L., Doumen, J., Hartel, P. H. & Jonker, W., Jul 2004, In: Information Systems Security. 13, 3, p. 14-21 8 p.Research output: Contribution to journal › Article › Academic › peer-review
Open AccessFile200 Downloads (Pure)
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver