Efficient Tree Search in Encrypted Data

Brinkman, R. and Feng, L. and Doumen, J. and Hartel, P.H. and Jonker, W. (2004) Efficient Tree Search in Encrypted Data. Information systems security, 13 (3). pp. 14-21. ISSN 1065-898X

PDF
Restricted to UT campus only: Request a copy
393Kb

Abstract:	In this article we propose a new protocol that is more suitable for handling large amounts of semistructured XML data. This new protocol exploits the XML tree structure. XPath queries can be answered quickly and securely.
Item Type:	Article
Copyright:	© 2004 EBSCO
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Distributed and Embedded Systems (DIES) Databases (DB)
Link to this item:	http://purl.utwente.nl/publications/48622
Official URL:	http://dx.doi.org/10.1201/1086/44530.13.3.20040701/83065.3
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Repository Staff Only: item control page

Metis ID: 220241