EEMCS

Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Search
 Organisation

EEMCS EPrints Service


1734 Efficient Tree Search in Encrypted Data
Home Policy Brochure Browse Search User Area Contact Help

Brinkman, R. and Feng, Ling 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. pp. 126-135. INSTICC Press. ISBN 972-8865-07-4

Full text available as:

PDF

360 Kb
Open Access


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 Paper (Full Paper, Talk)
Research Group:EWI-DIES: Distributed and Embedded Security, EWI-DB: Databases
Research Program:CTIT-ISTRICE: Integrated Security and Privacy in a Networked World
Research Project:Secure Meta Data: Secure Content Management In Ambient Environments
Additional Information:Imported from EWI/DB PMS [db-utwente:inpr:0000003563]
ID Code:1734
Status:Published
Deposited On:17 April 2006
Refereed:Yes
International:Yes
More Information:statistics

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item