XFlat: Query-friendly encrypted XML view publishing

  • Authors:
  • Jun Gao;Tengjiao Wang;Dongqing Yang

  • Affiliations:
  • Department of Computer Science, Peking University of P.R. China, 5 Yihe street, Beijing 100871, PR China;Department of Computer Science, Peking University of P.R. China, 5 Yihe street, Beijing 100871, PR China;Department of Computer Science, Peking University of P.R. China, 5 Yihe street, Beijing 100871, PR China

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2008

Quantified Score

Hi-index 0.07

Visualization

Abstract

The security of published XML data receives exceptional attention due to its sensitive nature in many applications. This paper proposes an XML view publishing method called XFlat. Compared with other methods, XFlat focuses on query performance over the published XML view while simultaneously protecting the sensitive data via encryption techniques. XFlat decomposes an XML tree into a set of sub-trees, in each of which multiple users have the same accessibility to all nodes, and may encrypt and store each sub-tree in a flat, sequential manner. This storage strategy can avoid the nested encryption cost in view construction and the nested decryption cost in query evaluation. In addition, we discuss how to generate a user-specific schema and how to minimize the total space cost of the published XML view when considering the overhead of the relationships among the sub-trees. We also propose an XML schema index to enhance query performance over the final XML view. The experimental results demonstrate the effectiveness and efficiency of the proposed XFlat method.