Efficient Tree Search in Encrypted Data

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

2004

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.

References

  1. Dawn Xiaodong Song, David Wagner, and Adrian Perrig. Practical techniques for searches on encrypted data. In IEEE Symposium on Security and Privacy, pages 44{55, 2000. http://citeseer.nj.nec.com/song00practical.html.
  2. Torsten Grust. Accelerating xpath location steps. In Proceedings of the 21st ACM International Conference on Management of Data (SIGMOD 2002), pages 109{120. ACM Press, Madison, Wisconsin, USA, June 2002. http://www.informatik.unikonstanz.de/»grust/¯les/xpath-accel.pdf.
  3. Torsten Grust, Maurice van Keulen, and Jens Teubner. Staircase join: Teach a relational dbms to watch its (axis) steps. In Proceedings of the 29th Int'l Conference on Very Large Databases (VLDB 2003), Berlin, Germany, Sep 2003. http://citeseer.nj.nec.com/593676.html.
  4. Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone. Handbook of Applied Cryptography. CRC Press, October 1996. http://www.cacr.math.uwaterloo.ca/hac/.
  5. A. Schmidt, F. Waas, M. Kersten, D. Florescu, I. Manolescu, M. Carey, and R. Busse. The xml benchmark project. Technical Report INS-R0103, CWI, April 2001. http://citeseer.ist.psu.edu/schmidt01xml.html.
  6. R. Brinkman, L. Feng, S. Etalle, P. H. Hartel, and W. Jonker. Experimenting with linear search in encrypted data. Technical report TR-CTIT-03-43, Centre for Telematics and Information Technology, Univ. of Twente, The Netherlands, Sep 2003. http://www.ub.utwente.nl/webdocs/ctit/1/000000d9.pdf.
Download


Paper Citation


in Harvard Style

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 - Volume 1: WOSIS, (ICEIS 2004) ISBN 972-8865-07-4, pages 126-135. DOI: 10.5220/0002664201260135


in Bibtex Style

@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 - Volume 1: WOSIS, (ICEIS 2004)},
year={2004},
pages={126-135},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002664201260135},
isbn={972-8865-07-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 2nd International Workshop on Security in Information Systems - Volume 1: WOSIS, (ICEIS 2004)
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