Академический Документы
Профессиональный Документы
Культура Документы
IT/IS Security
Week 01 :
Chapter 01 : Overview of Computer Security Concepts
Chapter 02 : Cryptographic Tools
by
Berkah I. Santoso
Bakrie University
2015
Chapter 1
Overview
Chapter 01
Integrity
guarding against
improper
information
modification or
destruction,
including ensuring
information
nonrepudiation
and authenticity
Chapter 01
Availability
ensuring timely
and reliable access
to and use of
information
Table 1.1
Computer
Security
Terminology
RFC 2828, Internet
Security Glossary,
May 2000
Chapter 01
Figure 1.2
Security Concepts and Relationships
Chapter 01
Vulnerabilities, Threats
and Attacks
categories of vulnerabilities
corrupted (loss of integrity)
leaky (loss of confidentiality)
unavailable or very slow (loss of availability)
threats
capable of exploiting vulnerabilities
represent potential security harm to an asset
Countermeasures
means used to deal with
security attacks
prevent
detect
recover
Chapter 01
10
Table 1.2
Threat
Consequences
Chapter 01
11
Figure 1.3
Scope of Computer Security
Chapter 01
12
Table 1.3
Computer and Network Assets
Examples of Threats
Chapter
01 with Examples of Threats.
Table 1.3 Computer and Network
Assets,
13
eavesdropping/monitoring transmissions
difficult to detect
emphasis is on prevention rather than detection
two types:
release of message contents
traffic analysis
masquerade
replay
modification of messages
denial of service Chapter 01
14
S
e
c
u
r
i
t
y
R
e
q
u
i
r
e
m
e
n
t
s
Chapter 01
15
Chapter 01
configuration management;
incident response; and media
protection
16
17
Security Services
X.800
RFC 2828
defines a security
service as a service
that is provided by a
protocol layer of
communicating open
systems and ensures
adequate security of
the systems or of data
transfers
defines a security
service as a processing
or communication
service that is provided
by a system to give a
specific kind of
protection to system
resources; security
services implement
security policies and are
implemented by security
mechanisms
Chapter 01
18
Table 1.5
Security
Services
Chapter 01
Source: From X.800, Security Architecture for OSI
19
Authentication
Service
20
Access
Control
Service
Nonrepudiation
Service
Data
Confidentiality
Service
selective-field confidentiality
confidentiality of selected fields
within the user data on a connection
or a single data block
traffic-flow confidentiality
protection of the information that
the protection of all user data
on a connection
might be derived from observation of
Chapter 01
22
traffic flows
connection confidentiality
a connection-oriented
integrity service assures that
messages are received as sent,
with no duplication, insertion
modification, reordering, or
replays
Data
Integrity
Service
a connectionless integrity
service generally provides
protection against message
modification only
Chapter 01
23
Availability
Service
Chapter 01
24
TABLE 1.6
X.800
Security
Mechanisms
Chapter 01
25
Figure
1.4
Security
Trends
Chapter 01
26
Figure 1.5
Security
Technologies
Used
specification/policy
what is the
security scheme
supposed to do?
implementation/
mechanisms
how does it do
it?
Chapter 01
correctness/assurance
does it really
work?
28
Security Policy
formal statement of rules and practices that specify or
trade-offs to consider:
ease of use versus
security
cost of security versus
cost of failure and
recovery
Chapter 01
29
Security Implementation
detection
response
intrusion detection
systems
detection of denial
of service attacks
upon detection,
being able to halt
an attack and
prevent further
damage
recovery
involves four
complementary
courses of
action:
prevention
use of backup
systems
secure encryption
algorithms
prevent
unauthorized
access to
encryption keys
Chapter 01
30
31
Summary
security concepts
security architecture
security services enhances the security of
systems and information transfers, table 1.5
security mechanisms mechanisms
designed to detect, prevent, or recover from
a security attack, table 1.6
security attack any action that
compromises the security of information
owned by an organization
CIA triad
confidentiality preserving
the disclosure of information
integrity guarding against
modification or destruction
of information
availability ensuring timely
and reliable access to
information
security trends
figure 1.4
security strategy
policy, implementation,
assurance and evaluation
functional requirements
Chapter 01
table 1.4
32
Chapter 2
Cryptographic Tools
Symmetric Encryption
the universal technique for providing
confidentiality for transmitted or stored data
also referred to as conventional encryption or
single-key encryption
two requirements for secure use:
need a strong encryption algorithm
sender and receiver must have obtained copies
of the secret key in a secure fashion and must
keep the key secure
Chapter 02
34
FIGURE 2.1
Chapter 02
35
Brute-Force Attack
rely on:
36
Table 2.1
37
Table 2.2
38
strength concerns:
concerns about algorithm
DES is the most studied encryption algorithm in
existence
39
F 2
i .
g 2
u
r
e
Figure 2.2 Time to Break a Code (assuming 106
decryptions/ms) The graph assumes that a symmetric
encryption algorithm is attacked using
a brute-force approach of trying all possible keys
Chapter 02
40
41
selected
Rijndael in
November 2001
significantly improved
efficiency
published as FIPS
197
Chapter 02
42
modes of operation
alternative techniques developed to increase the security of
symmetric block encryption for large sequences
overcomes the weaknesses of ECB
Chapter 02
43
Block Cipher
Encryption
Stream
Encryption
Chapter 02
44
Stream Cipher
processes the input elements continuously
produces output one element at a time
primary advantage is that they are almost always faster and use far
less code
encrypts plaintext one byte at a time
pseudorandom stream is one that is unpredictable without
knowledge of the input key
Chapter 02
45
Message Authentication
protects against
active attacks
verifies received
message is
authentic
can use
conventional
encryption
Chapter 02
Chapter 02
47
Secure Hash
Functions
Chapter 02
48
Figure 2.6
Message
Authentication
Using a
One-Way
Hash Function
Chapter 02
49
50
brute-force attack
strength of hash function depends solely on the length of the hash code
produced by the algorithm
intrusion detection
store H(F) for each file on a system and secure the hash values
Chapter 02
51
asymmetric
publicly
proposed by
Diffie and
Hellman in
1976
based on
mathematical
functions
uses two
separate keys
public key and
private key
public key is
made public for
others to use
Chapter 02
some form of
protocol is
needed for
distribution
52
plaintext
readable message or
data that is fed into
the algorithm as
input
encryption algorithm
performs
transformations on
the plaintext
ciphertext
scrambled message
produced as output
decryption key
***directed toward providing confidentiality
Chapter 02
53
corresponding public
key will be able to
decrypt the message
54
Table 2.3
55
computationally easy
to create key pairs
computationally easy
for sender knowing
public key to encrypt
messages
computationally
infeasible for
opponent to
otherwise recover
original message
computationally
easy for receiver
knowing private
key to decrypt
ciphertext
computationally
infeasible for
opponent to
determine private key
from public key
Chapter 02
56
RSA (Rivest,
Shamir,
Adleman)
developed in 1977
most widely
accepted and
implemented
approach to publickey encryption
Diffie-Hellman
key exchange
algorithm
limited to the
exchange of the
keys
Digital
Signature
Standard (DSS)
provides only a
digital signature
function with SHA1
Elliptic curve
cryptography
(ECC)
Chapter 02
block cipher in
which the plaintext
and ciphertext are
integers between 0
and n-1 for some n.
57
Digital Signatures
used for authenticating both source and data
integrity
created by encrypting hash code with private
key
does not provide confidentiality
even in the case of complete encryption
message is safe from alteration but not eavesdropping
Chapter 02
58
Chapter 02
59
Digital
Envelopes
protects a message
without needing to
first arrange for sender
and receiver to have
the same secret key
***equates to the same thing
as a sealed envelope
containing an unsigned
letter
Chapter 02
60
Random
Numbers
Uses include
generation of:
handshaking to prevent
replay attacks
session key
Chapter 02
61
Unpredictability
criteria:
uniform distribution
frequency of occurrence of
each of the numbers should
be approximately the same
independence
no one value in the
sequence can be inferred
from the others
Chapter 02
62
Chapter 02
63
Practical Application:
Encryption of Stored Data
common to encrypt transmitted data
much less common for stored data
there is often little
protection beyond domain
authentication and
operating system access
controls
data are archived for
indefinite periods
even though erased, until
disk sectors are reused
data are recoverable
back-end
appliance
Chapter 02
library based
tape
encryption
background
laptop/PC data
encryption
64
Summary
symmetric encryption
digital signatures
hash functions
digital envelopes
public-key encryption
random numbers
message authentication
creation of digital signatures
65
Thank You !
66