Computer Security Integrity Policies

Slides:



Advertisements
Similar presentations
TOPIC CLARK-WILSON MODEL Ravi Sandhu.
Advertisements

CSC 405 Introduction to Computer Security
Information Flow and Covert Channels November, 2006.
CS691 – Chapter 6 of Matt Bishop
Dan Fleck CS 469: Security Engineering
CMSC 414 Computer (and Network) Security Lecture 12 Jonathan Katz.
Security Models and Architecture
Chapter 6: Integrity Policies Overview Requirements Biba’s models Clark-Wilson model Introduction to Computer Security ©2004 Matt Bishop.
ITIS 3200: Introduction to Information Security and Privacy Dr. Weichao Wang.
June 1, 2004Computer Security: Art and Science © Matt Bishop Slide #6-1 Chapter 6: Integrity Policies Overview Requirements Biba’s models Lipner’s.
May 4, 2004ECS 235Slide #1 Biba Integrity Model Basis for all 3 models: Set of subjects S, objects O, integrity levels I, relation ≤  I  I holding when.
Verifiable Security Goals
Courtesy of Professors Chris Clifton & Matt Bishop INFSCI 2935: Introduction of Computer Security1 September 18, 2003 Introduction to Computer Security.
Courtesy of Professors Chris Clifton & Matt Bishop INFSCI 2935: Introduction of Computer Security1 October 7, 2004 Introduction to Computer Security Lecture.
1 Integrity Policies CSSE 490 Computer Security Mark Ardis, Rose-Hulman Institute March 22, 2004.
Chapter 6: Integrity Policies Overview Requirements Biba’s models Clark-Wilson model Introduction to Computer Security ©2004 Matt Bishop.
CMSC 414 Computer and Network Security Lecture 11 Jonathan Katz.
Information Systems Security Security Architecture Domain #5.
CS526Topic 21: Integrity Models1 Information Security CS 526 Topic 21: Integrity Protection Models.
User Domain Policies.
November 1, 2004Introduction to Computer Security ©2004 Matt Bishop Slide #6-1 Chapter 6: Integrity Policies Overview Requirements Biba’s models Clark-Wilson.
Sicurezza Informatica Prof. Stefano Bistarelli
CMSC 414 Computer and Network Security Lecture 19 Jonathan Katz.
1 ISA 562 Internet Security Theory and Practice Integrity Policies Chapter 6 of Bishop ’ s book.
Mandatory Security Policies CS461/ECE422 Spring 2012.
Slide #6-1 Integrity Policies CS461/ECE422 – Computer Security I Fall 2009 Based on slides provided by Matt Bishop for use with Computer Security: Art.
1 IS 2150 / TEL 2810 Information Security & Privacy James Joshi Associate Professor, SIS Lecture 6 Oct 2-9, 2013 Security Policies Confidentiality Policies.
3/16/2004Biba Model1 Biba Integrity Model Presented by: Nathan Balon Ishraq Thabet.
Computer Security 3e Dieter Gollmann
Week 8 - Wednesday.  What did we talk about last time?  Authentication  Challenge response  Biometrics  Started Bell-La Padula model.
Session 2 - Security Models and Architecture. 2 Overview Basic concepts The Models –Bell-LaPadula (BLP) –Biba –Clark-Wilson –Chinese Wall Systems Evaluation.
Security Architecture and Design Chapter 4 Part 3 Pages 357 to 377.
ITIS 3200: Introduction to Information Security and Privacy Dr. Weichao Wang.
Chapter 5 Network Security
Chapter 6: Integrity Policies  Overview  Requirements  Biba’s models  Clark-Wilson model Introduction to Computer Security ©2004 Matt Bishop.
CS426Fall 2010/Lecture 251 Computer Security CS 426 Lecture 25 Integrity Protection: Biba, Clark Wilson, and Chinese Wall.
Confidentiality Policies and Integrity Policies by Stefanie Wilcox.
Trusted OS Design and Evaluation CS432 - Security in Computing Copyright © 2005, 2010 by Scott Orr and the Trustees of Indiana University.
UT DALLAS Erik Jonsson School of Engineering & Computer Science FEARLESS engineering Integrity Policies Murat Kantarcioglu.
12/4/20151 Computer Security Security models – an overview.
Chapter 5 – Designing Trusted Operating Systems
Materials credits: M. Bishop, UC Davis T. Jaeger, Penn State U.
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.
Slide #6-1 Chapter 6: Integrity Policies Overview Requirements Biba’s models Clark-Wilson model.
6/22/20161 Computer Security Integrity Policies. 6/22/20162 Integrity Policies Commercial requirement differ from military requirements: the emphasis.
CS526Topic 19: Integrity Models1 Information Security CS 526 Topic 19: Integrity Protection Models.
Chapter 7. Hybrid Policies
TOPIC: Web Security Models
Verifiable Security Goals
Integrity policies.
Chapter 6 Integrity Policies
Chapter 6: Integrity Policies
Chapter 5: Confidentiality Policies
Chapter 14: Protection.
Basic Security Theorem
Computer Security Confidentiality Policies
Integrity Models and Hybrid Models
System state models.
Dr. Bhavani Thuraisingham Cyber Security Lecture for July 2, 2010 Security Architecture and Design.
Security Modeling Jagdish S. Gangolly School of Business
Guest Lecture in Acc 661 (Spring 2007) Instructor: Christopher Brown)
Trust Models CS461/ECE422.
Chapter 6: Integrity Policies
Lecture 18: Mandatory Access Control
Integrity Policies Dr. Wayne Summers Department of Computer Science
Computer Security Confidentiality Policies
Biba Integrity Model Basis for all 3 models:
Chapter 6: Integrity Policies
IS 2150 / TEL 2810 Information Security & Privacy
Presentation transcript:

