Efficient Tree Search in Encrypted Data

Brinkman, R. and Feng, L. and Doumen, J.M. and Hartel, P.H. and Jonker, W. (2004) Efficient Tree Search in Encrypted Data. In: Proceedings of the 2nd International Workshop on Security In Information Systems (WOSIS), 13-14 Apr 2004, Porto, Portugal.

Preview

PDF
359Kb

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:	Conference or Workshop Item
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Distributed and Embedded Systems (DIES) Databases (DB)
Link to this item:	http://purl.utwente.nl/publications/65546
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page