Chapter 7: Hybrid Policies

Slides:



Advertisements
Similar presentations
Multilevel Security (MLS) Database Security and Auditing.
Advertisements

1 cs691 chow Hybrid Policies CS691 – Chapter 7 of Matt Bishop.
1 ISA 662 Information System Security Hybrid Policies Chapter 6 from Bishop ’ s book.
November 1, 2004Introduction to Computer Security ©2004 Matt Bishop Slide #7-1 Chapter 7: Hybrid Policies Overview Chinese Wall Model Clinical Information.
ITIS 3200: Introduction to Information Security and Privacy Dr. Weichao Wang.
RBAC and Usage Control System Security. Role Based Access Control Enterprises organise employees in different roles RBAC maps roles to access rights After.
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.
Hybrid Policies Overview Chinese Wall Model Clinical Information Systems Security Policy ORCON RBAC Introduction to Computer Security ©2004 Matt Bishop.
Hybrid Policies Overview Chinese Wall Model Clinical Information Systems Security Policy ORCON RBAC Introduction to Computer Security ©2004 Matt Bishop.
Role Based Access Control Venkata Marella. Access Control System Access control is the ability to permit or deny the use of a particular resource by a.
Chapter 4: Security Policies Overview The nature of policies What they cover Policy languages The nature of mechanisms Types Secure vs. precise Underlying.
June 1, 2004Computer Security: Art and Science © Matt Bishop Slide #7-1 Chapter 7: Hybrid Policies Overview Chinese Wall Model Clinical Information.
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.
Chinese wall model in the internet Environment
Courtesy of Professors Chris Clifton & Matt Bishop INFSCI 2935: Introduction of Computer Security1 October 7, 2004 Introduction to Computer Security Lecture.
1 Hybrid Policies CSSE 490 Computer Security Mark Ardis, Rose-Hulman Institute March 23, 2004.
Computer Security Hybrid Policies
CMSC 414 Computer and Network Security Lecture 19 Jonathan Katz.
The top ten signs that your classmate is a computer hacker 10. You ticked him off once and your next phone bill was $20, He's won the Publisher's.
Security Policy Models CSC 482/582: Computer 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 A pattern language for security models Eduardo B. Fernandez and Rouyi Pan Presented by Liping Cai 03/15/2006.
Week 8 - Wednesday.  What did we talk about last time?  Authentication  Challenge response  Biometrics  Started Bell-La Padula model.
1 Secured Transactions Assignment 22 Maintaining Perfection Through Lapse and Bankruptcy.
Theme: classification & distribution of government control of FEA.
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.
November 1, 2004Introduction to Computer Security ©2004 Matt Bishop Slide #4-1 Chapter 1: Introduction Components of computer security Threats Policies.
Lattice-based Access Control Models 2 Daniel Trivellato.
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.
Software Security II Karl Lieberherr. What is Security Enforcing a policy that describes rules for accessing resources. Policy may be explicit or implicit.
12/13/20151 Computer Security Security Policies...
Chapt. 7 – Hybrid Policies Dr. Wayne Summers Department of Computer Science Columbus State University
Chapter 5 – Designing Trusted Operating Systems
Bảo mật theo cơ chế MAC Mandatory Access Control Models
Chapter 4: Security Policies Overview The nature of policies What they cover Policy languages The nature of mechanisms Types Secure vs. precise Underlying.
Computer Security: Principles and Practice
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.
IS 2150 / TEL 2810 Introduction to Security
Week 8 - Wednesday.  Spam  OS security.
1 IS 2150 / TEL 2810 Introduction to Security James Joshi Assistant Professor, SIS Lecture 6 October 4, 2007 Integrity Models Role based Access Control.
Chapter 7. Hybrid Policies
Access Control Model SAM-5.
Access control models and policies
Chapter 7: Hybrid Policies
Chapter 7: Hybrid Policies
2. Access Control Matrix Introduction to Computer Security © 2004 Matt Bishop 9/21/2018.
Chapter 7: Hybrid Policies
Computer Security Hybrid Policies
Basic Security Theorem
Integrity Models and Hybrid Models
System state models.
Computer Security: Art and Science, 2nd Edition
Trust Models CS461/ECE422.
Chapter 7: Hybrid Policies
Chinese wall model in the internet Environment
Lecture 18: Mandatory Access Control
Biba Integrity Model Basis for all 3 models:
CS703 - Advanced Operating Systems
Chapter 6: Integrity Policies
Computer Security Security Policies
Chapter 4: Security Policies
Computer Security Integrity Policies
Chapter 5: Confidentiality Policies
Computer Security Hybrid Policies
Presentation transcript:

Chapter 7: Hybrid Policies 7.1 Chinese Wall Model 7.2 Clinical Information System Security Policy 7.3 Originator Controlled Access Control 7.4 Role-Based Access Control

