Domain 3: Security Architecture and Engineering Flashcards

1
Q

Memory Protection

A

Prevents one program from referencing memory not specifically assigned to it.
o If a program attempts to reference a memory address it is not permitted to access, the system blocks the access, suspends the program, and transfers control to the operating system.

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

ISO/IEC 19249 (5 design principles)

A

o Least privilege
o Attack surface minimization
o Centralized parameter validation
o Centralized general security services
o Preparing for error and exception handling

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

ISO/IEC 19249 (5 architectural principles)

A

o Domain Separation
o Layering
o Encapsulation
o Redundancy
o Virtualization

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

Zero Trust Principles (3)

A

o Always verify
o Use least privilege access
o Assume breach

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

Privacy by Design (7 principles)

A

1 - Proactive not Reactive; Preventative not Remedial
2 - Privacy as the Default Setting
3 - Privacy Embedded into Design
4 - Full Functionality — Positive-Sum, not Zero-Sum
5 - End-to-End Security — Full Lifecycle Protection
6 - Visibility and Transparency — Keep it Open
7 - Respect for User Privacy — Keep it User-Centric

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

Bell-LaPadula Model Rules

A

o Simple Security Property - No read up
o Star Property - No write down
o Discretionary-Security Property

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

Bilba Integrity Model Rules

A
  • Simple Integrity Property - No read down
  • Star Integrity Property - No write up
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Clark-Wilson Model (2 Concepts & 4 Terms)

A
  • Well-formed transaction is that subjects are constrained to make only those changes that maintain the integrity of the data.
  • Separation of duties
    • Constrained data item (CDI) - This is the key data type in the Clark– Wilson model, and it refers to data whose integrity must be preserved.
    • Unconstrained data item (UDI) - This includes all data other than CDIs, typically system inputs.
    • Integrity verification procedures (IVPs) - These procedures check and ensure that all CDIs are valid.
    • Transformation procedures (TPs) - These procedures enforce a system’s integrity policy and maintain the integrity of CDIs.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Brewer-Nash Model

A

Subject can right to an object if and only if the subject cannot read another object in a different data set.

Prevents conflict of interest.

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

Secure Cryptoprocessor

A

Hardware modules that are resistant to tampering and have a limited interface, making it easier to verify the integrity and secure operation of the (limited) code running on the cryptoprocessor.

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

Trusted Platform Module (TPM) & 3 Functions

A

Secure Cryptoprocessor that provides secure storage and cryptographic services as specified by iSO/IEC 11889. It has three core functions:
- Attestation: Creates a cryptographic hash of the system’s known good hardware and software state, allowing third-party verification of the system’s integrity
- Binding: Encrypts data using a cryptographic key that is uniquely associated with (or bound to) the system
- Sealing: Ensures that ciphertext can be decrypted only if the system is attested to be in a known good state

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

Full-disk Encryption

A

At the lowest level protects all the data on the storage media, protecting against the physical theft or loss of the drive itself.
It provides no protection from threat actors who have logical access to the system.

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

Filesystem-level encryption

A

Allows the encryption to occur at the filesystem level.

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

Transparent data encryption (TDE)

A

Protects the data from those who have direct access to the filesystem (i.e., the “root” user), but do not have permission to access the database system and the specific database item.
- Is not intended to be used alone as it doesn’t protect against malicious users (disgruntled admins, SQL Injection, etc.).

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

Cell-level encryption (CLE)

A

Encrypts database information at the cell or column level. With this approach, data remains encrypted when read from the database and is decrypted only when requested.
- Can be cumbersome to processing

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

Symmetric Key Encryption

A

AKA Secret Key Encryption
- Uses the same key to encrypt and decrypt
- More convenient, but less secure as you have to share the key.

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

Asymmetric Encryption

A

AKA: Public key encryption
- Uses a public private key pair. Encrypting with your private key provides non-repudiation

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

Stream Cipher

A

Encryption algorithm that works one character or bit at a time.

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

Block Cipher

A

A deterministic algorithm that takes a fixed-sized block of bits and a key value and produces an encrypted block of the same size as the plaintext block.

20
Q

Block Cipher Types

A

|Name | Size | Key Size | Rounds|
|DES | 64 | 56 | 16|
|AES-128 | 128 | 128 | 10|
|AES-192 | 128 | 192 | 12|
|AES-256 | 128 | 256 | 14|

21
Q

Data Encryption Standard Types

A
  • Electronic Code Book (ECB)
  • Cipher Block Chaining (CBC)
  • Cipher Feedback (CFB)
  • Counter (CTR)
  • Triple DES
22
Q

DES-ECB

A

The simplest and weakest form of DES; no initialization vector or chaining; identical plaintexts with identical keys encrypt to identical ciphertexts.

23
Q

DES-CBC

A

Cipher Block Chaining (CBC): A block mode of DES; XORs the previous encrypted block of ciphertext to the next block of plaintext to be encrypted; first encrypted block is an initialization vector that contains random data.
- Weakness: the “chaining” destroys patterns.

24
Q

DES-CFB

A

Very similar to CBC; the primary difference is CFB is a stream mode; uses feedback (the name for chaining when used in stream modes) to destroy patterns; like CBC, CFB uses an initialization vector and destroys patterns, and errors propagate.

