By Topic

Information flow in a purpose-oriented access control model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
M. Yasuda ; Dept. of Comput. & Syst. Eng., Tokyo Denki Univ., Japan ; T. Tachikawa ; K. Takizawa

In distributed applications, a group of multiple objects are cooperating to achieve some objectives. An object is modeled as a pair of data structures and operations. Each object is manipulated through an operation supported by the object and then the operation may further invoke operations of other objects, i.e., nested operations. The purpose-oriented access rules indicate which operation on each object can invoke operations of other objects. The information flow among the objects occur if the requests and responses of the operations carry some data. Only the purpose-oriented access rules which imply the legal information flow are allowed. We discuss how to test the access rules if the information flow occurring in the nested invocation of the operations is legal

Published in:

Parallel and Distributed Systems, 1997. Proceedings., 1997 International Conference on

Date of Conference:

10-13 Dec 1997