Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

- > Domain 3: Security Engineering and Architecture > Flashcards

Domain 3: Security Engineering and Architecture Flashcards

1
Q

Common Criteria

A

Structured methodology for documenting security requirements, documenting and validating. Based on ISO 15408

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

Protection Profile

A

Specifies the security requirements and protections of a product that is to be evaluated. Organised around TCB entities. Evaluation Assurance Levels (EAL)

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

Evaluation Assurance Levels (EAL)

A

EAL0 - Inadequate assurance
EAL1 - Functionally tested
EAL2 - Structurally tested
EAL3 - Methodically tested and checked
EAL4 - Methodically designed, tested, and reviewed
EAL5 - Semi formally designed and tested
EAL6 - Semi formally verified design and tested
EAL7 - Formally verified design and tested

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

Target of Evaluation (TOE)

A

The target for the product

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

Protection Profile (PP)

A

Set of security requirements of TOE

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

Security Functional Requirements (SFRs)

A

Specific individual security functions

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

Engineering principles for IT Security

A

Use NIST SP 800-27

  • Initiation; need expressed, purpose documented, impact assessment
  • Development/Acquisition; system designed, purchased, programmed, developed or constructed
  • Implementation; system tested and installed, certification
  • Operation/Maintenance; performs function, security operations, audits
  • Disposal; disposition of information, HW and SW

Physical controls are your first line of defense, and people are your last

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

OS Kernel

A

Loads and runs binary programs, schedules task swapping, allocated memory and tracks physical location of files on computers hard disk, manages IO/OP requests from software, and translates them into instructions for CPU

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

Primary storage

A

Temporary storage area for data entering and leaving the CPU

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

Random Access Memory

A

Temporary holding place for data used by the OS. It is volatile. Two types of RAM exist: Dynamic and Static. Dynamic RAM needs to be refreshed periodically, while Static RAM’s data does not need to be refreshed

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

ROM

A

Read only memory is non-volatile which means when a computer is turned off the data is not lost. EEPROM can be altered

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

Process States

A
  • Stopped: process finishes or must be terminated
  • Waiting: the process is ready for continued execution but is waiting for a device or access request
  • Running: executes on the CPU and keeps going until it finishes; its time slice expires, or it is blocked
  • Ready; process prepared to executve when CPU ready
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Multitasking

A

Execute more than one task at the same time

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

Multitasking

A

More than one CPU is involved

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

Multiprocessing

A

More than one CPU is involved

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

Multi-Threading

A

Execute different parts of a program simultaneously

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

Single state machine

A

Operates in the security environment at the highest level of classification of the information within the computer. In other words, all users on that system must have clearance to access the info on that system.

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

Multi state machine

A

Can offer several security levels without risk of compromising the system’s integrity

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

CICS

A

Complex instructions. Many operations per instruction. Less number of fetches

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

RISC

A

Reduced instructions. Simpler operations per instructions. More fetches

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

Generations of Software

A 
1st Gen: Machine Language
2nd Gen: Assembler
3rd Gen: FORTRAN: C++
4th Gen: Natural/focus and SQL
5th Gen: Prolog, list artificial intelligence languages based on logic
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

Memory Segmentation

A

Dividing memory into segments

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

Protection Keying

A

Numerical values, divides physical memory up into particular sized blocks, each of which has an associated numerical value called a protection key

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

Paging

A

Divides memory address space into even sized blocks, called pages. To emulate that we have more RAM than we have. System kernel knows the location of the page file.

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

DEP

A

Data Execution Prevention: A system level memory protection feature that is built into the OS DEP prevents code from being run from different pages, such as default heap, stacks, and memory pools

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

ITIL

A

Best practices for IT operations, including change management and configuration management.

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

Security Models

A

Defines allowed interaction between subjects and objects at a particular moment in time

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

State Machine Model

A

Describes a system that is always secure no matter what state it is in. If all aspects of a state meet the requirements of the security policy, that state is considered secure. A transition occurs when accepting input or producing output. A transition always results in a new state (also called a state transition). A secure state machine model always boots into a secure state, maintains a secure state across all transitions, and allows subjects to access resources only in a secure manner compliant with the security policy.

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

Information Flow Model

A

