I NFORMATION S ECURITY : S ECURITY P OLICIES (C HAPTER 4) Dr. Shahriar Bijani Shahed University.

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.
I NFORMATION S ECURITY : C ONFIDENTIALITY P OLICIES (C HAPTER 4) Dr. Shahriar Bijani Shahed University.
Malicious Logic What is malicious logic Types of malicious logic Defenses Computer Security: Art and Science © Matt Bishop.
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.
Chapter 6: Integrity Policies Overview Requirements Biba’s models Clark-Wilson model Introduction to Computer Security ©2004 Matt Bishop.
June 1, 2004Computer Security: Art and Science © Matt Bishop Slide #4-1 Chapter 4: Security Policies Overview The nature of policies –What they.
June 1, 2004Computer Security: Art and Science © Matt Bishop Slide #4-1 Chapter 4: Security Policies Overview The nature of policies –What they.
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.
Chapter 1 Introduction. Chapter Overview Overview of Operating Systems Secure Operating Systems Basic Concepts in Information Security Design of a Secure.
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.
1 Access Control Matrix CSSE 442 Computer Security Larry Merkle, Rose-Hulman Institute March 16, 2007.
November 1, 2004Introduction to Computer Security ©2004 Matt Bishop Slide #6-1 Chapter 6: Integrity Policies Overview Requirements Biba’s models Clark-Wilson.
April 15, 2004ECS 235Slide #1 Policy Languages Express security policies in a precise way High-level languages –Policy constraints expressed abstractly.
ITIS 3200: Introduction to Information Security and Privacy Dr. Weichao Wang.
Policy, Models, and Trust 1. Security Policy A security policy is a well-defined set of rules that include the following: Subjects: the agents who interact.
1 IS 2150 / TEL 2810 Introduction to Security James Joshi Assistant Professor, SIS Lecture 5 September 27, 2007 Security Policies Confidentiality Policies.
1 September 14, 2006 Lecture 3 IS 2150 / TEL 2810 Introduction to Security.
1 - Chapter 4 of Bishop- 4. Security Policies. 2 Security Policy A a statement that partitions all possible system states into: Authorized (secure) states.
ECE509 Cyber Security : Concept, Theory, and Practice Access Control Matrix Spring 2014.
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.
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.
Slide #4-1 Chapter 4: Security Policies Overview The nature of policies –What they cover –Policy languages The nature of mechanisms –Types Underlying both.
Chapter 5 Network Security
Outline Overview – Mandatory versus discretionary controls – What is a confidentiality model Bell-LaPadula Model – General idea – Description of rules.
CMSC 414 Computer (and Network) Security Lecture 11 Jonathan Katz.
November 1, 2004Introduction to Computer Security ©2004 Matt Bishop Slide #4-1 Chapter 1: Introduction Components of computer security Threats Policies.
ITIS 3200: Introduction to Information Security and Privacy Dr. Weichao Wang.
12/13/20151 Computer Security Security Policies...
1 IS 2150 / TEL 2810 Introduction to Security James Joshi Associate Professor, SIS Lecture 5 September 29, 2009 Security Policies Confidentiality Policies.
Security Policies CS461/ECE422 Computer Security I Spring 2010.
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.
Privilege Management Chapter 22.
Advanced System Security Dr. Wayne Summers Department of Computer Science Columbus State University
Csci5233 computer security & integrity 1 Security Policies.
IS 2150/TEL 2810: Introduction of Computer Security1 September 27, 2003 Introduction to Computer Security Lecture 4 Security Policies, Confidentiality.
1 IS 2150 / TEL 2810 Introduction to Security James Joshi Assistant Professor, SIS Lecture 3 September 13, 2007 Mathematical Review Security Policies.
Slide #6-1 Chapter 6: Integrity Policies Overview Requirements Biba’s models Clark-Wilson model.
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.
Chapter 29: Program Security Dr. Wayne Summers Department of Computer Science Columbus State University
INTRO TO COMPUTER SECURITY LECTURE 2 Security Policies M M Waseem Iqbal
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.
June 1, 2004Computer Security: Art and Science © Matt Bishop Slide #4-1 Chapter 4: Security Policies Overview The nature of policies –What they.
Chap 4. Security Policies
2. Access Control Matrix Introduction to Computer Security © 2004 Matt Bishop 9/21/2018.
Advanced System Security
IS 2150 / TEL 2810 Introduction to Security
CSC 482/582: Computer Security
Expressive Power How do the sets of systems that models can describe compare? If HRU equivalent to SPM, SPM provides more specific answer to safety question.
Chapter 4: Security Policies
Computer Security: Art and Science , 2nd Edition
Policy Languages Express security policies in a precise way
Chapter 4: Security Policies
Chapter 29: Program Security
Chapter 6: Integrity Policies
IS 2150 / TEL 2810 Information Security & Privacy
Computer Security Security Policies
Chapter 4: Security Policies
Presentation transcript:

I NFORMATION S ECURITY : S ECURITY P OLICIES (C HAPTER 4) Dr. Shahriar Bijani Shahed University

S LIDES R EFERENCES Matt Bishop, Computer Security: Art and Science, the author homepage, Chris Clifton, CS 526: Information Security course, Purdue university,

C HAPTER 4: S ECURITY P OLICIES Overview The nature of policies What they cover Policy languages The nature of mechanisms Types Secure vs. precise Underlying both Trust 3

O VERVIEW Overview Policies Trust Nature of Security Mechanisms Policy Expression Languages Limits on Secure and Precise Mechanisms 4

S ECURITY P OLICY What is a security policy? Defines what it means for a system to be secure Formally: Policy partitions system states into: Authorized (secure) sates These are states the system can enter Unauthorized (nonsecure) sates If the system enters any of these states, it’s a security violation (a breach of security ) Secure system Starts in authorized state Never enters unauthorized state 5

E XAMPLE 6 S 1 and S 2 are authorized states S 3 and S 4 are unauthorized states Is this Finite State Machine Secure?

C ONFIDENTIALITY P OLICY X set of entities, I information I has confidentiality property with respect to X if no x  X can obtain information from I I can be disclosed to others Example: X set of students I final exam answer key I is confidential with respect to X if students cannot obtain final exam answer key 7

I NTEGRITY X set of entities, I information I has integrity property with respect to X if all x  X trust information in I Types of integrity: trust I, its transportation and protection (data integrity) I information about origin of something or an identity (origin integrity, authentication) I resource: means resource functions as it should (assurance) 8

A VAILABILITY X set of entities, I resource I has availability property with respect to X if all x  X can access I Types of availability: traditional: x gets access or not quality of service: promised a level of access (for example, a specific level of bandwidth) and not meet it, even though some access is achieved 9

P OLICY M ODELS Abstract description of a policy or class of policies Focus on points of interest in policies Security levels (in multilevel security models) Separation of duty (in Clark-Wilson model) Conflict of interest (in Chinese Wall model) 10

T YPES OF S ECURITY P OLICIES Military (governmental) security policy Policy primarily protecting confidentiality Commercial security policy Policy primarily protecting integrity Confidentiality policy Policy protecting only confidentiality Integrity policy Policy protecting only integrity 11

I NTEGRITY AND T RANSACTIONS Begin in consistent state “Consistent” defined by specification Perform series of actions ( transaction ) Actions cannot be interrupted If actions complete, system in consistent state If actions do not complete, system reverts to beginning (consistent) state 12

T RUST Administrator installs patch 1. Trusts patch came from vendor, not tampered with in transit 2. Trusts vendor tested patch thoroughly 3. Trusts vendor’s test environment corresponds to local environment 4. Trusts patch is installed correctly 13

T RUST IN F ORMAL V ERIFICATION Gives formal mathematical proof that given input i, program P produces output o as specified Suppose a security-related program S formally verified to work with operating system O What are the assumptions? 14

T RUST IN F ORMAL M ETHODS 1. Proof has no errors Bugs in automated theorem provers 2. Preconditions hold in environment in which S is to be used 3. S transformed into executable S whose actions follow source code Compiler bugs, linker/loader/library problems 4. Hardware executes S as intended Hardware bugs (Pentium f00f bug, for example) 15

T YPES OF A CCESS C ONTROL Discretionary Access Control (DAC, IBAC) individual user sets access control mechanism to allow or deny access to an object Mandatory Access Control (MAC) system mechanism controls access to object, and individual cannot alter that access Rules specify granting of access (also called rule-based access control) Originator Controlled Access Control (ORCON) originator (creator) of information controls who can access information Role Based Access Control (RBAC) Identity governed by role user assumes 16

Q UESTION Policy disallows cheating Includes copying homework, with or without permission CS class has students do homework on computer Alice forgets to read-protect her homework file Bob copies it Who cheated? Alice, Bob, or both? 17

A NSWER P ART 1 Bob cheated Policy forbids copying homework assignment Bob did it System entered unauthorized state (Bob having a copy of Alice’s assignment) If not explicit in computer security policy, certainly implicit Not credible that a unit of the university allows something that the university as a whole forbids, unless the unit explicitly says so 18

A NSWER P ART #2 Alice didn’t protect her homework Not required by security policy She didn’t breach security If policy said students had to read-protect homework files, then Alice did breach security She didn’t do read-protection 19

M ECHANISMS Entity or procedure that enforces some part of the security policy Access controls (like bits to prevent someone from reading a homework file) Disallowing people from bringing CDs and USB disks into a computer facility to control what is placed on systems 20

P OLICY L ANGUAGES Security Policy isn’t enough Need to express it to get Policy Model Policy Language: Means of expression Express security policies in a precise way High-level languages Policy constraints expressed abstractly Independent of mechanisms Low-level languages Acts on mechanisms Policy constraints expressed in terms of program options, input, or specific characteristics of entities on system 21