Computer Security Integrity Policies 7/31/2019

Integrity Policies Commercial requirement Users should not write their own programs Programmers will develop and test programs on a non production system. A special process must be followed to install a program from the development system onto the production system. This must be controlled and audited. Managers and auditors must have access to both the system state and log state. 7/31/2019

Integrity Policies Goals Separation of duties Separation of function: developers and testers. Auditing: recovery and accountability 7/31/2019

Biba Integrity model Basically a dual of the Bell-LaPadula model. We have a subject set S, an object set O, a set of integrity levels I, and a relation  on I. Let i : SO I return the integrity level, Relations r : ability to read an object w : ability to write an object x : ability to execute a subject 7/31/2019

Information transfer path A Information transfer path is a sequence of objects o1, … , on+1 and a corresponding sequence of subject s1, … , sn such that sj r oj and sj w oj+1 for all i 7/31/2019

Low-Water-Mark Policy s S can write to o O iff i (o)  i (s) . If s S reads o O then i ’ (s)= min(i (s) ,i (o)), where i ’ (s) is the integrity level of s after the read. s1 S can execute s2 S iff i (s2)  i (s1) . So write up is prevented (prevents implant of corrupted data) Integrity level drops on read access to lower level objects (prevents contaminating the subject: relying on less trustworthy data) execute up is prevented. 7/31/2019

Low-Water-Mark Policy Theorem: If there is an information path from o1 O to on+1 O , then enforcement of the low-water-mark policy requires that i (on+1)  i (o1) for all i>n. Proof The integrity level cannot go up. Proof by induction. 7/31/2019

Low-Water-Mark Policy Problem The integrity level of a subject is non-increasing, resulting in some subjects being eventually unable to access certain objects. 7/31/2019

Ring Policy This ignores indirect modifications and focuses on direct modifications. s S can write to o O iff i (o)  i (s) . s S can read any o O. s1S can execute s2 S iff i (s2)  i (s1) . Difference: Subjects can read any object. 7/31/2019

Biba’s strict integrity Policy s S can write to o O iff i (o)  i (s) . s S can read o O iff i (s)  i (o) . s1 S can execute s2 S iff i (s2)  i (s 1) . So write up is prevented read down is prevented (prevents relying on less trustworthy data) execute up is prevented. 7/31/2019

Lipner’s Integrity Matrix Model Basic Security levels Audit Manager (AM): system and management functions System Low (SL): any process can read info at this level. Categories Development (D) Production Code (PC) Production Data (PD) System Development (SD) Software Tools 7/31/2019

