Fujipress Home | Search | About FINDER

Paper:
Language: English:

An Efficient Authorization Mechanism for Secure XML Sources on the Web


Sun-Moon Jo* and Weon-Hee Yoo**


*Department of Computer Information Technology Education, Paichai University, 439-6 Doma-2Dong, Seo-Gu, Daejeon, Korea
**Department of Computer Science and Information Engineering, Inha University, 253 Yonghyun-Dong, Nam-Gu, Incheon, Korea


Received: October 28, 2005

Accepted: March 17, 2006


Keywords: XML document, authorization rule, XML security, subject, object

Journal ref: Journal of Advanced Computational Intelligence and Intelligent Informatics, Vol.10, No.5 pp. 721-727, 2006

Abstract



XML-based access control technology aims at providing an authorization policy that can be consistently applied to various products for access control services on Internet and different kinds of environment for the products and thus providing interoperability to the existing access control products with diverse kinds of environment and types. The existing access control fails to consider information structure and semantics sufficiently due to the fundamental limitations of HTML. In addition, XML document access control supplies only action read and permits alterations of very limited value for action write. The existing access control has disadvantages that DOM tree should be loaded on memory while all XML documents are parsed to generate DOM tree; that a lot of memory is used in repetitive search for tree to authorize access to all nodes in DOM tree; and that the complex authorization evaluation process may lower system performance. In this paper, we present an authorization mechanism for secure XML sources on the Web.
preview Preview (PDF)  full text Full Text (PDF 227KB)

Reference

[Notice]
* "Preview" is the first 2 pages of the article. You don't need the registration.
* To read the PDF file you will then need to download and install the Adobe Reader.
Adobe Reader is free and available for download here:

adobe reader

Terms and Conditions | Privacy Policy | Recruit | Advertising Information | Contact Us