EEMCS EPrints Service

Education

Research

Prospective Students

Jobs

Publications

Intranet (internal)

Nederlands

Contact

Sitemap

Organisation

6896 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. Information Systems Security Journal, 13 (3). pp. 14-21. ISSN 1065-898X

This is the latest version of this eprint.

Full text available as:

PDF

- Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
502 Kb

Official URL: http://dx.doi.org/10.1201/1086/44530.13.3.20040701/83065.3

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:	Article
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 DIES, Update with import from EWI/DB PMS [db-utwente:arti:0000003755]
ID Code:	6896
Status:	Published
Deposited On:	19 October 2006
Refereed:	Yes
International:	Yes
More Information:	statistics

Available Versions of this Item

Efficient Tree Search in Encrypted Data (deposited 19 October 2006)
[Currently Displayed]

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item