UWA Logo
  Faculty Home | School Home | Internal Page | Awesome Animations   
           
Home
About the School
Contact and People
Future Undergraduate Students
Prospective Postgraduates
Current Students
Current Postgraduates
Research
Research Areas Research Areas Research Areas
Research Seminars Research Seminars Research Seminars
20082008 2008 2008
20072007 2007 2007
20062006 2006 2006
20052005 2005 2005
20042004 2004 2004
20032003 2003 2003
20022002 2002 2002
20012001 2001 2001
20002000 2000 2000
19991999 1999 1999
19981998 1998 1998
School Research Conferences School Research Conferences School Conferences
Tech Reports Tech Reports Tech Reports
Distinguished Visitors Distinguished Visitors Distinguished Visitors
Research Opportunities for Students Research Opportunities for Students Research Opportunities ...
Research Project Suggestions Research Project Suggestions Research Project Sugges...
IT News
Awards
Industry Links and Prizes
School and IT Information
Other
Internal Information

Research Seminar - December 13, 2000

Seminar Announcement


Title: The DOK Security Service:
Principles, Concepts, and Architecture
Speaker: Dr Zahir Tari
  Associate Professor
Department of Computer Science, RMIT
Date: Wednesday 13th December, 2000
Time: 3.00pm
Venue: Seminar Room 1.24

Abstract

The Distributed Object Kernel (DOK) is an extension of a CORBA system to provide data-oriented services. In this talk I will overview some of the DOK elements, such as the architecture and services. However, the main focus of this talk will be on the DOK security service. One of the hard problems we have had to address is the aggregation/inference problem. This problem typically arises whenever a collection of data has a classification strictly greater than that of the individual data forming the aggregate. The proposed solution can be summarised as follows:
  • To model a variety of types of aggregation constraints, we propose a temporal logic language which enables the description of both constraints on a single state of a federation (static constraints) as well as those over multiple states (dynamic constraints).
  • To enforce aggregation constraints, state transition graphs are generated to model the different sub-computations related to the different parts of the constraints. Graph aggregation operations are also proposed to build state transition graphs for complex constraints.
  • Finally, to monitor aggregation constraints, two marking techniques called LMT (Linear Marking Technique) and ZMT (Zigzag Marking Technique) are presented. These techniques enable the marking of the nodes in state transition graphs based on the past and present states of a federation.
Top of Page