5 Network Security - RTD
5 Network Security - RTD
SECURITY IN
COMPUTING,
FIFTH EDITION
Chapter 6: Networks
2
• Cable
• Optical fiber
• Microwave
• WiFi
• Satellite communication
3
LAN
Imposter
Receiver
7 – Application 7 – Application
6 – Presentation 6 – Presentation
5 – Session 5 – Session
4 – Transport 4 – Transport
3 – Network 3 – Network
2 – Data Link 2 – Data Link
1 – Physical 1 – Physical
Security
Security Perimeters perimeter
• Each of these places is a security perimeter in and of itself. Within each perimeter, you
largely have control of your cables, devices, and computers because of physical
controls, so you do not need to worry as much about protection.
• Encryption is the most common and useful control for addressing this threat.
6
• Anonymity
• An attacker can attempt many attacks, anonymously, from thousands of miles away
• Many points of attack
• Large networks mean many points of potential entry
• Sharing
• Networked systems open up potential access to more users than do single
computers
• System complexity
• One system is very complex and hard to protect; networks of many different
systems, with disparate OSs, vulnerabilities, and purposes are that much more
complex
• Unknown perimeter (next slide)
• Networks, especially large ones, change all the time, so it can be hard to tell which
systems belong and are behaving, and impossible to tell which systems bridge
networks
• Unknown path (next slide)
• There may be many paths, including untrustworthy ones, from one host to another
7
Unknown Perimeter
Network C Network B
Network A
Network D
Network E
8
Unknown Path
Host C
Network A Network B
Host A1
Host B3
Host D
9
Network Perimeter
A network perimeter is the secured boundary between the
private & locally managed side of a network. A network
perimeter includes:
• Border Routers: Routers serve as the traffic signs of
networks. They direct traffic into, out of, and throughout
networks. The border router is the final router under the
control of an organization before traffic appears on an
untrusted network, such as the Internet.
• Firewalls: A firewall is a device that has a set of rules
specifying what traffic it will allow or deny to pass through it.
A firewall typically picks up where the border router leaves
off and makes a much more thorough pass at filtering
traffic.
10
Network Perimeter
Network Perimeter
Software
flaw Transmission
problem Hacker Human
activity mistake
13
Interception
ID
ID Password (encrypted)
PW Encryption
Server
ID
Password (encrypted)
Replay
14
Port Scanning
However….note the kind of data that is available: port, protocol, state, service, product,
and version.
16
• Integrity—When WiFi access points receive two streams of communication claiming to be the
same computer, they necessarily accept the one with greater signal strength. This allows
attackers to take over and forge sessions by spoofing legitimate computers and boosting
signal strength.
• Availability—In addition to the obvious availability issues, WiFi creates new availability
problems, such as session hijacking, forced disassociation, and jamming.
• SSID in all frames—Similar to picking up the beacon, once a client connects to an access
point, the SSID is stored in all communication frames and can be sniffed that way
WEP
• Wired equivalent privacy, or WEP, was designed at the same time as the original
802.11 WiFi standards as the mechanism for securing those communications
• Weaknesses in WEP were first identified in 2001, four years after release
• More weaknesses were discovered over the course of years, until any WEP-
encrypted communication could be cracked in a matter of minutes
How it works:
• AP sends a random number to the client, which the client then encrypts using the
key and returns to the AP
• The AP decrypts the number using the key and checks that it’s the same number
to authenticate the client
• Once the client is authenticated, the AP and client communicate using messages
encrypted with the key
18
WEP Weaknesses
• Weak encryption key
• WEP allows to be either 64- or 128-bit, but 24 of those bits are reserved for initialization
vectors (IV), thus reducing effective key size to 40 or 140 bits
• Keys were either alphanumeric or hex phrases that users typed in and were therefore
vulnerable to dictionary attacks
• Static key
• Since the key was just a value the user typed in at the client and AP, and since users
rarely changed those keys, one key would be used for many months of communications
• Weak encryption process
• A 40-bit key can be brute forced easily. Flaws that were eventually discovered in the RC4
encryption algorithm WEP uses made the 104-bit keys easy to crack as well
• Weak encryption algorithm
• WEP used RC4 in a strange way (always a bad sign), which resulted in a flaw that
allowed attackers to decrypt large portions of any WEP communication
• IV collisions
• There were only 16 million possible values of IV, which, in practice, is not that many to
cycle through for cracking. Also, they were not as randomly selected as they should have
been, with some values being much more common than others
• Faulty integrity check
• WEP messages included a checksum to identify transmission errors but did not use one
that could address malicious modification
• No authentication
• Any client that knows the AP’s SSID and MAC address is assumed to be legitimate
19
• Authentication
• WPA allows authentication by password, token, or certificate
WPA2 is adequately secure if configured well: Choose a strong encryption algorithm (AES without TKIP), and use a long,
random passphrase.
• Strong encryption
• WPA adds support for AES, a much more reliably strong encryption algorithm
• Integrity protection
• WPA includes a 64-bit cryptographic integrity check
• Session initiation
• WPA sessions begin with authentication and a four-way handshake that results in separate keys for encryption and
integrity on both ends
While there are some attacks against WPA, they are either of very limited effectiveness or require weak passwords
20
From Security in Computing, Fifth Edition, by Charles P. Pfleeger, et al. (ISBN: 9780134085043). Copyright 2015 by Pearson Education, Inc. All rights reserved.
22
From Security in Computing, Fifth Edition, by Charles P. Pfleeger, et al. (ISBN: 9780134085043). Copyright 2015 by Pearson Education, Inc. All rights reserved.
23
Flooding
• An attacker can try for the same overloading effect by
presenting commands more quickly than a server can handle
them;
• servers often queue unmet commands during moments of
overload for service when the peak subsides, but if the
commands continue to come too quickly, the server eventually
runs out of space to store the demand.
• Such an attack is called an overload or flood. The target of a
flooding attack can be an application, such as a database
management system; an operating system or one of its
components,
• For example, file or print server; or a network appliance like a
router. Alternatively, the flooding attack can be directed against
a resource, such as a memory allocation table or a web page.
• A flooding attack occurs from demand in excess of capacity,
from malicious or natural causes.
From Security in Computing, Fifth Edition, by Charles P. Pfleeger, et al. (ISBN: 9780134085043). Copyright 2015 by Pearson Education, Inc. All rights reserved.
24
Blocked Access
• The attacker may simply prevent a service from
functioning. The attacker could exploit a software
vulnerability in an application and cause the application to
crash.
• Or the attacker could interfere with the network routing
mechanisms, preventing access requests from getting to
the server.
• Another approach would be for the attacker to manipulate
access control data, deleting access permissions for the
resource, or
• To disable the access control mechanism so that nobody
could be approved for access.
From Security in Computing, Fifth Edition, by Charles P. Pfleeger, et al. (ISBN: 9780134085043). Copyright 2015 by Pearson Education, Inc. All rights reserved.
25
Access Failure
• Either maliciously or not, hardware and software fail from
time to time.
• Software stops working due to a flaw, or a hardware
device wears out or inexplicably stops.
• The failure can be sporadic, meaning that it goes away or
corrects itself spontaneously, or the failure can be
permanent, as from a faulty component.
• These are the three root threats to availability:
• • insufficient capacity; overload
• • blocked access
• • unresponsive component
From Security in Computing, Fifth Edition, by Charles P. Pfleeger, et al. (ISBN: 9780134085043). Copyright 2015 by Pearson Education, Inc. All rights reserved.
26
Flooding
• Flooding occurs because the incoming bandwidth is
insufficient or resources hardware devices, computing
power, software, or table capacity are inadequate.
• More sophisticated attacks use or misuse elements of
Internet protocols. In addition to TCP and UDP, there is a
third class of protocols, called ICMP or Internet Control
Message Protocols.
• ICMP used for system diagnostics/network management
From Security in Computing, Fifth Edition, by Charles P. Pfleeger, et al. (ISBN: 9780134085043). Copyright 2015 by Pearson Education, Inc. All rights reserved.
27
Attacker Victim
(a) Attacker has greater bandwidth
Attacker Victim
(b) Victim has greater bandwidth
29
The attacker spoofs the source of the ICMP request to be the IP address of the intended victim. Since ICMP
does not include a handshake, the destination has no way of verifying if the source IP is legitimate. The
router receives the request and passes it on to all the devices that sit behind it.
All those devices then respond back to the ping. The attacker is able to amplify the attack by a multiple of
how ever many devices are behind the router (i.e., if you have 5 devices behind the router then the attacker
is able to amplify the attack 5x).
Victim
Attacker
Attacker sends
broadcast ECHO Victim is saturated
request to network, All network hosts with ECHO replies
with victim’s return address reply to victim from entire network
30
Smurf Attack
From Security in Computing, Fifth Edition, by Charles P. Pfleeger, et al. (ISBN: 9780134085043). Copyright 2015 by Pearson Education, Inc. All rights reserved.
31
Echo–Chargen
From Security in Computing, Fifth Edition, by Charles P. Pfleeger, et al. (ISBN: 9780134085043). Copyright 2015 by Pearson Education, Inc. All rights reserved.
32
SYN Flood
• The attacker can deny service to the target by sending
many SYN requests, to which the target properly
responds with SYN-ACK; however, the attacker never
replies with ACKs to complete the connections, thereby
filling the victim’s SYN_RECV queue.
From Security in Computing, Fifth Edition, by Charles P. Pfleeger, et al. (ISBN: 9780134085043). Copyright 2015 by Pearson Education, Inc. All rights reserved.
33
10
20
30
40
60
70
80
90
100
...
Fragment start = 40 len = 30
Reassembly Buffer
Packet Fragments
7.0.1.1
207.46.197.32
Received too
The attacker acts as the DNS server in
late; ignored
order to redirect the user to malicious sites.
35
10.0.0.0 A T 90.0.0.0
20.0.0.0 B
…
30.0.0.0 C
10.0.0.0 dist 3
20.0.0.0 dist 2
30.0.0.0 dist 1
This picture doesn’t show anything malicious happening. It just shows how one router, C,
advertises the routes it knows about to the routers adjacent to it. Routers rely on these
advertising messages to be accurate; when they aren’t, DoS can ensue.
36
Traffic Redirection
• Each router advises its neighbors about how well it can
reach other network addresses. This characteristic allows
an attacker to disrupt the network.
• Routers trust each other to provide accurate data
• Due to nonmalicious corruption a router will send faulty
data
• An intentionally misleading router (or a device maliciously
impersonating a router) can persist because of implicit
trust.
• A standard countermeasure to exclude impostors is
identification and authentication.
From Security in Computing, Fifth Edition, by Charles P. Pfleeger, et al. (ISBN: 9780134085043). Copyright 2015 by Pearson Education, Inc. All rights reserved.
37
DNS attacks
• A class of attacks based on the concept of domain name
server.
• Name Server Application Software Flaws
• Name servers run software called Berkeley Internet Name
Domain, or BIND,
• BIND has had numerous flaws, including a now familiar
buffer overflow.
• By overtaking a name server or causing it to cache
spurious entries, an attacker can redirect the routing of
any traffic, with an implication for denial of service.
From Security in Computing, Fifth Edition, by Charles P. Pfleeger, et al. (ISBN: 9780134085043). Copyright 2015 by Pearson Education, Inc. All rights reserved.
38
Data (len 5)
Ack = 15
Seq = 10
Reset
From Security in Computing, Fifth Edition, by Charles P. Pfleeger, et al. (ISBN: 9780134085043). Copyright 2015 by Pearson Education, Inc. All rights reserved.
40
DDoS
• DDoS attacks most often work by botnets – a large group of
distributed computers that act in concert with each other –
simultaneously spamming a website or service provider with data
requests.
Victim
1. Attacker plants
Trojan horse in
zombies 2. Zombies attack
victim simultaneously
on command Victim
DoS vs DDoS
• A Denial of Service (DoS) attack includes many kinds of attacks all designed to disrupt
services. In addition to DDoS, you can have application layer DoS, advanced persistent
DoS, and DoS as a service. Companies will use DoS as a service to stress test their
networks.
• In short, DDoS is one type of DoS attack – however, DoS can also mean that the
attacker used a single node to initiate the attack, instead of using a botnet. Both
definitions are correct.
43
• Attackers load the bots with a complicated request that taxes the target server as it tries to respond. The
request might require database access or large downloads. If the target gets several million of those
requests in a short time, it can very quickly get overwhelmed and either slowed to a crawl or locked up
completely.
• An HTTP Flood attack, for example, is an application layer attack that targets a web server on the target
and uses many fast HTTP requests to bring the server down.