Karteikarten im Karteikarten-Set

Noch nicht gestartet (20)

3 main security goals 

  • confidentiality
  • integrity
  • availability

Integrity Definition

Only authorized entities can make changes assets in a system

Eavesdropping

Interception (abfangen) of data during transfer

Traffic Analysis

Analyze address information or timings to deduce (ableiten) who communicates with whom

Targeting Confidentiality 2 examples

  • Traffic Analysis
  • Eavesdropping


Targeting Integrity 4 examples

  • Modification
  • Masquerading
  • Replay
  • Repudiation


Modification

Intercept and Modify data in transfer

Replay (targeting integrity)

Intercept (abfangen) a data packet in transfer and later replay it (ausführen)

Confidentiality Definition

Only authorized entities can access assets in a system

Availability Definition

Authorized entities can access assets in a system as intended

Masquerading

Modify SCR address information of a data packet in transfer

Repudiation (Zurückweisung)

Deny (verleugnen) an action such as having sent a specific data packet

Security Mechanism

A mechanism that is designed to detect, prevent, recover from or deter an attack against an asset of a system

Security Service

A service that protects the security goals of a system

Makes use of one or more security mechanisms

Types of attackers / Motivations

  • Criminals and Hack-for-Hire
  • Hacktivists and Crackers
  • Secret Service and Military
  • End Users
  • Pentesters

Typical Sources for Vulnerabilities in Protocols and Specifications

  • Design Flaws
  • Backwards Compatibility Problems
  • Incomplete Specifications

Typical Sources for Vulnerabilities in Implementations

  • Software Vulnerabilities
  • Update Life Cycle
  • Insecure Default Settings

Examples for Users and Administrators as Vulnerabilities

  • Failing to update available software patches
  • Deliberately installing malicious software
  • Social Engineering

A hash function is second preimage resistent ...

... if given x, h(x) it is computationally infeasible to find a second pre-image x' ≠ x with h(x') = h(x)

A hash function is collision resistent ...

... if it is computationally infeasible to find a pair x',x with x' ≠ x and h(x') = h(x)