12/13/20151 Computer Security Security Policies...

Slides:



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

Operating System Security
1 cs691 chow C. Edward Chow Confidentiality Policy CS691 – Chapter 5 of Matt Bishop.
Chapter 23 Database Security and Authorization Copyright © 2004 Pearson Education, Inc.
November 1, 2004Introduction to Computer Security ©2004 Matt Bishop Slide #7-1 Chapter 7: Hybrid Policies Overview Chinese Wall Model Clinical Information.
Access Control Methodologies
Database Management System
Access Control Intro, DAC and MAC System Security.
Hybrid Policies Overview Chinese Wall Model Clinical Information Systems Security Policy ORCON RBAC Introduction to Computer Security ©2004 Matt Bishop.
Chapter 4: Security Policies Overview The nature of policies What they cover Policy languages The nature of mechanisms Types Secure vs. precise Underlying.
April 13, 2004ECS 235Slide #1 Expressive Power How do the sets of systems that models can describe compare? –If HRU equivalent to SPM, SPM provides more.
1 Building with Assurance CSSE 490 Computer Security Mark Ardis, Rose-Hulman Institute May 10, 2004.
November 1, 2004Introduction to Computer Security ©2004 Matt Bishop Slide #4-1 Chapter 4: Security Policies Overview The nature of policies –What they.
1 Security Policies CSSE 490 Computer Security Mark Ardis, Rose-Hulman Institute March 15, 2004.
CMSC 414 Computer (and Network) Security Lecture 10 Jonathan Katz.
User Domain Policies.
7/15/2015 7:56 AM Lecture 3: Policy James Hook CS 591: Introduction to Computer Security.
Role Based Access control By Ganesh Godavari. Outline of the talk Motivation Terms and Definitions Current Access Control Mechanism Role Based Access.
ITIS 3200: Introduction to Information Security and Privacy Dr. Weichao Wang.
Lecture slides prepared for “Computer Security: Principles and Practice”, 2/e, by William Stallings and Lawrie Brown, Chapter 4 “Overview”.
CMSC 414 Computer and Network Security Lecture 19 Jonathan Katz.
1 September 14, 2006 Lecture 3 IS 2150 / TEL 2810 Introduction to Security.
ITIS 3200: Introduction to Information Security and Privacy Dr. Weichao Wang.
Security Policy What is a security policy? –Defines what it means for a system to be secure Formally: Partition system into –Secure (authorized) states.
1 IS 2150 / TEL 2810 Information Security & Privacy James Joshi Associate Professor, SIS Lecture 6 Oct 2-9, 2013 Security Policies Confidentiality Policies.
1 A pattern language for security models Eduardo B. Fernandez and Rouyi Pan Presented by Liping Cai 03/15/2006.
1 Precise Enforcement of Policies After we have a policy, is there always a mechanism to enforce it? If so, can we devise a generic procedure for developing.
Cryptography, Authentication and Digital Signatures
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.
1 Grand Challenges in Authorization Systems Prof. Ravi Sandhu Executive Director and Endowed Chair November 14, 2011
Slide #4-1 Chapter 4: Security Policies Overview The nature of policies –What they cover –Policy languages The nature of mechanisms –Types Underlying both.
Next-generation databases Active databases: when a particular event occurs and given conditions are satisfied then some actions are executed. An active.
Lattice-Based Access Control Models Ravi S. Sandhu Colorado State University CS 681 Spring 2005 John Tesch.
Slide #2-1 Chapter 2: Access Control Matrix Overview Access Control Matrix Model Protection State Transitions –Commands –Conditional Commands.
CMSC 414 Computer (and Network) Security Lecture 11 Jonathan Katz.
12/3/2015Slide #7-1 Chapter 7: Hybrid Policies Overview Chinese Wall Model Clinical Information Systems Security Policy ORCON RBAC.
12/4/20151 Computer Security Security models – an overview.
ITIS 3200: Introduction to Information Security and Privacy Dr. Weichao Wang.
Policy, Models, and Trust
1 IS 2150 / TEL 2810 Introduction to Security James Joshi Associate Professor, SIS Lecture 5 September 29, 2009 Security Policies Confidentiality Policies.
Chapter 4: Security Policies Overview The nature of policies What they cover Policy languages The nature of mechanisms Types Secure vs. precise Underlying.
Access Control: Policies and Mechanisms Vinod Ganapathy.
Advanced System Security Dr. Wayne Summers Department of Computer Science Columbus State University
Computer Security: Principles and Practice
2/1/20161 Computer Security Foundational Results.
A Comparison of Commercial and Military Computer Security Presenter: Ivy Jiang1 A Comparison of Commercial and Military Computer Security Policies Authors:
IS 2150/TEL 2810: Introduction of Computer Security1 September 27, 2003 Introduction to Computer Security Lecture 4 Security Policies, Confidentiality.
Computer Science and Engineering Computer System Security CSE 5339/7339 Session 16 October 14, 2004.
1 IS 2150 / TEL 2810 Introduction to Security James Joshi Assistant Professor, SIS Lecture 3 September 13, 2007 Mathematical Review Security Policies.
PREPARED BY: MS. ANGELA R.ICO & MS. AILEEN E. QUITNO (MSE-COE) COURSE TITLE: OPERATING SYSTEM PROF. GISELA MAY A. ALBANO PREPARED BY: MS. ANGELA R.ICO.
INTRO TO COMPUTER SECURITY LECTURE 2 Security Policies M M Waseem Iqbal
6/22/20161 Computer Security Integrity Policies. 6/22/20162 Integrity Policies Commercial requirement differ from military requirements: the emphasis.
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 7. Hybrid Policies
Chap 4. Security Policies
CS 395: Topics in Computer Security
Access Control CSE 465 – Information Assurance Fall 2017 Adam Doupé
Advanced System Security
IS 2150 / TEL 2810 Introduction to Security
Security Modeling Jagdish S. Gangolly School of Business
Chapter 4: Security Policies
Guest Lecture in Acc 661 (Spring 2007) Instructor: Christopher Brown)
Chapter 4: Security Policies
Security.
IS 2150 / TEL 2810 Information Security & Privacy
Computer Security Security Policies
Chapter 4: Security Policies
Computer Security Integrity Policies
Presentation transcript:

