Efficient tree search in encrypted data

Share/Save/Bookmark

Brinkman, R. and Feng, L. and Doumen, J. and Hartel, P.H. and Jonker, W. (2004) Efficient tree search in encrypted data. [Report]

[img]
Preview
PDF
393Kb
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.
Item Type:Report
Copyright:© 2004 CTIT
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/57002
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page