Mandatory Flow Control - PowerPoint PPT Presentation

1 / 21
About This Presentation
Title:

Mandatory Flow Control

Description:

Title: PowerPoint Presentation Last modified by: ajena Created Date: 1/1/1601 12:00:00 AM Document presentation format: On-screen Show (4:3) Other titles – PowerPoint PPT presentation

Number of Views:78
Avg rating:3.0/5.0
Slides: 22
Provided by: gsu108
Learn more at: https://www.cs.gsu.edu
Category:

less

Transcript and Presenter's Notes

Title: Mandatory Flow Control


1
Mandatory Flow Control
  • Bismita Srichandan

2
Outline
  • Mandatory Flow Control Models
  • Information Flow Control
  • Lattice Model
  • Multilevel Models
  • The Bell-LaPadula Model
  • The Biba Model

3
Mandatory Flow Control Models
  • Definition
  • Mandatory access control refers to a type of
    access control by which the operating system
    constrains the ability of a subject or initiator
    to access or generally perform some sort of
    operation on an object or target.
  • Why is it necessary since we have discretionary
    security model?
  • With the advances in networks and distributed
    systems, it is necessary to broaden the scope to
    include the control of information flow between
    distributed nodes on a system wide basis rather
    than only individual basis like discretionary
    control.

4
Difference between Discretionary and Mandatory
access control 5
  • Mandatory access control, this security policy is
    centrally controlled by a security policy
    administrator users do not have the ability to
    override the policy and, for example, grant
    access to files that would otherwise be
    restricted.
  • By contrast, discretionary access control (DAC),
    which also governs the ability of subjects to
    access objects, allows users the ability to make
    policy decisions and/or assign security
    attributes.

5
The major problem with the Access Control Matrix
Model
  • Confinement problem How to determine whether
    there is any mechanism by which a subject
    authorized to access an object may leak
    information contained in that object to some
    other subjects not authorized to access that
    object.
  • Another disadvantage is that no semantics of
    information in the objects are considered thus
    the security sensitivity of an object is hardly
    expressed by that model.

6
Information Flow Control Chow et al
  • Definition
  • Information Flow control is concerned with how
    information is disseminated or propagated from
    one object to another.
  • System entities are partitioned into security
    classes
  • The security classes of all entities must be
    specified explictly and the class of an entity
    seldom changes after it has been created( changes
    sometimes made by the system administration)

7
The Lattice Model
  • The best-known Information Flow Model
  • Based upon the concept of lattice whose
    mathematical meaning is a structure consisting of
    a finite partially ordered set together with a
    least upper bound and greatest lower bound
    operator on the set.
  • Lattice is a Directed Acyclic Graph(DAG) with a
    single source and sink.
  • Information is permitted to flow from a lower
    class to upper class.

8
The lattice model (continued)
9
The lattice model (continued)
  • This satisfies the definition of lattice. There
    is a single source and sink.
  • The least upper bound of the security classes x
    and z is x,z and the greatest lower bound of
    the security classes x,y and y,z is y.

10
Flow Properties of a Lattice
  • The relation ? is reflexive, transitive and
    antisymmetric for all A,B,C ? SC.
  • Reflexive A ? A
  • Information flow from an object to another object
    at the same class does not violate security.
  • Transitive A ? B and B ? C implies A ? C .
  • This indicates that a valid flow does not
    necessarily occur between two classes adjacent to
    each other in the partial ordering
  • Antisymmetric A ? B and B ? A implies AB
  • If information can flow back and forth between
    two objects, they must have the same classes

11
Flow Properties of a Lattice (Contd..)
  • Two other inherent properties are as follows
  • Aggregation A ? C and B ? C implies A U B ? C
  • If information can flow from both A and B to C ,
    the information aggregate of A and B can flow to
    C.
  • Separation A U B ? C implies A ? C and B ? C
  • If the information aggregate of A and B can flow
    to C ,information can flow from either A or B to
    C

12
Multilevel Security
  • Multilevel Security is a special case of the
    lattice-based information flow model. There are
    two well-known multilevel security models
  • The Bell-LaPadula Model Focuses on
    confidentiality of information
  • The Biba Model Focuses on system integrity

