Tree Automata for Schema-level Filtering of XML Associations

Csilla Farkas

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Tree Automata for Schema-level Filtering of XML Associations

In Proceedings of the 3rd International Workshop on Security in Information Systems - Volume 0ICEIS, 298-308, 2005 , Miami, United States

Author: Csilla Farkas

Affiliation: University of South Carolina, United States

Abstract: In this paper we present query filtering techniques based on bottom-up tree automata for XML access control. In our authorization model (RXACL), RDF statements are used to represent security objects and to express the security policy. Our model allows to express and enforce access control on XML trees and their associations. We propose a query-filtering technique that evaluate XML queries to detect disclosure of association-level security objects. A query Q discloses a security object o iff the (tree) automata corresponding to o accepts Q. We show that our schema-level method detects all possible disclosures, i.e., it is complete.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.140.242.165

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Farkas, C. (2005). Tree Automata for Schema-level Filtering of XML Associations. In Proceedings of the 3rd International Workshop on Security in Information Systems (ICEIS 2005) - WOSIS; ISBN 972-8865-25-2, SciTePress, pages 298-308. DOI: 10.5220/0002575502980308

@conference{wosis05,
author={Csilla Farkas.},
title={Tree Automata for Schema-level Filtering of XML Associations},
booktitle={Proceedings of the 3rd International Workshop on Security in Information Systems (ICEIS 2005) - WOSIS},
year={2005},
pages={298-308},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002575502980308},
isbn={972-8865-25-2},
}

TY - CONF

JO - Proceedings of the 3rd International Workshop on Security in Information Systems (ICEIS 2005) - WOSIS
TI - Tree Automata for Schema-level Filtering of XML Associations
SN - 972-8865-25-2
AU - Farkas, C.
PY - 2005
SP - 298
EP - 308
DO - 10.5220/0002575502980308
PB - SciTePress