EN.600.424 Lecture Notes Spring 2016 ACCESS CONTROL MODELS.

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.
Chapter 23 Database Security and Authorization Copyright © 2004 Pearson Education, Inc.
Lecture 8 Access Control (cont)
Access Control Methodologies
Slide #5-1 Chapter 5: Confidentiality Policies Overview –What is a confidentiality model Bell-LaPadula Model –General idea –Informal description of rules.
Access Control Patterns Fatemeh Imani Mehr Amirkabir university of technology, Department of Computer Engineering & Information Technology.
Database Management System
Database Security - Farkas 1 Database Security and Privacy.
Access Control Intro, DAC and MAC System Security.
Secure Systems Research Group - FAU Patterns for access control E.B. Fernandez.
Confidentiality Policies  Overview  What is a confidentiality model  Bell-LaPadula Model  General idea  Informal description of rules  Formal description.
CMSC 414 Computer and Network Security Lecture 13 Jonathan Katz.
Security Fall 2009McFadyen ACS How do we protect the database from unauthorized access? Who can see employee salaries, student grades, … ? Who can.
November 1, 2004Introduction to Computer Security ©2004 Matt Bishop Slide #5-1 Chapter 5: Confidentiality Policies Overview –What is a confidentiality.
CSCI 5707: Database Security Pusheng Zhang University of Minnesota March 2, 2004.
CMSC 414 Computer and Network Security Lecture 11 Jonathan Katz.
Sicurezza Informatica Prof. Stefano Bistarelli
User Domain Policies.
View n A single table derived from other tables which can be a base table or previously defined views n Virtual table: doesn’t exist physically n Limitation.
CMSC 414 Computer and Network Security Lecture 19 Jonathan Katz.
1 Introduction to Information Security , Spring 2014 Lecture 3: Access control (cont.) Eran Tromer Slide credits: John Mitchell, Stanford Max.
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.
1 A pattern language for security models Eduardo B. Fernandez and Rouyi Pan Presented by Liping Cai 03/15/2006.
Polyinstantiation Problem
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.
Security+ All-In-One Edition Chapter 19 – Privilege Management Brian E. Brzezicki.
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.
Chapter 5 Network Security
Chapter 11 Database Security: An Introduction Copyright © 2004 Pearson Education, Inc.
CMSC 414 Computer (and Network) Security Lecture 11 Jonathan Katz.
Access Control MAC. CSCE Farkas 2 Lecture 17 Reading assignments Required for access control classes:  Ravi Sandhu and P. Samarati, Access Control:
Lattice-based Access Control Models 2 Daniel Trivellato.
Trusted OS Design and Evaluation CS432 - Security in Computing Copyright © 2005, 2010 by Scott Orr and the Trustees of Indiana University.
Secure Operating Systems Lesson 4: Access Control.
Information Security CS 526 Topic 17
Chapter 11 Database Security: An Introduction Copyright © 2004 Pearson Education, Inc.
COEN 350: Network Security Authorization. Fundamental Mechanisms: Access Matrix Subjects Objects (Subjects can be objects, too.) Access Rights Example:
Trusted Operating Systems
Computer Security: Principles and Practice
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.
Database Security. Introduction to Database Security Issues (1) Threats to databases Loss of integrity Loss of availability Loss of confidentiality To.
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.
22 feb What is Access Control? Access control is the heart of security Definitions: * The ability to allow only authorized users, programs or.
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.
IST 210 Security. IST 210 Introduction to DB Security Secrecy: Users should not be able to see things they are not supposed to. E.g., A student can’t.
9- 1 Last time ● User Authentication ● Beyond passwords ● Biometrics ● Security Policies and Models ● Trusted Operating Systems and Software ● Military.
MLS/MCS on SE Linux Russell Coker. What is SE Linux? A system for Mandatory Access Control (MAC) based on the Linux Security Modules (LSM) framework Uses.
Security Architecture and Design Chapter 4 Part 4 Pages 377 to 416.
SE Linux Implementation Russell Coker. What is SE Linux? A system for Mandatory Access Control (MAC) based on the Linux Security Modules (LSM) framework.
Database System Implementation CSE 507
Access Control Model SAM-5.
Access Control CSE 465 – Information Assurance Fall 2017 Adam Doupé
Access Control Models EN Lecture Notes Fall 2016.
Executive Director and Endowed Chair
Mandatory Access Control (MAC)
Information Security CS 526 Topic 17
Advanced System Security
Chapter 5: Confidentiality Policies
IS 2150 / TEL 2810 Information Security & Privacy
Advanced System Security
Presentation transcript:

EN Lecture Notes Spring 2016 ACCESS CONTROL MODELS

MANDATORY ACCESS CONTROL MAC is a form of “multi-level” access controls. The basic idea is that there are different classifications on the data For example, secret, top secret, etc. The data cannot be accessed except by a principal with a clearance as high as the data This is NOT like *nix file permissions Policy is administered centrally by a security officer Users cannot grant access to a file (no chmod r+w) *nix is an example of “discretionary access control” or DAC Enforced security independent of user actions is the essence of MAC