12/13/20151 Computer Security Security Policies..

12/13/20152 Security Policies We view a computer system as a finite-state machine Definition A security policy is a statement that partitions the states of a system into a set of authorized or secure states and a set of unauthorized or nonsecure states. A secure system is a system that starts in an authorized state and cannot enter an unauthorized state.

12/13/20153 Example s 1 s2s2 s3s3 s4s4 t1t1 t3t3 t2t2 t5t5 t4t4 An insecure system Authorized states are s 1 and s 2 Unauthorized states are s 3 and s 4

12/13/20154 Security Policies Definition 1.A breach of security occurs when a system enters an unauthorized state. 2.Let X be a set of entities and I be some information. I has the property of confidentiality with respect to X if no member of X can obtain information about I. I has the property of integrity with respect to X if all members of X trust I. 3.Let I be a resource I has the property of availability with respect to X if all member of X can access I. 5.A security mechanism is an entity or procedure that enforces some part of a security policy.

12/13/20155 Types of Policies Definition 1.Military security policies or governmental security policies. 2.Commercial security policies Confidentiality policies Integrity policies Transaction policies Discuss issues regarding trust.

12/13/20156 The role of trust The role of trust is fundamental in understanding the nature of computer security. Examples –see textbook [Example , pp (high level)& (low-level, formal)]

12/13/20157 Types of Access Control Discretionary Access Control (DAC) or identity based access control. Mandatory Access Control (MAC) or role-based access control. An originator access control (ORCON or ORGON) bases access on the creator of an object. [Examples pp ]