Lipner’s Integrity Matrix Model Users Clearance levels Ordinary users (SL, {PC,PD}) Application Developers (SL, {D,T}) System Programmers (SL, {SD,T}) System Managers & Auditors (AM, {D,PC,PD,ST,T}) System Controllers (SL, {D,PC,PD,ST,T}) and downgrade privileges. 7/31/2019

Reminder:The Bell-LaPadula model ss-property: (s,o,p) SOP satisfies the ss-property relative to the security level f iff one of the following holds: p = e or p = a p = r or p = w and fc(s) dom fo(o). Also DAC! 7/31/2019

Reminder: The Bell-LaPadula model Define b(s: p1,…,pn) to be the set of objects that s has access to. *-property: For each sS the following hold: b(s:a) ≠  [o b(s:a) [fc(o) dom fc(s)] ] (write-up) b(s:w) ≠  [o b(s:w) [fc(o) = fc(s)] ] (equality for read) b(s:r) ≠  [o b(s:r) [fc(s) dom fo(o)] ] (read-down) Also DAC! 7/31/2019

Lipner’s Integrity Matrix Model Lipner’s model combines Biba and Bell-LaPadula. Bell-LaPadula model: Simple security condition * property For example: an ordinary user can execute production code; if he needs to alter production data, the *-property dictates that the data be in (System Low, {Production Code, Production Data}). 7/31/2019

Lipner’s Integrity Matrix Model Objects Class Development code/test data (SL, {D,T}) Production code (SL, {PC}) Production data (SL, {PC,PD}) Software tools (SL, {T}) System programs (SL, {}) System programs in modification (SL, {SD,T}) System and application logs (AM, {appropriate categories}) Logs are append only. By the *-property their class must dominate those of the subjects that write to them 7/31/2019

The Clark-Wilson (CW) Model This model addresses data integrity requirements for commercial applications, e.g. bank transactions. Integrity requirements are divided into, internal consistency: properties of the internal state that can be enforced by the computer system. external consistency: the relation of the internal state to the real world: enforced by means outside the system, e.g. auditing. 7/31/2019

The CW Model Integrity is enforced by, well formed transactions: data items can be manipulated only by a specific set of programs; users have access to programs rather than data items. separation of duties: users have to collaborate to manipulate data and collude to penetrate the system. 7/31/2019

The CW Model In the Clark-Wilson model, Subjects must be identified and authenticated, Objects can be manipulated only by a restricted set of programs, Subjects can execute only a restricted set of programs, A proper audit log has to be maintained, The system must be certified to work properly. 7/31/2019

The CW Model In the Clark-Wilson model, Subjects must be identified and authenticated, Objects can be manipulated only by a restricted set of programs, Subjects can execute only a restricted set of programs, A proper audit log has to be maintained, The system must be certified to work properly. 7/31/2019

The CW Model In the Clark-Wilson model, Data items are called Constrained Data Items (CDIs), Input items are Unconstrained Data Items (UDIs), Conversion of UDIs to CDIs cannot be controlled solely by the security mechanisms of the system, CDIs can only be manipulated by Transformation Procedures (TPs) The integrity of a state is checked by Integrity Verification Procedure (IVPs) 7/31/2019

The CW Model Security procedures are defined by 5 Certification rules: IVPs must ensure that all CDIs are in a valid state when the IVP is run. TPs must be must transform “their” valid CDIs into valid CDIs. The “allowed” access relations must meet the requirements imposed by the principle of separation of duty. 4. All TPs must write to an append-only CDI log. 5. Any TP that takes a UDI as input must either convert it into a CDI or reject it. 7/31/2019

The CW Model Integrity is enforced by the 4 Enforcement rules: The system must maintain and protect the certified relations: (TPi:CDIa,CDIb, … ) and ensure that only TPs certified to run on a CDI manipulate that CDI. The system must maintain and protect the list of entries: (User,TPi:CDIa,CDIb, … ) specifying the TPs that users can execute. The system must authenticate each user requesting to execute a TP. Only the certifier of a TP may modify the respective entities associated with that TP. No certifier of a TP may have execute permission with respect to that entity. 7/31/2019