Based on state machine model, the Bell LaPadula and Biba models are both information flow models. Information flow models are designed to prevent unauthorised, insecure, or restricted information flow, often between different levels of security (these are often to as multilevel models). The information flow model also addresses covert channels by specifically excluding all non-defined flow pathways.

30
Q

Noninterference Model

A

Loosely based on information flow model. Focuses on actions of a subject at a higher security level affect the system state or the actions of a subject at a lower security level. Basically, the actions of subject A (high) should not affect the actions of subject B (low) or even be noticed by subject B. The noninterferance model can be imposed to provide a form of protection against damage caused by malicious programs such as trojan horses.

31
Q

Confinement

A

Restricts actions of a program. Process confinement allows a process to read from and write to only certain memory locations and resources. This is known as sandboxing.

32
Q

Bounds

A

A process consist of limit set on the memory addresses and resources it can access. The bounds state the area within which a process is confined or contained

33
Q

Isolation

A

When a process is confined through enforcing access bounds that process runs in isolation. Process isolation ensures that any behaviour will affect only the memory and resources associated with the isolated process.

34
Q

Matrix Model

A

Provides access rights to subjects for objects, access rights are read, write and executed. Columns are ACL’s, rows are capability lists, and supports discretionary access control

35
Q

Bell LaPadula

A

Focused on preventing information flow from a high security level to a low security level. Confidentiality model, developed by DOD.

  • Cannot read up, cannot write down
  • Tranquillity principle prevents security levels of subjects from being changed once they are created
36
Q

BIBA Model

A

Integrity model. Focused on protecting objects from external threat, by preventing information flow from a low security level to a high security level.

  • Cannot read down
  • Cannot write up
37
Q

Clark Wilson

A

Integrity model, which enforces access to objects only through programs.

38
Q

Information Flow Model

A

Each object is assigned a security class and value, and information is constrained to flow in the directions that are permitted by the security policy. Thus flow of information from one security level to another.

39
Q

Brewer and Nash

A

Provides dynamic access control based on user’s previous actions. Prevents conflict of interests from members of the same organisation to look at information that creates a conflict of another member of that organisation. THINK OF STOCK MARKETS

40
Q

Lipner Model

A

Combines Bell LaPadula and Biba model

41
Q

Graham-Denning

A

Focused on relationship between subjects and objects

42
Q

Take Grant

A

Uses a direct graph to specify the rights that subjects can transfer to objects or that subjects can take from other objects.
Uses STATES and STATE Transitions

  • Take Rule: Allows a subject to take rights over an object
  • Grant Rule: Allows a subject to grant rights to an object
  • Create Rule: Allows a subject to create new rights
  • Remove Rule: Allows a subject to remove its own rights
43
Q

Composition Theory

A

Three recognised types of composition theories:

  1. Cascading: input for one system comes from the output of another system
  2. Feedback: One system provides input to another system, which reciprocates by reversing those roles (so that system A first provides input for system B and then system B provides input to system A).
  3. Hookup: One system sends input to another system but also sends input to external entities.
44
Q

MAC

A

Subjects are labelled as to their level of clearance. Objects are labelled as to their level of classification or sensitivity.

45
Q

Subjects

A

Entity who can perform work tasks, such as users, data owners (protect data), and data custodian (classify and protect data)

46
Q

ITSEC

A

The Information Technology Security Evaluation Criteria refers to any system being evaluated as a target of evaluation. It is used in Europe only. Addresses CIA. It evaluates functionality and assurance separately. Assurance from E0 to E6 (highest), and F1 to F10 (highest). Therefore, a system can provide low assurance and high functionality or vice-versa.

Does not rely on the notion of a TCB, and it doesn’t require that a system’s security components be isolated within a TCB. Includes coverage for maintaining targets of evaluation after changes occur without requiring a new formal evaluation.

47
Q

Certification

A

Is evaluation of security features and safeguards if it meets the requirements. Certification is the comprehensive evaluation of the technical and nontechnical security features of an IT system and other safeguards made in support of the accreditation process to establish the extent to which a particular design and implementation meets a set of specified security requirements.

48
Q

Accreditation

A

The formal declaration by the designated approving authority (DAA) that an IT system is approved to operation in a particular security mode using a prescribed set of safeguards at an acceptable level of risk. Once accreditation is performed, management can formally accept the adequacy of the overall security performance of an evaluated system.