12/13/20158 Discretionary Access Control (DAC) Access control is left to the discretion of the owner. Based on the identity of the subject. [Example –see textbook pp

12/13/20159 Mandatory Access Control (MAC) The operating system enforces mandatory access controls. Neither the subject nor even the owner can determine access control. Example –see textbook

12/13/ ORiginator access CONtrol (ORCON or ORGON) The originator of the file (or its information) has control the dissemination of its information. Example –see textbook

12/13/ Policy languages High level policy languages: independent of the mechanisms used. Low level policy languages [Examples pp ]

12/13/ High level policy languages Express policy constraints on entities using abstraction and are independent of the security mechanisms. This requires: An unambiguous expression of policy A mathematical or programming formulation Details: see textbook. [Examples pp ]

12/13/ Low level policy languages A set of inputs or arguments to commands that set or check constraints on a system. For examples, see textbook [Examples pp ]

12/13/ Security and Precision Earlier security and precision was defined in terms of the states of the system. We said that security policies were enforced by security mechanisms and that such mechanisms were either secure, precise or broad. Let P be the set of all states, Q the set of secure states and suppose that the mechanism restricts the system to the set of states R. A security mechanism was secure if R  Q, precise if R = Q and broad if there are states such that r  R and r  Q.

12/13/ Security and Precision We now consider the possibility of devising a generic procedure for developing a mechanism that is security and precise. For this, we will use programs, which will be viewed as abstract functions that “encode” the information that needs to be controlled.

12/13/ Security and Precision Definition A program p is a function p : I 1  …  I n → R. p has n inputs i j  I j and one output r  R Axiom ( observability postulate ) Suppose p does not alter information but merely provides a view of its inputs. We say that p encodes all available information about i 1, …, i n Example A confidentiality policy seeks to control what views are available.

12/13/ Security and Precision Definition Let p : I 1    I n → R be a function 1. A protection mechanism m for p is a function m : I 1   I n → R  E ( E is an error message ) for which, when ( i 1  i n )  I 1   I n, either a. m ( i 1  i k  = p ( i 1  i k  or b. m ( i 1  i k   E. That is, every “legal” input to m produces either the same value as p or an error message. The set of output values of p that are excluded by m are those outputs that would impart confidential information. [Examples p 115]

12/13/ Security and Precision Definition 2. A confidentiality policy for the program p : I 1  I n → R is a function c : I 1   I n → A, where A is a subset of I 1   I n. Here the set A corresponds to those inputs that may be revealed. The complement of A to the confidential inputs.

12/13/ Security and Precision Definitions 3.Let c be a confidentiality policy for a program p. Let m : I 1   I n → R  E be a security mechanism for p. The mechanism m is secure iff there is a function m’ : I 1   I n → R  E such that for all ( i 1  i n )  I 1   I n   m ( i 1  i k  = m’ ( c ( i 1  i k )). That is, given any set of inputs, the protection mechanism m returns values consistent with the stated policy c ( here “secure” = “confidential” )

12/13/ Security and Precision Definitions Let m 1, m 2 protection mechanisms for program p under policy c. 4. m 1 is as precise as m 2 if for all inputs ( i 1  i n ) : m 2 ( i 1  i k  = p ( i 1  i k  ═> m 1 ( i 1  i k  = p ( i 1  i k  5.m 1 is more precise than m 2 if there is an input ( i 1 ′  i n ′ ) such that : m 2 ( i 1 ′  i n ′ ) = p ( i 1 ′  i n ′ ) & m 1 ( i 1 ′  i n ′ ) ≠ p ( i 1 ′  i n ′ )

12/13/ Security and Precision Theorems 1.For any program p there exists a precise secure mechanism m* such that for all secure mechanisms m associated with p and c we have m* = m. 2.There is no effective way that determines a (maximally) precise secure mechanism for any policy and program.