Efficient tree search in encrypted data

Information Systems Security

Volumn 13, Issue 3, 2004, Pages 14-21

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

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33646148384     PISSN: 1065898X     EISSN: None     Source Type: Journal    
DOI: 10.1201/1086/44530.13.3.20040701/83065.3     Document Type: Article

References (6)

1. Dawn Xiaodong Song, David Wagner, and Adrian Perrig. Practical techniques for searches on encrypted data. In Proceedings of the IEEE Symposium on Security and Privacy, 2000, 44-55. 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), ACM, Madison, WI, USA, June 2002, 109-120. http://www.informatik.uni-konstanz. de/~grust/files/xpath-accel.pdf.
3. Torsten Grust, Maurice van Keulen, and Jens Teubner. Staircasejoin: Teach a relational DBMS to watch its (axis) steps. In Proceedings of the 29th International Conference on Very Large Databases (VLDB 2003), Berlin, Germany, September 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, Boca Raton, FL, 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. Available at 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, University of Twente, The Netherlands, September 2003. http://www.ub.utwente.nl/webdocs/ctit/1/000000d9.pdf. http://www.xml-benchmark.org.