Hiding Traversal of Tree Structured Data from Untrusted Data Stores

Ping Lin, K. Selçuk Candan

Abstract

With the increasing use of web services, many new challenges concerning data security are becoming critical. Especially in mobile services, where clients are generally thin in terms of computation power and storage space, a remote server can be outsourced for the computation or can act as a data store. Unfortunately, such a data store may not always be trustworthy and clients with sensitive data and queries may want to be protected from malicious attacks. In this paper, we present a technique to hide tree structured data from potentially malicious data stores, while allowing clients to traverse the data to locate an object of interest without leaking information to the data store. The two motivating applications for this approach are hiding (1) tree-like XML data as well as XML queries that are in the form of tree-paths, and (2) tree-structured indexes and queries executed on such data structures. We show that this task is achievable through a one-server protocol which introduces only a limited and adjustable communication overhead. This is especially essential in low bandwidth (such as wireless) distributed environments. The proposed protocol has desirable communication and concurrency performance as demonstrated by the experiments we have conducted.

References

  1. Hacigümüs, H., Iyer, B.R., Li, C., & Mehrotra, S.(2002) Executing SQL over Encrypted Data in the Database-Service-Provider Model, Proceedings of 2002 ACM SIGMOD International Conference on Management of Data, Madison, Wisconsin, USA, June 3-6, 2002. pp. 216-227.
  2. Oracle Corp.,Database Security in Oracle8i, 1999. Retrieved Febuary 26, 2004, from http://otn.oracle.com/depoly/security/oracle8i/index.html.
  3. Smith, S. W., & Safford, D.(2001). Practical Server Privacy with Secure Coprocessors. IBM Systems Journal, Vol. 40, No. 3. pp.683-695.
  4. Chor, B., Goldreich, O., Kushilevitz, E., & Sudan, M.(1995). Private Information Retrieval, Proceeding of 36th IEEE Conference on the Foundations of Computer Sciences, Milwaukee, Wisconsin, USA, October 23-25, 1995. pp. 41-50.
  5. Bouganim, L., & Pucheral, P.(2002). Chip-secured Data Access: Con dencial Data on Untrusted Servers, Proceedings of 28th Very Large Data Bases Conference, Hongkong, China, 2002. pp.131-142.
  6. Bayer, R., & Schkolnich, M.(1977). Concurrency of Operations on B-Trees, Acta Informatica, Vol. 9, pp. 1-21.
  7. Mohan, C.(1996). Concurrency Control and Recovery Methods for B+-Tree Indexes: ARIES/KVL and ARIES/IM, In Kumar, V.(Ed.) Performance of Concurrency Control Mechanisms in Centralized Database Systems, Prentice-Hall 1996, pp. 248-306.
  8. Mohan, C.(2002). An Ef cient Method for Performing Record Deletions and Updates Using Index Scans, Proceedings of 28th Very Large Data Bases Conference, Hongkong, China, 2002.pp.940-949.
  9. Chor, B., Gilboa, N., & Naor, M.(1997). Private Information Retrieval by Keywords, Technical Report TR CS0917. Technion Israel, 1997.
Download


Paper Citation


in Harvard Style

Lin P. and Selçuk Candan K. (2004). Hiding Traversal of Tree Structured Data from Untrusted Data Stores . In Proceedings of the 2nd International Workshop on Security in Information Systems - Volume 1: WOSIS, (ICEIS 2004) ISBN 972-8865-07-4, pages 314-323. DOI: 10.5220/0002685203140323


in Bibtex Style

@conference{wosis04,
author={Ping Lin and K. Selçuk Candan},
title={Hiding Traversal of Tree Structured Data from Untrusted Data Stores},
booktitle={Proceedings of the 2nd International Workshop on Security in Information Systems - Volume 1: WOSIS, (ICEIS 2004)},
year={2004},
pages={314-323},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002685203140323},
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 - Hiding Traversal of Tree Structured Data from Untrusted Data Stores
SN - 972-8865-07-4
AU - Lin P.
AU - Selçuk Candan K.
PY - 2004
SP - 314
EP - 323
DO - 10.5220/0002685203140323