Chinese Wall Model A model of a security policy that refers equally to confidentiality and integrity; Most natural environment: stock exchange, investment house; Goal: prevent a conflict of interest in business, when a trader represents two clients; https://upload.wikimedia.org/wikipedia/commons/thumb/2/23/The_Great_Wall_of_China_at_Jinshanling-edit.jpg/1200px-The_Great_Wall_of_China_at_Jinshanling-edit.jpg

Chinese Wall Model Problem: Tony advises Bank of America about investments He is asked to advise CitiBank about investments Conflict of interest to accept, because his advice for either bank would affect his advice to the other bank http://progressions.prssa.org/wp-content/uploads/2014/03/100shares.gif

Definitions Object O: items of information related to a company Company dataset (CD): contains objects related to a single company CD(O): the company dataset that contains object O; Conflict of interest class (COI): contains datasets of companies in competition COI(O): the COI class that contains object O; Assume: each object belongs to exactly one COI class

Example COI Class

Temporal Element If Anthony reads any CD in a COI, he can never read another CD in that COI Possible that information learned earlier may allow him to make decisions later Let PR(S) be set of objects that S has already read https://en.wikipedia.org/wiki/Kai-Fu_Lee

CW-Simple Security Condition (preliminary version) s can read o iff either condition holds: There is an o such that s has accessed o and CD(o) = CD(o) Meaning s has read something in o’s dataset For all o  O, o  PR(s)  COI(o) ≠ COI(o) Meaning s has not read any objects in o’s conflict of interest class Initially, PR(s) = , so initial read request granted November 1, 2004 Introduction to Computer Security ©2004 Matt Bishop

Two Consequences COI Class Once a subject reads any object in a COI class, the only other objects in that COI class that the subject can read are in the same CD as the read object; The minimum number of subjects needed to access every object in a COI class is the same as the number of CDs in that COI class;

Sanitization Public information may belong to a CD As is publicly available, no conflicts of interest arise So, should not affect ability of analysts to read Typically, all sensitive data removed from such information before it is released publicly (called sanitization) Add third condition to CW-Simple Security Condition: 3. o is a sanitized object https://www.wikihow.com/images/thumb/a/a1/Sanitize-Your-Mascara-Step-1-Version-2.jpg/aid1244098-v4-728px-Sanitize-Your-Mascara-Step-1-Version-2.jpg

CW-Simple Security Condition s can read o iff either condition holds: There is an o such that s has accessed o and CD(o) = CD(o) Meaning s has read something in o’s dataset For all o  O, o  PR(s)  COI(o) ≠ COI(o) Meaning s has not read any objects in o’s conflict of interest class 3. o is a sanitized object November 1, 2004 Introduction to Computer Security ©2004 Matt Bishop

Writing Anthony Susan Anthony, Susan work in same trading house Anthony can read Bank 1’s CD, Gas’ CD Susan can read Bank 2’s CD, Gas’ CD If Anthony could write to Gas’ CD, Susan can read it Hence, indirectly, she can read information from Bank 1’s CD, a clear conflict of interest Anthony Susan Bank 1 Gas Bank 2

CW-*-Property s can write to o iff both of the following hold: The CW-simple security condition permits s to read o; and For all unsanitized objects o, if s can read o, then CD(o) = CD(o) Says that s can write to an object if all the (unsanitized) objects it can read are in the same dataset November 1, 2004 Introduction to Computer Security ©2004 Matt Bishop

ORCON Problem: organization creating document wants to control its dissemination https://directsoftwareoutlet.com/wp-content/uploads/2016/04/Original_Button.png

Requirements Subject s  S marks object o  O as ORCON on behalf of organization X. X allows o to be disclosed to subjects acting on behalf of organization Y with the following restrictions: o cannot be released to subjects acting on behalf of other organizations without X’s permission; and Any copies of o must have the same restrictions placed on it.

Role Based Access Control Access depends on function, not identity

Definitions Role r: collection of job functions trans(r): set of authorized transactions for r Active role of subject s: role s is currently in actr(s) Authorized roles of a subject s: set of roles s is authorized to assume authr(s) canexec(s, t) iff subject s can execute transaction t at current time November 1, 2004 Introduction to Computer Security ©2004 Matt Bishop

Axioms Let S be the set of subjects and T the set of transactions. Rule of role assignment: (s  S)(t  T) [canexec(s, t)  actr(s) ≠ ]. If s can execute a transaction, it has a role This ties transactions to roles Rule of role authorization: (s  S) [actr(s)  authr(s)]. Subject must be authorized to assume an active role (otherwise, any subject could assume any role)

Axiom Rule of transaction authorization: (s  S)(t  T)[canexec(s, t)  t  trans(actr(s))]. If a subject s can execute a transaction, then the transaction is an authorized one for the role s has assumed

Separation of Duty Let r be a role, and let s be a subject such that r  auth(s). Then the predicate meauth(r) (for mutually exclusive authorizations) is the set of roles that s cannot assume because of the separation of duty requirement. Separation of duty: (r1, r2  R) [ r2  meauth(r1)  [ (s  S) [ r1 authr(s)  r2  authr(s) ] ] ] https://danielmaunick.files.wordpress.com/2011/05/animation20teacher20i.jpg