Denial of Service Worlds Attaks
Denial of Service Worlds Attaks
WORLDS ATTAKS
Denial of service ( DOS
)
Saboteur
Table for four
at 8 o’clock. O.K., Restauranteur
Name of Mr. Smith. Mr. Smith
Saboteur
Saboteur vs.
Restauranteur
Restauranteur
Tools:-
-Jolt -SPing-ICMP Bug -IceNewk
Smurf and Fraggle
“O.K.Please
“O.K. Pleasesend
sendack.”
ack.”
Buffer
Now we may categorize the DOS
in to 3 parts depending on the
number of characters.
Direct Single-tier DoS
Attacks
– Straightforward 'point-to-point'
attack, that means we have 2 actors
hacker and victim.
– Examples
Ping of Death
SYN floods
Stacheldraht
Mstream
The Components of a DDoS
Flood Network
– Attacker
Often a hacker with good networking and
routing knowledge.
– Master servers
Handful of backdoored machines running
world
Distributed Denial of Service
Attack (DDoS)
In and around early 2001 a new type of
DoS attack became rampant, called a
Distributed Denial of Service attack, or
DDoS. In this case multiple comprised
systems are used to attack a single
target. The flood of incoming traffic to the
target will usually force it to shut down.
Like a DoS attack, In a DDoS attack the
legitimate requests to the affected
system are denied. Since a DDoS attack it
launched from multiple sources, it is often
more difficult to detect and block than a
DoS attack.
Results expected
Denial-of-service attacks can essentially
disable your computer or your network.
Depending on the nature of your
enterprise.
Some denial-of-service attacks can be
executed with limited resources against a
large, sophisticated site. This type of
attack is sometimes called an
"asymmetric attack." For example, an
attacker with an old PC and a slow modem
may be able to disable much faster and
more sophisticated machines or networks.
Forms
“Hello?”
“He
llo?
”
Buffer
Buffer
Problems:
•Can be evaded, particularly on, e.g., Ethernet
Digital signatures
Server
Client
Buffer
Problems:
•Requires carefully regulated PKI
•Does not allow for anonymity
Connection timeout
Server
Buffer
O.K.
What does a puzzle look
?like
Puzzle basis: partial hash
inversion
k bits
? X’ X ?
pre-image
partial-image
160 bits
hash
image Y
Client Server
Service request R
Secret S
Puzzle construction
Server computes:
secret S time T request R
hash
Puzzle
pre-image X
hash
image Y
Puzzles cannot always
be used
The attack may be performed on
Phones, SMS,MMS or physical e-
mail
It may not be possible to add
puzzles
Sometimes, the adversary will be
more powerful than normal users
(e.g., computer vs. cell phone.)