Authorization Translation for XML Document Transformation

  • Authors:
  • Somchai Chatvichienchai;Mizuho Iwaihara;Yahiko Kambayashi

  • Affiliations:
  • Department of Social Informatics, Kyoto University, Yoshida Sakyo, Kyoto, 606-8501, Japan somchai@db.soc.i.kyoto-u.ac.jp;Department of Social Informatics, Kyoto University, Yoshida Sakyo, Kyoto, 606-8501, Japan iwaihara@i.kyoto-u.ac.jp;Department of Social Informatics, Kyoto University, Yoshida Sakyo, Kyoto, 606-8501, Japan yahiko@i.kyoto-u.ac.jp

  • Venue:
  • World Wide Web
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

XML access control models proposed in the literature enforce access restrictions directly on the structure and content of an XML document. Therefore access authorization rules (authorizations, for short), which specify access rights of users on information within an XML document, must be revised if they do not match with changed structure of the XML document. In this paper, we present two authorization translation problems. The first is a problem of translating instance-level authorizations for an XML document. The second is a problem of translating schema-level authorizations for a collection of XML documents conforming to a DTD. For the first problem, we propose an algorithm that translates instance-level authorizations of a source XML document into those for a transformed XML document by using instance-tree mapping from the transformed document instance to the source document instance. For the second problem, we propose an algorithm that translates value-independent schema-level authorizations of non-recursive source DTD into those for a non-recursive target DTD by using schema-tree mapping from the target DTD to the source DTD. The goal of authorization translation is to preserve authorization equivalence at instance node level of the source document. The XML access control models use path expressions of XPath to locate data in XML documents. We define property of the path expressions (called node-reducible path expressions) that we can transform schema-level authorizations of value-independent type by schema-tree mapping. To compute authorizations on instances of schema elements of the target DTD, we need to identify the schema elements whose instances are located by a node-reducible path expression of a value-independent schema-level authorization. We give an algorithm that carries out path fragment containment test to identify the schema elements whose instances are located by a node-reducible path expression.