13
The Bell-LaPadula Model Chow et al
  • L is a linearly ordered set of security levels
  • C is a lattice of security categories
  • The security class assigned to a subject or an
    object includes two components a hierarchical
    security level and a nonhierarchical security
    category.
  • The security level is called the clearance if
    applied to subjects, and classification if
    applied to objects.
  • Each security category is a set of compartments
    that represent natural or artificial
    characteristics of subjects and objects and is
    used to enforce the need-to-know principle.

14
The Bell-LaPadula Model contd
  • Need-to-know principle A subject is given access
    only to the objects that it requires to perform
    its jobs.
  • The lattice of security classes is L C. If AB ?
    SC, A dominates B if As level is higher than Bs
    level and Bs category is a subset of As
    category.

15
The Bell-LaPadula Model contd
  • Security with respect to confidentiality in the
    Bell-LaPadula model is described by the following
    two axioms
  • Simple security property Reading information
    from an object o by a subject s requires that
    SC(s) dominates SC(o) no read up).
  • The -property Writing information to an object
    o by a subject s requires that SC(o) dominates
    SC(s).
  • Note In property , information cannot be
    compromised by exercising a Trojan Horse
    program(A code segment that misuses its
    environment is called a Trojan Horse).
  • Example of Trojan Horse Email attachments

16
The Biba Model
  • Contrary to Bell-LaPadula model, in Biba model
    information can only flow from a higher integrity
    class to a lower integrity class.
  • L is a linearly ordered set of integrity levels
  • C is a lattice of integrity categories
  • Integrity levels form a linear lattice in which
    each level represents the classification of
    integrity of information an object can contain or
    the clearance of a subject for modifying an
    object.
  • Integrity categories form a subset lattice and
    are used to enforce the need-to-have principle.
  • The lattice of security classes is L C.

17
The Biba Model contd
  • Security with respect to integrity in the Biba
    model is described by the following two axioms
  • Simple security property Writing information to
    an object o by a subject s requires that SC(s)
    dominates SC(o) (no write up).
  • The-property Reading information from an object
    o by a subject s requires that SC(o) dominates
    SC(s) ( no read down).

18
Comparison of two Multilevel Models
  • The Bell-LaPadula Model is concerned with
    information confidentiality
  • subjects reading from an object must have higher
    a security class than the object.
  • objects being written to by a subject must have
    higher security class than the subject.
  • The Biba model emphasizes information integrity
  • subjects writing information to an object must
    have higher a security class than the object.
  • objects being read from by a subject must have
    higher security class than the subject.

19
Security Analysis of Mandatory Access Control
ModelIEEE conference 2004
  • This paper gives a very good idea on how
    Mandatory Access Control model (MAC) security is
    described by Colored Petri Nets (CPN).
  • Petri net, as a formal tool, is well suited to
    describe discrete processes and can efficiently
    analyze the system concurrency, indeterminacy,
    and asynchronism.

20
Database SecurityConcepts,Approaches, and
ChallengesIEEE transaction 2005
  • This paper focuses on access control systems,
    such as the key access control models, namely,
    the discretionary and mandatory access control
    models, and the role-based access control (RBAC)
    model.

21
References
  • 1Distributed Operating Systems Algorithms,
    Randy Chow and Theodore Johnson, Addison Wesley,
    1997.
  • 2 Yixin Jiang, Chuang Lin, Zhen Chen, Hao Yin
    2004 IEEE International Conference on Systems,
    Man and Cybernetics Security Analysis of
    Maindatory Access Control Model.
    http//ieeexplore.ieee.org/servlet/opac?punumber9
    622
  • 4 Alexander Brodsky, Csilla Farkas, and Sushil
    Jajodia ,Database SecurityConcepts,Approaches,
    and Challenges
  • IEEE TRANSACTIONS ON DEPENDABLE AND SECURE
    COMPUTING. JANUARY-MARCH 2005 http//ieeexplore.ie
    ee.org/servlet/opac?punumber8858
  • 5 http//en.wikipedia.org/wiki/Mandatory_access
    _control
  •  
Write a Comment
User Comments (0)
About PowerShow.com