H IGH -L EVEL P OLICY L ANGUAGES Constraints expressed independent of enforcement mechanism Constraints restrict entities, actions Constraints expressed unambiguously Requires a precise language, usually a mathematical, logical, or programming-like language 22

E XAMPLE : W EB B ROWSER Goal: restrict actions of Java programs that are downloaded and executed under control of web browser Language specific to Java programs Expresses constraints as conditions restricting invocation of entities 23

E XPRESSING C ONSTRAINTS Entities are classes, methods Class: set of objects that an access constraint constrains Method: set of ways an operation can be invoked Operations Instantiation: s creates instance of class c : s –| c Invocation: s 1 executes object s 2 : s 1 |  s 2 Access constraints deny ( s op x ) when b While b is true, subject s cannot perform op on (subject or class) x ; empty s means all subjects 24

S AMPLE C ONSTRAINTS Downloaded program cannot access password database file on UNIX system Program’s class and methods for files: class File { public file(String name); public String getfilename(); public char read(); Constraint: deny( |-> file.read) when (file.getfilename() == “/etc/passwd”) 25

A NOTHER S AMPLE C ONSTRAINT At most 100 network connections open Socket class defines network interface Network.numconns method giving number of active network connections Constraint deny( -| Socket) when (Network.numconns >= 100) 26

DTEL ( DOMAIN - TYPE ENFORCEMENT LANGUAGE ) Basis: access can be constrained by types Combines elements of low-level, high-level policy languages Implementation-level constructs express constraints in terms of language types Constructs do not express arguments or inputs to specific system commands 27

E XAMPLE Goal: users cannot write to system binaries Subjects in administrative domain can User must authenticate to enter that domain Subjects belong to domains: d_user ordinary users d_admin administrative users d_login for login d_daemon system daemons 28

T YPES Object types: t_sysbin executable system files t_readable readable files t_writable writable files t_dte data used by enforcement mechanisms t_generic data generated from user processes For example, treat these as partitions In practice, files can be readable and writable; ignore this for the example 29

D OMAIN R EPRESENTATION Sequence First component is list of programs that start in the domain Other components describe rights subject in domain has over objects of a type (crwd->t_writable) means subject can create, read, write, and list (search) any object of type t_writable 30

D _ DAEMON D OMAIN domain d_daemon = (/sbin/init), (crwd->t_writable), (rd->t_generic, t_readable, t_dte), (rxd->t_sysbin), (auto->d_login); Compromising subject in d_daemon domain does not enable attacker to alter system files Subjects here have no write access When /sbin/init invokes login program, login program transitions into d_login domain 31

D _ ADMIN D OMAIN domain d_admin = (/usr/bin/sh, /usr/bin/csh, /usr/bin/ksh), (crwxd->t_generic), (crwxd->t_readable, t_writable, t_dte, t_sysbin), (sigtstp->d_daemon); sigtstp allows subjects to suspend processes in d_daemon domain Admin users use a standard command interpreter 32

D _ USER D OMAIN domain d_user = (/usr/bin/sh, /usr/bin/csh, /usr/bin/ksh), (crwxd->t_generic), (rxd->t_sysbin), (crwd->t_writable), (rd->t_readable, t_dte); No auto component as no user commands transition out of it Users cannot write to system binaries 33

D _ LOGIN D OMAIN domain d_login = (/usr/bin/login), (crwd->t_writable), (rd->t_readable, t_generic, t_dte), setauth, (exec->d_user, d_admin); Cannot execute anything except the transition Only /usr/bin/login in this domain setauth enables subject to change UID exec access to d_user, d_admin domains 34

S ET U P initial_domain = d_daemon; System starts in d_daemon domain assign –r t_generic /; assign –r t_writable /usr/var, /dev, /tmp; assign –r t_readable /etc; assign –r –s dte_t /dte; assign –r –s t_sysbin /sbin, /bin, /usr/bin, /usr/sbin; These assign initial types to objects –r recursively assigns type –s binds type to name of object (delete it, recreate it, still of given type) 35

A DD L OG T YPE Goal: users can’t modify system logs; only subjects in d_admin, new d_log domains can type t_readable, t_writable, t_sysbin, t_dte, t_generic, t_log; New type t_log domain d_log = (/usr/sbin/syslogd), (crwd->t_log), (rwd->t_writable), (rd->t_generic, t_readable); New domain d_log 36

F IX D OMAIN AND S ET -U P domain d_daemon = (/sbin/init), (crwd->t_writable), (rxd->t_readable), (rd->t_generic, t_dte, t_sysbin), (auto->d_login, d_log); Subject in d_daemon can invoke logging process Can log, but not execute anything assign -r t_log /usr/var/log; assign t_writable /usr/var/log/wtmp, /usr/var/log/utmp; Set type of logs