EEMCS EPrints Service
Brinkman, R. and Feng, Ling and Doumen, J.M. and Hartel, P.H. and Jonker, W. (2004) Efficient Tree Search in Encrypted Data. Information Systems Security Journal, 13 (3). pp. 14-21. ISSN 1065-898X
This is the latest version of this eprint.
Full text available as:
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.
Available Versions of this Item
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item