49
Q

System Accreditation

A

A major application or general support system is evaluated

50
Q

Site Accreditation

A

The applications and systems at a specific, self-contained location are evaluated

51
Q

Type Accreditation

A

An application or system that is distributed to a number of different locations is evaluated

52
Q

TCSEC: Orange Book

A

Trusted Computer System Evaluation Criteria. From the US DoD, it evaluates operating systems, application, and systems. It doesn’t touch the network part. It only addresses confidentiality.

  • ITSEC: 1, TCSEC: D: Minimal protection, any system that fails higher levels
  • ITSEC 2, TCSEC C1: DAC (identification, authentication, and resource protection).
  • ITSEC 3, TCSEC C2: DAC (controlled access protection (object reuse, protect audit trail))
  • ITSEC 4, TCSEC B1: MAC (security labels, based on Bell LaPadula security model. Labeled security process, isolation, devices.
  • ITSEC 5, TCSEC B2: MAC, strucutred protection. Seperate operation/admin roles. Configuration management.
  • ITSEC 6, TCSEC B3: MAC, security domain (trusted recovery), monitor event and notification.
  • ITSEC 7, TCSEC A; mac; formal verified protection
53
Q

Rainbow Series

A

Red= trusted network, Orange = TCSEC evaluation, Brown = trusted facilities management, Tan=audit, Aqua=glossary, Green=password management

54
Q

ISO 27001

A

Focused on the standardisation and certification of an organisation’s information security management system (ISMS), security governance, a standard, ISMS. Info security minimum systems

55
Q

ISO 27002

A

A guideline which lists security control objectives and recommends a range of specific controls.

56
Q

COBIT 5

A

Based on five key principles for governance and management of enterprise IT:

  1. Meeting stakeholder needs
  2. Covering the enterprise end-to-end
  3. Applying a single, integrated framework
  4. Enabling a holistic approach
  5. Separating governance from management. COBIT is used not only to plant the IT security of an organisation but also as a guideline for auditors.
57
Q

Virtualisation

A

Used to host one or more OS’s within memory of a single host computer. Such an OS is also known as a guest OS. From the perspective that there is an orgiinal or host OS installed directly on the hardware, the additional OS’s hosted by the hypervisor are guests.

58
Q

VM

A

Virtual Machine. Simulated environment created by the OS to provide a safe and efficient place for programs to execute.

59
Q

Virtual SAN

A

Software defined shared storage system is a virtual re-creation of a SAN on top of a virtualised network or an SDN.

60
Q

TOCTTOU Attack

A

Race condition exploits, and communication disconnects are known as state attacks because they attack timing, data flow control, and transition between one system state to another.

61
Q

RACE

A

Two or more processes require access to the same resource and must complete their tasks in the proper order for normal functions.

62
Q

Register - Memory

A

Small memory in CPU that directly provide accessible memory locations that the brain of the CPU (ALU) uses when performing calculations

63
Q

Stack Memory Segment

A

Used by processors to communicate instructions and data to each other

64
Q

Monolithic OS Architecture

A

All the code working in kernel mode in an ad hoc and non-modularised OS

65
Q

Memory Addressing

A

When using memory resources, the processor must have some means of referring to various locations in memory. The solution to this problem is known as addressing.

66
Q

Register Addressing

A

When the CPU needs information from one of its registers, it uses a register address (e.g. register 1) to access its content

67
Q

Immediate Addressing

A

A way to refer to data, such as immediate addressing where the CPU is told to add 2 to the value in the register

68
Q

Direct Addressing

A

The CPU is provided with actual address of the memory location to access. The address must be located on the same memory page as the instruction being executed.

69
Q

Indirect Addressing

A

Similar to direct addresing. However, the memory address supplied to the CPU as part of the instruction doesnt contain the actual value that the CPU is to use as an operand. The CPU reads the indirect address to learn the address where the desired data resides and then retrieves the actual operation from that address.

70
Q

Base + Offset Addressing

A

Uses a value stored in one of the CPU’s registers as the base location from which to begin counting. The CPU then adds the offset supplied with the instruction to that base address and retrieves the operaand from that computed memory location.

71
Q

PaaS

A

Platform as a Service.

- (8 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions