Efficient Tree Search in Encrypted Data

R. Brinkman; L. Feng; J. Doumen; P. H. Hartel; W. Jonker

Research.Publish.Connect.

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Efficient Tree Search in Encrypted Data

In Proceedings of the 2nd International Workshop on Security in Information Systems - Volume 0ICEIS, 126-135, 2004 , Porto, Portugal

Authors: R. Brinkman ; L. Feng ; J. Doumen ; P. H. Hartel and W. Jonker

Affiliation: University of Twente, Netherlands

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.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 18.118.200.197

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Brinkman, R.; Feng, L.; Doumen, J.; H. Hartel, P. and Jonker, W. (2004). Efficient Tree Search in Encrypted Data. In Proceedings of the 2nd International Workshop on Security in Information Systems (ICEIS 2004) - WOSIS; ISBN 972-8865-07-4, SciTePress, pages 126-135. DOI: 10.5220/0002664201260135

@conference{wosis04,
author={R. Brinkman. and L. Feng. and J. Doumen. and P. {H. Hartel}. and W. Jonker.},
title={Efficient Tree Search in Encrypted Data},
booktitle={Proceedings of the 2nd International Workshop on Security in Information Systems (ICEIS 2004) - WOSIS},
year={2004},
pages={126-135},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002664201260135},
isbn={972-8865-07-4},
}

TY - CONF

JO - Proceedings of the 2nd International Workshop on Security in Information Systems (ICEIS 2004) - WOSIS
TI - Efficient Tree Search in Encrypted Data
SN - 972-8865-07-4
AU - Brinkman, R.
AU - Feng, L.
AU - Doumen, J.
AU - H. Hartel, P.
AU - Jonker, W.
PY - 2004
SP - 126
EP - 135
DO - 10.5220/0002664201260135
PB - SciTePress