SECURITY POLICIES AGAIN Remember our early lecture: threat model, security policy, security mechanisms Security policy is often the element most poorly executed It needs to express clearly and precisely what needs to be protected Unfortunately, it is often a collection of “vapid” statements For a new product, you may need to design from scratch But, many times, you can choose from existing policies The hard part becomes choosing the right one

BELL-LAPADULA (BLP) Design emerged from military document classification Enforces two properties Simple Security Property: No Read Up (NRU) *-Property: No Write Down (NWD) The *-property was the big innovation of BLP. It assumed trojans and buggy code! This is a well defined security policy It is relatively easy to determine if the mechanisms enforce the policy If it’s the right policy it works great!

CRITICISMS OF BLP If the security officer can “temporarily declassify” all of the protections go away Strong tranquility: security labels never change during operation Weak tranquility: labels never change in a way that violates security policy The idea here is “least privilege”. Even if you have TS, start at unclassified As you access info that is higher, your level increases The system can get fragmented into pieces that can’t communicate Also, what do you do with an App that has to straddle? A document editor used to redact a TS document to Classified Doesn’t deal with creation of subjects or objects

TYPE ENFORCEMENT VARIATION Expands on BLP by having subjects assigned to domains and objects to types A domain/domain matrix defines how subjects interact with each other A domain/type matrix defines how subjects interact with objects SE linux is built on this idea, but subjects and objects are assigned types The matrix is pairs of types and the security properties associated This is great, but it leads to a “state explosion” that is hard to reason about SE linux also includes a simpler MLS policy to help maintain security

ROLE-BASED ACCESS CONTROL (RBAC) User’s permissions aren’t based on names, but on their role This allows for more fine-grained controls on users User A acting in role 1 User A acting in role 2

THE BIBA MODEL Upside-down BLP You can only read up and write down The goal is integrity not confidentiality Partially used in Vista. Uses the NoWriteUp. Most files are “medium” or higher. IE is “low” So, things downloaded can read most files, but not write to them! This was the first formal model of integrity Struggled in real-world because of the exceptions and straddling issues

MISC Anderson is full of additional MLS details Historical MLS systems Future MLS systems Vista Virtualization You should review these for your own learning, but not on the test The data pump, however, might be useful to you in PLAYGROUND If you do MLS, you can pump data from low security to high But if it’s one way, how do you do acknowledgements?!

WHAT GOES WRONG IN MLS? Composability is always hard Anderson gives an interesting xor example where feedback results in high data getting released low The example is very academic but illustrates the problem of composition Composition, remember? The Google break? Cross-site Scripting? It’s easy if there is no feedback, but feedback happens more often than you think Variant: Cascading, or combining two security systems to break a policy Covert channels that allow High to signal to Low Polyinstantiation – High and Low both try to create a file of the same name

MULTILATERAL SECURITY In commercial projects, the bigger problem is not data up and down, but across The marketing department should not have access to R&D The problem is, again, centralization It makes a bigger target AND give more people access to it…

THE LATTICE MODEL Military uses multilateral security too adding code-words to secrets In WW2, the allies broke the enigma enciphering machine This information was so sensitive, that only a few people could have access This set of people, though small, covered different classifications The code word “Ultra” was applied People with this label could not be placed in any area with a risk of capture Lattice is classifications + code words Same as BLP for up and down But zero information moving between “compartments”

THE PROBLEM OF SHARING The Lattice model does a good job of preventing information flow But what to do when information needs to flow? You can create yet another compartment, but this leads to label explosion You can rely on a trusted “guard” that allows information to flow But this increases the amount of “trust” in the system This system breaks regularly

CHINESE WALL MODEL Derived from rules in banks to prevent conflicts of interest It begins with a free choice: choose A or B But not both! This last part is the Mandatory component It has some great properties, but often requires manual enforcement

INFERENCE Information sharing often involves some kind of “scrubbing” In MLS, a report is redacted before moving down a security layer In Multi-lateral security, data is often anonymized The problem, of course, is inference People can often be identified by their medical records even with names removed And, of course, we’ve seen this with AOL and Google

INFERENCE CONTROL Characteristic formula – the query instructions to get some set Query set – the set produced by a characteristic formula Elementary set – the smallest set produced by the AND of all available fields Sensitive Statistics – stats that deanonymize information: For example, if the set is too small, than we’ve identified an individual by attributes

QUERY SIZE You can limit how small a result is from a query But you also have to worry about returning N-1!! Also, you have to deal with using multiple queries to get a smaller than N intersection

CUSTOM TRACKERS A special formula that identifies an individual For example, if there is only one female professor Determine her salary by asking: Average salary of professors? Average salary of male professors? Solutions? Limit the number of attributes that can be used on a query Trying to audit a user’s queries (track a user so they can’t get info by intersecting) Doesn’t work really. Too complex and doesn’t deal with collusion

ACTIVE ATTACKS Attacker can insert and delete records in the database Allows them to bypass query size controls for example