25
Q

DES-CTR

A

Like OFB; the difference again is the feedback: CTRmode uses a counter; shares the same advantages as OFB (patterns are destroyed and errors do not propagate) with an additional advantage: since the feedback can be as simple as an ascending number, CTR mode encryption can be done in parallel.

26
Q

DES-Triple DES

A

Applies DES encryption three times per block; FIPS 46-3 describes “Encrypt, Decrypt, Encrypt” (EDE) order using three keying options: one, two, or three unique keys (called 1TDES EDE, 2TDES EDE, and 3TDES EDE, respectively).

27
Q

Advanced Encryption Standard (AES)

A
  • 128-bit (with 10 rounds of encryption)
  • 192-bit (12 rounds of encryption) or
  • 256-bit (14 rounds of encryption) keys to encrypt 128-bit blocks of data.
28
Q

Rivest Ciphers

A

• RC2 is a block cipher that uses a 64-bit block size and a variable-length key. RC2 is vulnerable to chosen-plaintext attacks and should not be used.
• RC4 is a stream cipher used in internet protocols such as TLS and SSH, with variable length, ranging from 40 to 2048 bits. RC4 is not considered secure and should not be used, although it still is in many places.
• RC5 is like the RC2 block cipher, but with a variable block size (32, 64, or 128 bits) and variable key size (0 to 2040 bits). RC5 is considered secure with sufficient rounds of encryption.
• RC6 is a derivative of RC5 that uses a 128-bit block size and variable length keys (128, 192, or 256 bits). RC6 is an improvement upon RC5 and is a secure algorithm.

29
Q

Diffie-Hellman key agreement protocol

A

AKA Diffie-Hellman Key Exchange allows two parties to securely agree on a symmetric key via a public channel.

30
Q

Elliptic Curve Cryptography (ECC)

A

One-way function that uses discrete logarithms as applied to elliptic curves. Algorithms based on Elliptic Curve Cryptography (ECC) are much stronger per bit than systems using discrete logarithms. Requires less computational resources because shorter keys can be used compared to other asymmetric methods.

31
Q

Public Key Infrastructure (PKI)

A

Leverages all three forms of encryption (symmetric, asymmetric, and one-way hash) to provide and manage digital certificates.

32
Q

Certificate Authorities

A

Issues digital certificates and authenticates the identity of a person or organization before issuing a certificate.

33
Q

Digital Signatures

A

Used to cryptographically sign documents and provide nonrepudiation, which includes authentication of the identity of the signer, and proof of the document’s integrity.

Use a hash function to generate a hash value of the plaintext. Create the digital signature by encrypting the hash with a private key. Digital signatures provide authentication and integrity, which forms nonrepudiation. They do not provide confidentiality: the plaintext remains unencrypted.

  • Vulnerabilities: Hash collision, Private key, and CA compromise
34
Q

Hash Function

A

An algorithm that takes a block of data (i.e., a message or file) and computes a derived value such that any change to the data will result in a change to the hash value.
- Provides encryption using an algorithm and no key.
- Primarily used to provide integrity: if the hash of a plaintext changes, the plaintext itself has changed.

35
Q

Checksum

A

A mathematical function that takes a block of data and calculates a number (the checksum) in a manner such that any single change to the block of data will cause the checksum number to change.

36
Q

Hash Collision

A

Hashes are not unique, because the number of possible plaintexts is far larger than the number of possible hashes. More than one document could have the same hash: this is called a collision.`

37
Q

MD5

A

Creates a 128-bit hash value based on any input length.
- Considered cryptographically broken, but it can be used safely as a checksum.

38
Q

Hash-based Message Authentication Code (HMAC)

A

Concatenates a secret key (which has been XORed with a string to pad it to a fixed length) and hashes that. It then takes that hash, combines it with the key again, and hashes it a second time, producing the HMAC value. HMAC is a less complex method of ensuring message integrity and authentication, but with the overhead of sharing a symmetric cipher key

39
Q

Evidence Storage Controls

A
  • Strict policies surrounding who is permitted access
  • Video Monitoring
  • Double locks on the evidence storage doors
40
Q

Environmental Controls

A

Power, HVAC, and fire safety are considered environmental controls

41
Q

Class A Fires

A
  • Organic Materials (e.g., paper, wood, and
    plastic)
  • Extinguisher Types: Water, Foam, Dry Powder, and Wet Chemical
42
Q

Class B Fires

A
  • Class B: Flammable liquids (e.g., gasoline)
  • Extinguisher Types: Foam, Dry Powder, and CO2
43
Q

Class C Fires

A
  • Flammable Gases
  • Dry Powder is the only extinguisher type.
44
Q

Class D Fires

A
  • Combustible metals (e.g., lithium metal, but not
    lithium-ion batteries, which are considered Class B)
  • Dry Powder only extinguisher type
45
Q

Electrical Equipment Fires

A
  • Computers and Servers
  • Dry Powder and CO2 only extinguisher Type
46
Q

Class F/K Fires

A
  • Cooking oils and greases
  • Wet Chemical only extinguisher type.