Nederlands
Contact
Sitemap
Search
OrganisationEEMCS 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.
Technical Report TR-CTIT-04-15,
Centre for Telematics and Information Technology University of Twente, Enschede.
ISSN 1381-3625
Full text available as:
Official URL: http://www.ub.utwente.nl/webdocs/ctit/1/000000f3.pdf AbstractSometimes 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.
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item |
|
|
||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||
