Domain 3: Security Models Flashcards

1
Q
  • Reading down occurs when a subject reads an object at a lower sensitivity level
  • i.e. top secret subject reading a secret object
  • i.e. Bell-LaPadula
A

Reading Down and Writing Up

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q
  • Provides confidentiality of objects

- Users at lower security level are denied access to objects at a higher security level

A

Bell-LaPadula

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q
  • Bell-LaPadula Property

- “No read up”; a subject at a specific clearance level cannot read an object at a higher classification level

A

Simple Security Property

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q
  • Bell-LaPadula Property

- “No write down”; a subject at a higher clearance level cannot write to a lower classification level.

A

*(star) Security Property

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q
  • Bell-LaPadula Property

- States that the system uses an access matrix to enforce access control

A

Discretionary Security Property

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q
  • Bell-LaPadula Property

- Security labels will not change while the system is operating

A

Strong Tranquility Property

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q
  • Bell-LaPadula Property

- Security labels will not change in a way that conflicts with defined security properties

A

Weak Tranquility Property

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q
  • Subjects can only access objects that fall into a range between the least upper bound and the highest lower bound.
A

Lattice-based access control

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

The the nearest security label or classification higher than their lattice position

A

Least upper bound

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

The the nearest security label or classification lower than their lattice position

A

Highest lower bound

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q
  • Describes a system that is always secure no matter what state it is in
  • Based on computer science definition of finite state machine (FSM)
A

State Machine Model

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Security model designed to prevent unauthorized , insecure or restricted information flow, between different levels of security

A

Information Flow Model

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Security model that prevents actions from a subject at a higher security level to not affect actions at a lower security level or even be noticed

A

Noninterference Model

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Security model that deploys a graph that dictates how rights can be passed from one subject to another or from a subject to an object

A

Take-Grant Model

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q
  • Prevents modification of objects by unauthorized subjects
  • Prevents unauthorized modification of objects by authorized subjects
  • Protect internal object consistency
  • Integrity model
A

Biba Model

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q
  • “No read down”; a subject at a specific clearance level cannot read data at a lower classification
  • Biba rule
A

Simple Integrity Axiom

17
Q

“No write up”; a subject at a specific clearance level cannot write data to a higher classification

A

*Integrity Axiom

18
Q
  • Uses a three-part relationship subject/program/object
  • A subject is only able to access objects through a program, interface, or access portal
  • Integrity model
A

Clark-Wilson

19
Q

Any data item whose integrity is protected by the Clark-Wilson security model

A

Constrained data item (CDI)

20
Q

Any data item that is not controlled by the Clark-Wilson security model

A

Unconstrained data item (UDI)

21
Q
  • Procedure that scans items and confirms their integrity

- Clark-Wilson procedure

A

Integrity Verification Procedure (IVP)

22
Q
  • Only procedures that are allowed to modify a CDI

- Clark-Wilson procedure

A

Transformation procedures (TPs)

23
Q
  • Subjects at one classification level will see one set of data and have access to one set of functions; whereas another subject at a different classification level will see a different set of data and have access to a different set of functions.
  • Part of Clark-Wilson model
A

Restricted Interface model

24
Q
  • Security model designed to prevent conflict of interests
  • i.e. A consultant who has access to Company A should not also have access to similar data for Company B if these two companies compete with each other
A

Brewer and Nash (aka Chinese Wall)

25
Q
  • Table that defines the access permissions that exist between subjects and objects
  • i.e. ACLs
A

Access Control Matrix

26
Q
  • Security model that predetermines a list of objects that a subject can access
  • Subjects are allowed only to perform predetermined actions against predetermined objects
  • Based on automation theory and domain separation
  • Noninterference model
  • Integrity model
A

Goguen-Meseguer Model

27
Q
  • Prevents interference in support of integrity
  • Security model that defines a set of system states, initial states, and state transitions. Through this integrity is maintained and interference is prohibited.
  • Integrity model
A

Sutherland Model

28
Q
  • Security model that focuses on the secure creation and deletion of both subjects and objects
  • Specific permissions of a subject over a set of objects is defined in the access control matrix
A

Graham-Denning Model

29
Q

Variant of phishing that targets senior or high level execs in a company

A

Whaling

30
Q
  • Combines elements of Bell-Lapula and Biba
  • Protects confidentiality and integrity
  • Assigns one of two security levels to each subject: system manager or anyone else
A

Lipner security architecture model

31
Q
  • Extend the Graham-Denning Model by including integrity protection that prevents a subject or object from being created if it already exists in the access control matrix
  • Does not allow deletion of a subject or object if it didn’t previously exist
A

Harison-Ruzzo Ullman