Advanced System Security

Slides:



Advertisements
Similar presentations
Information Flow and Covert Channels November, 2006.
Advertisements

1 cs691 chow C. Edward Chow Confidentiality Policy CS691 – Chapter 5 of Matt Bishop.
Lecture 8 Access Control (cont)
I NFORMATION S ECURITY : C ONFIDENTIALITY P OLICIES (C HAPTER 4) Dr. Shahriar Bijani Shahed University.
ITIS 3200: Introduction to Information Security and Privacy Dr. Weichao Wang.
Slide #5-1 Chapter 5: Confidentiality Policies Overview –What is a confidentiality model Bell-LaPadula Model –General idea –Informal description of rules.
Access Control Intro, DAC and MAC System Security.
1 Confidentiality Policies CSSE 490 Computer Security Mark Ardis, Rose-Hulman Institute March 18, 2004.
Confidentiality Policies  Overview  What is a confidentiality model  Bell-LaPadula Model  General idea  Informal description of rules  Formal description.
1 cs691 chow C. Edward Chow Confidentiality Policy CS691 – Chapter 5 of Matt Bishop.
Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.
November 1, 2004Introduction to Computer Security ©2004 Matt Bishop Slide #5-1 Chapter 5: Confidentiality Policies Overview –What is a confidentiality.
Sicurezza Informatica Prof. Stefano Bistarelli
User Domain Policies.
7/15/2015 5:04 PM Lecture 4: Bell LaPadula James Hook CS 591: Introduction to Computer Security.
Dr. Kalpakis CMSC 621, Advanced Operating Systems. Fall 2003 URL: Security & Protection.
1 IS 2150 / TEL 2810 Introduction to Security James Joshi Assistant Professor, SIS Lecture 5 September 27, 2007 Security Policies Confidentiality Policies.
Dr. Kalpakis CMSC 621, Advanced Operating Systems. Security & Protection.
CH14 – Protection / Security. Basics Potential Violations – Unauthorized release, modification, DoS External vs Internal Security Policy vs Mechanism.
1 Confidentiality Policies September 21, 2006 Lecture 4 IS 2150 / TEL 2810 Introduction to Security.
1 IS 2150 / TEL 2810 Information Security & Privacy James Joshi Associate Professor, SIS Lecture 6 Oct 2-9, 2013 Security Policies Confidentiality Policies.
© G. Dhillon, IS Department Virginia Commonwealth University Principles of IS Security Formal Models.
Chapter 5 – Designing Trusted Operating Systems  What makes an operating system “secure”? Or “trustworthy?  How are trusted systems designed, and which.
1 Chapter 20: Firewalls Fourth Edition by William Stallings Lecture slides by Lawrie Brown(modified by Prof. M. Singhal, U of Kentucky)
Session 2 - Security Models and Architecture. 2 Overview Basic concepts The Models –Bell-LaPadula (BLP) –Biba –Clark-Wilson –Chinese Wall Systems Evaluation.
Chapter 5 Network Security
Slide #5-1 Confidentiality Policies CS461/ECE422 Computer Security I Fall 2010 Based on slides provided by Matt Bishop for use with Computer Security:
Access Control MAC. CSCE Farkas 2 Lecture 17 Reading assignments Required for access control classes:  Ravi Sandhu and P. Samarati, Access Control:
Trusted OS Design and Evaluation CS432 - Security in Computing Copyright © 2005, 2010 by Scott Orr and the Trustees of Indiana University.
Information Security CS 526 Topic 17
Chapter 5 – Designing Trusted Operating Systems
1 IS 2150 / TEL 2810 Introduction to Security James Joshi Associate Professor, SIS Lecture 5 September 29, 2009 Security Policies Confidentiality Policies.
1/15/20161 Computer Security Confidentiality Policies.
Access Control: Policies and Mechanisms Vinod Ganapathy.
Advanced System Security Dr. Wayne Summers Department of Computer Science Columbus State University
November 1, 2004Introduction to Computer Security ©2004 Matt Bishop Slide #5-1 Confidentiality Policies Overview –What is a confidentiality model Bell-LaPadula.
A security policy defines what needs to be done. A security mechanism defines how to do it. All passwords must be updated on a regular basis and every.
CS426Fall 2010/Lecture 211 Computer Security CS 426 Lecture 21 The Bell LaPadula Model.
Security Models Xinming Ou. Security Policy vs. Security Goals In a mandatory access control system, the system defines security policy to achieve security.
Dr. Jeff Teo Class 4 July 2, Deliverables Lecture on Trusted Computing: Evolution and Direction Review of students’ blogs and assignments Summarize.
Computer Science and Engineering Computer System Security CSE 5339/7339 Session 16 October 14, 2004.
Database Security Database System Implementation CSE 507 Some slides adapted from Navathe et. Al.
Access Controls Mandatory Access Control by Sean Dalton December 5 th 2008.
Lecture 2 Page 1 CS 236 Online Security Policies Security policies describe how a secure system should behave Policy says what should happen, not how you.
Chapter 24: Auditing Dr. Wayne Summers Department of Computer Science Columbus State University
CS580 Internet Security Protocols
Database System Implementation CSE 507
Access Control Model SAM-5.
Access Control CSE 465 – Information Assurance Fall 2017 Adam Doupé
Verifiable Security Goals
Security Models and Designing a Trusted Operating System
Chapter 5: Confidentiality Policies
Advanced System Security
Computer Security Confidentiality Policies
IS 2150 / TEL 2810 Introduction to Security
Information Security CS 526 Topic 17
Advanced System Security
Chapter 5: Confidentiality Policies
Confidentiality Models
Confidentiality Policies
Guest Lecture in Acc 661 (Spring 2007) Instructor: Christopher Brown)
Trust Models CS461/ECE422.
Advanced System Security
Chapter 5: Confidentiality Policies
Chapter 5: Confidentiality Policies
Computer Security Confidentiality Policies
CS703 - Advanced Operating Systems
IS 2150 / TEL 2810 Information Security & Privacy
Chapter 5: Confidentiality Policies
Presentation transcript:

Advanced System Security Dr. Wayne Summers Department of Computer Science Columbus State University Summers_wayne@colstate.edu http://csc.colstate.edu/summers

Models of Security Security models are used to Test a particular policy for completeness and consistency Document a policy Help conceptualize and design an implementation Check whether an implementation meets its requirements

Models of Security Want to build a model to represent a range of sensitivities and to reflect need to separate subjects from objects to which they should not have access. Use the lattice model of security military security model where <= in the model is the relation operator in the lattice (transitive, antisymmetric)

Chapter 5 – Confidentiality Policies Confidentiality policy (information flow policy) Military Security Policy based on protecting classified information Information access is limited by need-to-know rule Each piece of classified info is associated with a compartment Class (classification) - <rank; compartment> Clearance - indication that person is trusted to access info up to a certain level of sensitivity

Bell-LaPadula Model was proposed by Bell and LaPadula of MITRE for enforcing access control in government and military applications. It corresponds to military-style classifications. In such applications, subjects and objects are often partitioned into different security levels. A subject can only access objects at certain levels determined by his security level. For instance, the following are two typical access specifications: ``Unclassified personnel cannot read data at confidential levels'' and ``Top-Secret data cannot be written into the files at unclassified levels''

Informal Description Simplest type of confidentiality classification is a set of security clearances arranged in a linear (total) ordering. Clearances represent the security levels. The higher the clearance, the more sensitive the info. Basic confidential classification system: individuals documents Top Secret (TS) Tamara, Thomas Personnel Files Secret (S) Sally, Samuel Electronic Mails Confidential (C) Claire, Clarence Activity Log Files Unclassified (UC) Ulaley, Ursula Telephone Lists

Mandatory and Discretionary Access Control Bell-LaPadula model combines Mandatory and Discretionary Access Controls. “S has discretionary read (write) access to O” means that the access control matrix entry for S and O corresponding to the discretionary access control component contains a read (write) right. A B C D O Q S read(D) T If the mandatory controls not present, S would be able to read (write) O.

The Bell-LaPadula Model Dominance – s <= O iff ranks <= ranko and compartmentss <= compartmentso Simple Security Condition: S can read O iff lo <= ls and S has discretionary read access to O. (Clearance level of subject is at least as high as that of the information) *-Property: S can write O iff ls <= lo and S has discretionary write access to O. The *-property is used to prevent write-down (subject with access to high-level data transfers that data by writing it to a low-level object.) A secure system has both the simple security condition and the *-property.

The Bell-LaPadula Model discretionary security property (ds property): subjects may pass permission/clearance to other subjects A system is secure if it satisfies the simple security condition, the *-property, and the discretionary security property.

The Bell-LaPadula Model Get-read rule enables a subject s to request the right to read an object o. [preserves both the simple security condition and the *-property.] Give-read rule enables a subject s to give subject t the (discretionary) right to read an object o. [preserves both the simple security condition and the *-property.]

5.3 Tranquility The principal of strong tranquility states that security levels do not change during the lifetime of the system. The principal of weak tranquility states that security levels do not change in a way that violates the rules of a given security policy.