Lecture 9 - Network - Notes 1
Lecture 9 - Network - Notes 1
Lecture 9
1
Reminder of previous lecture
❑ Computer security
o Authentication (passwords)
▪ Multi-factor (know, have, are)
▪ Password files (dictionary attacks)
▪ Phishing
o Access control
o Firewall
▪ Four basic types
(Packet filter, stateful, appplication proxy, personal)
o Malware
▪ Different types (e.g. bacteria, worm, virus, logic bomb..)
2
Today’s Lecture
❑ For all e-commerce systems we need to
securely communicate and exchange data
❑ Aspects of Network Security
o Web (TLS/SSL)/IPSEC
o WiFi/Mobile Networks
o DoS
❑ CILO1,CILO2, CILO3 and CILO4
(Data security, security requirements, security
measures, security assessment)
3
3
Secure Socket Layer
(Transport Layer Security)
4
Socket layer
❑ “Socket
layer” lives Socket application User
between “layer”
application transport
OS
and transport
network
layers
❑ SSL usually link
NIC
lies between
HTTP and TCP physical
5
What is SSL?
❑ Secure Socket Layer (SSL) is the protocol used for most
secure transactions over the Internet
6
TLS and SSL
❑ TLS (SSL has evolved into Transport Socket Layer)
o SSL 1.0, 2.0, 3.0 >> TLS 1.0, 1.1, 1.2, 1.3
o DTLS is version for UDP (instead of TCP)
❑ Handshake and record protocols
o Handshake: Authentication, key establishment, cipher options
o Record: Confidentiality and integrity
❑ Ciphersuite
❑ See: www.openssl.org/docs/manmaster/man1/ciphers.html
❑ TLS 1.3 supports 5 cipher suites (all authenticated encryption)
TLS_AES_128_GCM_SHA256
TLS_AES_256_GCM_SHA384
TLS_CHACHA20_POLY1305_SHA256
TLS_AES_128_CCM_SHA256
TLS_AES_128_CCM_8_SHA256
SSL and IPSec 7
For interest
Proposed for TLS 1.3 to have no mode with encryption that do not
also have message authentication
For example, TLS 1.2 has
TLS_RSA_WITH_AES_128_CBC_SHA256 (that hash the data but
has no MAC).
7
Simple SSL-like Protocol
I’d like to talk to you securely
CertB
{KAB}Bob
Who is authenticated?
What is the purpose?
8
Simplified SSL Handshake Protocol
Cipher suites, TLS ver, RA
Cipher suite used, CertB, RB
{S}B, PRF(K, h(msgs ))
PRF(K,h(msgs))
Alice Data encrypted under K Bob
9
SSL Sessions vs Connections
❑ SSL designed for use with HTTP 1.0
❑ HTTP 1.0 usually opens multiple
simultaneous (parallel) connections
❑ SSL session establishment is costly
o Due to public key operations
❑ SSL has an efficient protocol for
opening new connections given an
existing session
SSL and IPSec 10
10
SSL Connection
RA
RB, PRF(K,h(msgs))
PRF(K,h(msgs))
11
Comment: SSL/TLS
SSLVerifySignedServerKeyExchange (iOS 7.0.6/OS X 10.9, TLS 1.1,
Forward Secrecy)
... Remember Signature verification
hashOut.data = hashes + SSL_MD5_DIGEST_LEN; - Do hash of data
hashOut.length = SSL_SHA1_DIGEST_LEN; - Verify signature
if ((err = SSLFreeBuffer(&hashCtx)) != 0) - With hash and public key
goto fail;
if ((err = ReadyHash(&SSLHashSHA1, &hashCtx)) != 0)
goto fail;
if ((err = SSLHashSHA1.update(&hashCtx, &clientRandom)) != 0)
goto fail;
if ((err = SSLHashSHA1.update(&hashCtx, &serverRandom)) != 0)
goto fail;
if ((err = SSLHashSHA1.update(&hashCtx, &signedParams)) != 0)
goto fail;
goto fail;
if ((err = SSLHashSHA1.final(&hashCtx, &hashOut)) != 0)
goto fail;
err = sslRawVerify(...);
... 12
For interest
This function will return err (fail if anything but equal to 0).
The second goto will always execute (and err =0 because of the
condition before it being valid). Therefore sslRawVerify never has
an effect.
https://nakedsecurity.sophos.com/2014/02/24/anatomy-of-a-goto-
fail-apples-ssl-bug-explained-plus-an-unofficial-patch/
Attacker can use this if:
12
because the server decides what TLS versions it will allow.
Supply a legitimate-looking TLS certificate with a mismatched private
key.
12
IPSec
(Network Layer Security)
13
IPSec and SSL
❑ IPSec lives at
the network application User
layer SSL
❑ IPSec is
transport
OS
transparent to IPSec network
applications
link
NIC
physical
Once again you should think where SSL works on the network
protocol stack in relation to IPSec
14
IKE and ESP/AH
❑ Two parts to discuss
1. Establish a session key – IKE
2. How a secure channel works – ESP or AH
IKE Internet Key Exchange is only to enable the two parties to set
up a shared key!
This should not be completely new to you as we already had a
lecture on key management! This is simply application of what you
studied already.
15
IKE
❑ IKE has 2 phases
o Phase 1 ⎯ master session key setup
o Phase 2 ⎯ ESP and/or AH key setup
❑ Phase 1 is comparable to SSL session
❑ Phase 2 is comparable to SSL connection
For interest.
16
IKE Phase 1
❑ Three ways to run phase 1
o Public key encryption based
o Signature based
o Symmetric key based
❑ For each of these, there are two different
“modes” to choose from
o Main mode
o Aggressive mode
❑ There are 6 variants of IKE Phase 1!
❑ Evidence that IPSec is over-engineered?
You must know the 6 variants – you do not need to memorise them.
I will not ask you: What does Aggressive mode of IKE using
symmetric key look like?
You could be given the protocol and asked to explain how it works.
I might ask you what the main difference between main and
aggressive mode is.
17
IKE Phase 1
18
IKE Phase 1: Signature Based
(Main Mode)
CP
CS
a
g mod p, RA
gb mod p, RB
E(K, “Alice” || proofA)
Alice E(K, “Bob” || proofB) Bob
Keep the following in mind: Each of the protocols use the basic
Diffie-Hellman approach!! The reference to signature, public key
encryption or symmetric key encryption is relevant to how the
Proof is calculated!
Why can generate K and SKEYID? (only Alice and Bob – what about
MITM? T and A , and T and B). Who can generate proof A or B?
Only A or B. T cannot generate the proof.
19
IKE Phase 1: Signature Based
(Aggressive Mode)
“Alice”, ga mod p, RA, CP
“Bob”, RB,
gb mod p, CS, proofB
proofA
Alice Bob
20
IKE Phase 1: Symmetric Key Based
(Main Mode)
CP
CS
a
g mod p, RA
gb mod p, RB
E(K, “Alice” || proofA)
Alice Bob
E(K, “Bob” || proofB)
21
Problems with Symmetric
Key Based (Main Mode)
❑ Catch
o Alice sends her ID in message 5
o Alice’s ID encrypted with K
o To find K Bob must know KAB
o To get KAB Bob must know he’s talking to Alice!
❑ Result: Alice’s ID must be IP address!
❑ Useless mode for the “road warrior”
22
IKE Phase 1: Symmetric Key
Based (Aggressive Mode)
“Alice”, ga mod p, RA, CP
“Bob”, RB,
gb mod p, CS, proofB
proofA
Alice Bob
23
IKE Phase 1: Public Key
Encryption Based (Main Mode)
CP
CS
ga mod p, {RA}Bob, {“Alice”}Bob
24
IKE Phase 1: Public Key Encryption
Based (Aggressive Mode)
CP, ga mod p,
{“Alice”}Bob, {RA}Bob
CS, gb mod p,
{“Bob”}Alice, {RB}Alice, proofB
proofA
Alice Bob
❑ K, proofA, proofB computed as in main mode
❑ Note that identities are hidden
o The only aggressive mode to hide identities
o Then why have main mode?
SSL and IPSec 25
25
Public Key Encryption Issue?
❑ Public key encryption, aggressive mode
❑ Suppose Trudy generates
o Exponents a and b
o Nonces RA and RB
❑ Trudy can compute “valid” keys and proofs:
gab mod p, K, SKEYID, proofA and proofB
❑ Also true of main mode
This is not man in the middle, it just means you can pretend that A
and B had a conversation.
26
Public Key Encryption Issue?
CP, ga mod p,
{“Alice”}Bob, {RA}Bob
CS, gb mod p,
{“Bob”}Alice, {RB}Alice, proofB
Trudy proofA Trudy
as Alice as Bob
27
Plausible Deniability
❑ A security failure?
❑ In this mode of IPSec, it is a feature!
o Plausible deniability: Alice and Bob can deny
that any conversation has taken place!
❑ In some cases it might be a security failure
o If Alice makes a purchase from Bob, she could
later repudiate it (unless she had signed)
28
How IPSec Secure Channel Works
29
ESP and AH
• Two Protocols
• AH – Authentication Header – support message authentication
only
• ESP – Encapsulating Security Payload
1. Encryption only
2. Encryption with message authentication
v1.2 30
30
IP Review
❑ IP datagram is of the form
IP header data
❑ Where IP header is
31
IP and TCP
❑ Consider HTTP traffic (over TCP)
❑ IP encapsulates TCP
❑ TCP encapsulates HTTP
IP header data
32
IPSec Transport Mode
❑ Transport mode designed for host- IP header data
to-host
❑ The original header remains
o Passive attacker can see who is data
IP header ESP/AH
talking
Network
A B
33
IPSec Tunnel Mode
❑ IPSec Tunnel Mode
IP header data
In tunnel mode IPSec runs between two IPSec devices. The original
IP header is seen as data and then a new one is added.
34
Tunnel mode
(Router-to-router / Gateway-to-gateway)
Secure Tunnel
Host Host
A B
Network
RA RB
1.1.1.1 1.1.1.2 2.2.2.1 2.3.2.2 3.3.3.1 3.3.3.2
Packet flow
Nested packet format IP header IPsec header IP header TCP header data
Src = 2.2.2.1 Src = 1.1.1.1
Dst = 2.3.2.2 Dst = 3.3.3.2
35
Tunnel mode
(Host-to-Router / Remote Access)
Secure Tunnel
Host Host
A B
Internet / Intranet
SGW
36
AH and ESP
• Authentication Header (AH)
• Provides message authentication.
• Next header: TCP, UDP, etc.
37
Authentication Header (AH) Protocol
• Original IP packets
• Transport Mode AH
• Host-to-host
authentication
• Tunnel Mode AH
• Host-to-host
• Host-to-router (i.e.
remote access)
• Router-to-router
38
Encapsulating Security Payload (ESP) Protocol
• Transport Mode ESP
39
IPv4 header
TCP / UDP / ICMP / IPPCP / IPsec (AH/ ESP)
32 bits
v1.2
40
40
Why Does AH Exist?
❑ No confidentiality
❑ AH authenticates immutable fields in
IP header only
o TTL, for example, must change
❑ ESP can provide both confidentiality
and integrity (not of the IP header)
41
Mobile Network Security
Mobile Security 42
42
Cell Phones
❑ First generation cell phones
o Analog
o Little or no security
o Susceptible to cloning
❑ Second generation cell phones: GSM
o Began in 1982 as Groupe Speciale Mobile
o Now, Global System for Mobile Communications
❑ Third generation
o 3rd Generation Partnership Project (3GPP)
Mobile Security 43
43
Security Requirements
❑ Service Providers’ perspective:
o Only legitimate subscribers can access the network
▪ Soln: fight against cloning
o Service providers have no interest on who is using
the SIM (subscriber identity module) card.
o Make SIM difficult if not impossible to clone.
o Make sure that SIM card associating with a 15-
digit IMSI (International Mobile Subscriber
Identity) is valid:
▪ Registered
▪ Authenticated
Mobile Security 44
44
Security Requirements – what Users want
❑ Data Confidentiality
o keep one’s conservation secret by scrambling digitized data
❑ Anonymity
o Hide the identity of the SIM card and prevent from tracking
the SIM card when it roams from one network to another.
❑ Adversaries
o eavesdroppers
o service providers
o Can GSM provide data confidentiality and anonymity against
these two types of enemies?
❑ Prevent malicious users from using your phone
o Misuse: Phone lock (password/gesture)
o Stolen: GSM’s EIR (Equipment Identity Register)
▪ stores all IMEIs (Intl Mobile Equipment Identities)
▪ black list of stolen (or locked) devices
Mobile Security 45
45
Mobile System Overview
air
interface
Mobile
Base AuC
VLR
Station
“land line”
HLR
PSTN
Base Internet
Etc. Home
Visiting Station Network
Network Controller
Mobile Security 46
Slide 47-49 you do not need to study but need to know well enough
so you know who the parties are when we get to the security
aspects.
46
GSM System Components
❑ Mobile phone
o Contains SIM (Subscriber
Identity Module)
❑ SIM is the security module
o IMSI (International Mobile
Subscriber ID)
o User key Ki (128 bits)
SIM
o Tamper resistant (smart card)
Mobile Security 47
47
GSM System Components
❑ Visiting network ⎯ network where mobile is
currently located
o Base station ⎯ one “cell”
o Base station controller ⎯ manages many cells
o VLR (Visitor Location Register) ⎯ info on all
visiting mobiles currently in the network
❑ Home network ⎯ “home” of the mobile
o HLR (Home Location Register) ⎯ keeps track of
most recent location of mobile
o AuC (Authentication Center) ⎯ contains IMSI/Ki
Mobile Security 48
48
GSM: Anonymity
❑ IMSI used to initially identify caller
❑ Then TMSI (Temporary Mobile Subscriber
ID) used
❑ TMSI changed frequently
❑ TMSI’s encrypted when sent
❑ Not a strong form of anonymity
❑ But probably sufficient for most uses
Mobile Security 49
49
GSM: Authentication
❑ Caller is authenticated to base station
❑ Authentication is not mutual
❑ Authentication via challenge-response
o AuC generates RAND and computes XRES = A3(RAND, Ki) where
A3 is a hash
o Then (RAND,XRES) are sent to base station
o Base station sends challenge RAND to mobile
o Mobile’s response is SRES = A3(RAND, Ki)
o Base station verifies SRES = XRES
❑ Note: Ki never leaves AuC!
• The response length should be long enough to discourage online
guessing. E.g. 32 bits
• Random challenge should be long enough to reduce the chance of
generating repeated challenge numbers. E.g. 128 bits
Mobile Security 50
The rest of the slides on GSM(2G) and (3G) security you need to
study. You do not need to remember algorithm names, key lengths,
etc.
I expect that you can do the same for 3G and that you can compare
the two and say where 3G improves on 2G.
50
GSM: Confidentiality
❑ Data encrypted with stream cipher, A5
❑ Encryption key Kc
o AuC computes Kc = A8(RAND, Ki), where A8 is a hash
o Then Kc is sent to base station with RAND
o Mobile computes Kc = A8(RAND, Ki) after receiving RAND
o The value of RAND is the same as the one used for authentication
o Keystream generated from A5(Kc)
❑ Note: Ki never leaves home network!
❑ Ki is 128 bits long
❑ Kc is 64 bits long
Mobile Security 51
51
GSM Insecurity (1)
❑ Hash used in A3/A8:
o Broken after 160,000 chosen plaintexts
o With SIM, can get Ki in 2 to 10 hours Base
Station
❑ Encryption between mobile and base
station but no encryption from base
VLR
station to base station controller
o When transmitted over microwave link…
❑ Encryption algorithm A5/1 Base
Station
o Broken with 2 seconds of known plaintext Controller
Mobile Security 52
52
GSM Insecurity (2)
❑ Fake base station exploits two flaws
o Encryption not automatic
o Base station not authenticated
RAND
SRES Call to
destination
No
Mobile Fake
encryption Base Station Base Station
Mobile Security 53
53
GSM Conclusion
❑ Did GSM achieve its goals?
o Eliminate cloning? Somehow…
o Make air interface as secure as PSTN? Perhaps…
o But design goals were clearly too limited
❑ GSM insecurities ⎯ weak crypto, fake base
station, replay, etc.
❑ PSTN insecurities ⎯ tapping
❑ No integrity check (no message
authentication)
Mobile Security 54
54
3GPP: 3rd Generation
Partnership Project
❑ 3G fixes known GSM security problems
o Mutual authentication
o Keys (encryption/integrity) cannot be reused
o Triples cannot be replayed
o Strong encryption algorithm (AES)
o Message authentication
o Encryption extended to base station controller
❑ http://www.3gpp.org
Mobile Security 55
55
3GPP – AKA (Authentication and Key Agreement)
AuC Mobile station
Serving Network
Conn Req
Generate SQN
Auth data req
Generate RAND
RAND AUTN
SQN
RAND
AMF
f5 SQN AK AMF MAC
K
AK
f1 f2 f3 f4 f5
SQN
K
MAC XRES CK IK AK
f1 f2 f3 f4
AUTN := SQN AK || AMF || MAC Serving Network
AV
AV := RAND || XRES || CK || IK || AUTN XMAC RES CK IK
RAND, AUTN
Verify MAC = XMAC
Mobile Security 56
56
3GPP – AKA Details
❑ K, CK, IK 128 bits
❑ RAND 128 bits
❑ RES 32 – 128 bits
❑ AUTN 128 bits
o SQN, AK 48 bits
▪ Concealment of SQN by AK is optional: prevent serving network from
knowing the value of SQN?
o AMF (authentication management field) 16 bits
o MAC (message authentication code) 64 bits
Mobile Security 57
For interest
57
WLAN Security
For WLAN security all I want you to study is the basic differences
between WEP, WPA and WPA2. So read through the slides and
make your own short summary of the different modes and their
differences.
For example, WEP has a long term key, RC4, bad integrity measures
and was pretty insecure.
WPA mad an improvement on key reuse (it had key distributed by a
TTP) but still RC4
WPA2 started using AES.
58
Introduction
• Everyone uses wireless networks…
• Topologies:
• Infrastructure: Access Point (AP) serves as a ‘hub’ for wireless
clients (star topology)
• Ad Hoc: peer to peer (mesh topology)
• IEEE 802.11 standard defines
• an authentication scheme and
• a Wired Equivalent Privacy (WEP) algorithm
• Wi-Fi Alliance creates
• class of Wi-Fi Protected Access (WPA and WPA2) systems
• The authentication scheme
• one-way authentication (simple challenge-response)
• WEP, WPA & WPA2
• Data confidentiality
• Symmetric key based
59
Key Management
60
WEP
• WEP encipherment block diagram
61
WEP Weaknesses
• 2001: WEP was broken. Attacking Principles
• The first byte of an encrypted message is always equal to
0xAA. Hence the first byte of key sequence is always
obtainable.
• For some special pattern of the 24-bit IV, one can deduce one
byte of the secret key at one time. When enough IVs and
ciphertexts have been collected, all bytes of the secret key
can be obtained.
• Several other weaknesses have been identified since
the publication of the algorithm.
• Static key (difficult to update), weak linear (CRC) integrity
• Open-source cracking software is now available on the
Internet.
• AirSnort (http://airsnort.shmoo.com)
• WEPcrack (http://wepcrack.sourceforge.net/)
• Aircrack (http://aircrack-ng.org/doku.php)
62
Solutions
• Higher protocol level solutions
• Application layer authentication
• Encryption with IPSec or PPTP (use VPN)
• Important websites should have HTTPS
63
WPA/WPA2
• Created by the Wi-Fi Alliance; supersedes WEP in 2003
64
WPA2-PSK KRACK (basic)
• WPA2 has a four-way key establishment handshake
• Pairwise Transient Key (PTK)
• Groupwise Transient Key (GTK)
• CCMP/GCMP only secure if IV does not repeat
• CCMP (IV = MAC/48-bit Nonce)
• GCMP (IV = MAC/48-bit Nonce)
• KRACK
• Replay Msg3
• Allowed: Msg3 might have error
• Key reinstalled..
• …but nonce also reset
• Encrypted data reusing old IV
• Some OS/WPA2 version
• Reinstall cause key = 0
• Large scale patching…
Once again, we can look beyond the protocol to have security (even
though protocol is secure, some implementation was not).
October 2017
65
DoS and DDoS
66
Defining DoS
“A transient or persistent set of actions by a
third party preventing authorised users from
access to or use of a resource or service”
❑ Although this definition assumes that a DoS
is the result of actions by a third party, these
need not be malicious
o Resources may also simply become
exhausted by legitimate users (flash
crowds)
o Where malicious agency can be established,
this is referred to as a DoS attack
page 67
Consumption of Scarce Resources
❑ Network connectivity
o To prevent hosts or networks from communicating
on the network
o Does not depend on the attacker being able to
consume your network bandwidth. For example, the
attacker consumes local resources on a server
involved in establishing a network connection.
❑ Bandwidth consumption
o Consume all the available bandwidth on your
network by generating a large number of packets
directed to your network.
Right so you two main resources that jump into you mind when
talking DoS
page 68
ICMP Echo or Ping Flooding
❑ Uses common diagnostic tool ping
❑ ping is a simple loopback test that sends an
ICMP Echo to a host which responds with an
ICMP Echo Reply
❑ In the Ping Flooding Attack, attacker floods
victim with IP Ping packets
❑ Ping of Death send oversized ping message
o The attacker constructs datagrams that appear to
be fragments from a single datagram
o The sum of the sizes of these fragment datagrams
is greater than 2^16
o When the recipient puts the fragments together
and copies the resulting datagram to a buffer an
overflow occurs
▪ Unpredictable result(System crash? Overflow exploit?)
Interest only
Ping of death?
page 69
It is known that some systems will react in an unpredictable fashion when
receiving oversized IP packets. Reports indicate a range of reactions
including crashing, freezing, and rebooting.
69
Consumption of Scarce Resources
❑ Consumption of other resources
o State storage/processing structures (TCP
SYN)
o Consume disk space (large anonymous ftp
uploads)
o Disrupt specific person’s resource (email
bombs)
o Power (forced to remain resource-
intensive state)
o Security features (Login attempts?)
page 70
administrator, may be subject to this type of attack.
70
Effort Amplification
❑ Key concept for DoS attacker is
resource amplification
o The factor between the effort
expended by an attacker and effort
required of a victim during the attack
o Sending a file vs verifying signature of
file or parsing (XML) file
o Smurf attack: Send single message vs
receive many messages
71
Amplification
-----------
-----------
----------------------
Other example XML (and layered protocols) are targets, e.g. for:
71
Jumbo payloads Large payloads designed to exhaust memory and CPU on
the victim machine {these can be generated in a way that they do not have
to be stored on the attacking system
Large tags Large numbers of tags, or long names (may also cause buffer
overflows)
71
Smurf Attack
1 ICMP Echo Req 3 ICMP Echo Reply
Src: Dos Target Dest: Dos Target
Dest: brdct addr
DoS
gateway DoS
Source Target
Interest only
page 72
Disruption of Physical
Resources
❑ Physical resources can be damaged or
destroyed or service disrupted.
❑ Cutting cables, power cuts.
❑ Wireless networks are particularly
vulnerable to jamming attacks, which can
be affected both at the protocol and
physical layers.
❑ Physical jammers exist for a number of
frequencies and protocols including
GSM/UMTS, GPS and IEEE 802.11
73
73
Disruption of Physical
Resources
74
Interest only
75
You need to know the general idea of what a DDoS attack is (see all
remaining slides), and how it differs to DoS.
Give example Alice and Bob, where Alice phones 100 take-away
restaurants places to deliver food to Bob at 9pm on one particular
evening.
75
Distributed Denial of
Service
❑ Many computers are used to launch a
coordinated DoS attack against one or
more targets
❑ A DDoS “master” program is installed
on one computer
❑ Master program communicates to a
number of “agent” programs, installed
on compromised computers anywhere on
the Internet
❑ Agents initiate attack simultaneously
page 76
Bot Networks (Botnets)
C&C
Master Victim
C&C Slaves/Zombie/Bots
page 78
Botnet operation: Basics
❑ Infection Mechanisms
o Web download, mail attachments, scan/exploit
o Automated process…
❑ Command and Control (C&C)
o Centralized, P2P, unstructured
❑ Communication Protocols
o IRC, HTTP, P2P, proprietary…
❑ Payload/Actions
o Spam, DDoS, Keyloggers, Clickfraud, Bitcoin
mining
79
Infection
79
P2P – botmaster commands can be issued from any peer, any node can be
controller. More complex to design but more robust to analysis.
Unstructured – bots do not actively talk to the botmaster, only listen for
incoming messages. Botmaster randomly scans for bots, and sends
command if it finds one. You have very high data latency, but high
survivability.
Communication Protocols
Important here is that bots can use existing protocols
IRC – good for point to multipoint and point to point communication
HTTP – generally the bot will periodically check a web server for
commands
P2P – proprietary communication.
Ways that different bots are designed feature in what they are useful
for. You would think that a spam bot would have some way of getting
commands from the botmaster (but there is not much it wishes to send
the botmaster in return, this might be ideal for unstructured control),
similarly a keylogger really needs to send the botmaster data (but once it
is on the infected machine the botmaster does not really need to tell it
what to do).
79
Dismantling a Botnet
❑ Dismantling takes time and effort
o Building one could be a one man job
o Easier to disable than to destroy
❑ Some examples SANS Newsbites :
o Kelihos
▪ Microsoft shuts it down (45,000 hosts) (Sept 2011)
▪ Alleged Mastermind named in lawsuit (Jan 2012)
▪ Regaining Momentum (Feb-April 2012)
➢ Kelihos.b (110,000 hosts by February, shut down March)
➢ Kelihos.c (70,000 hosts by April….)
o Bamital
▪ Microsoft Shuts Down Bamital (February 2013)
80
The problem with botnets are that even when they are detected,
and you find a way of shutting them down (basically make it stop
sending spam, take over control and tell bots to send nothing or
send to a sink)...the malware is not necessarily removed from the
host. That is not practical, these can be all over the place? So
really they are only dormant.
80
--Microsoft Names Alleged Kelihos Botnet Mastermind in Lawsuit
(January 24 & 25, 2012) Microsoft has filed a lawsuit in US District Court
in Alexandria, Virginia, naming the individual it believes was responsible
for operating the Kelihos botnet. So all this effort by two quite large
companies to take down a botnet built by a single person.
Bamital was a click fraud botnet – it was used to hijack web searches
from legitimate search engines and victim were redirected to fake listings
with the goal of getting the victim to click on adds.
80
IoT: New generation of botnets
❑Mirai Worm (there are newer ones, such as
Torii)
o Builds IoT-based botnets
o Source code publicly available (Hackforums)
o Mirai-based DDoS (KrebsOnSecurity 665 Gbps, Dyn > 1 Tbps)
❑Attack of the Things
o Numbers vary 50k-400k for observed (advertised) botnets.
o IoT devices (IP Cameras and DVR)
❑Device Security Issue
o Fixed, hardcoded passwords in firmware (Telnet, SSH)
o Tries about 50 username, password combinations.
o For example: root (none); admin password; root root; root
12345; user user; admin (none); root pass; root 1111
More info
https://www.sentryo.net/the-mirai-iot-botnet-a-publically-available-turn-
key-threat-2/
http://www.cbc.ca/news/business/several-baby-monitors-vulnerable-to-
hacking-cybersecurity-firm-warns-1.3213046
https://www.csoonline.com/article/3310222/security/new-vicious-torii-iot-
botnet-discovered.html
81
The end!
?
Any questions…
82
82