Top Banner
Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009
63

Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Jan 14, 2016

Download

Documents

Diane Anthony
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Page 1: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 1CS 136, Spring 2009

Network SecurityCS 136

Computer Security Peter ReiherMay 7, 2009

Page 2: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 2CS 136, Spring 2009

Outline

• Basics of network security

• Definitions

• Sample attacks

• Defense mechanisms

Page 3: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 3CS 136, Spring 2009

Some Important Network Characteristics for Security

• Degree of locality

• Media used

• Protocols used

Page 4: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 4CS 136, Spring 2009

Degree of Locality• Some networks are very local

– E.g., an Ethernet– Only handles a few machines– Benefits from:

• Physical locality• Small number of users• Common goals and interests

• Other networks are very non-local– E.g., the Internet backbone– Vast numbers of users/sites share bandwidth

Page 5: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 5CS 136, Spring 2009

Network Media

• Some networks are wires, cables, or over telephone lines– Can be physically protected

• Other networks are satellite links or other radio links– Physical protection possibilities

more limited

Page 6: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 6CS 136, Spring 2009

Protocol Types• TCP/IP is the most used

– But it only specifies some common intermediate levels

– Other protocols exist above and below it• In places, other protocols replace TCP/IP• And there are lots of supporting protocols

– Routing protocols, naming and directory protocols, network management protocols

– And security protocols (IPSec, ssh, ssl)

Page 7: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 7CS 136, Spring 2009

Implications of Protocol Type

• The protocol defines a set of rules that will always be followed– But usually not quite complete– And they assume everyone is at least

trying to play by the rules– What if they don’t?

• Specific attacks exist against specific protocols

Page 8: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 8CS 136, Spring 2009

Why Are Networks Especially Threatened?

• Many “moving parts”• Many different administrative domains• Everyone can get some access• In some cases, trivial for attacker to get

a foothold on the network• Networks encourage sharing• Networks often allow anonymity

Page 9: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 9CS 136, Spring 2009

What Can Attackers Attack?

• The media connecting the nodes

• Nodes that are connected to them

• Routers that control the traffic

• The protocols that set the rules for communications

Page 10: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 10CS 136, Spring 2009

Wiretapping

• Passive wiretapping is listening in illicitly on conversations

• Active wiretapping is injecting traffic illicitly

• Packet sniffers can listen to all traffic on a broadcast medium– Ethernet or 802.11, e.g.

• Wiretapping on wireless often just a matter of putting up an antenna

Page 11: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 11CS 136, Spring 2009

Impersonation

• A packet comes in over the network– With some source indicated in its

header• Often, the action to be taken with the

packet depends on the source• But attackers may be able to create

packets with false sources

Page 12: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 12CS 136, Spring 2009

Violations of Message Confidentiality

• Other problems can cause messages to be inappropriately divulged

• Misdelivery can send a message to the wrong place– Clever attackers can make it happen

• Message can be read at an intermediate gateway or a router

• Sometimes an intruder can get useful information just by traffic analysis

Page 13: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 13CS 136, Spring 2009

Message Integrity

• Even if the attacker can’t create the packets he wants, sometimes he can alter proper packets

• To change the effect of what they will do

• Typically requires access to part of the path message takes

Page 14: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 14CS 136, Spring 2009

Denial of Service

• Attacks that prevent legitimate users from doing their work

• By flooding the network

• Or corrupting routing tables

• Or flooding routers

• Or destroying key packets

Page 15: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 15CS 136, Spring 2009

How Do Denial of Service Attacks Occur?

• Basically, the attacker injects some form of traffic

• Most current networks aren’t built to throttle uncooperative parties very well

• All-inclusive nature of the Internet makes basic access trivial

• Universality of IP makes reaching most of the network easy

Page 16: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 16CS 136, Spring 2009

Example DoS Attack: Smurf Attacks

• Attack on vulnerability in IP broadcasting• Send a ping packet to IP broadcast address

– With forged “from” header of your target• Resulting in a flood of replies from the sources

to the target• Easy to fix at the intermediary

– Don’t allow IP broadcasts to originate outside your network

• No good solutions for victim

Page 17: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 17CS 136, Spring 2009

Another Example: SYN Flood• Based on vulnerability in TCP• Attacker uses initial request/response

to start TCP session to fill a table at the server

• Preventing new real TCP sessions• SYN cookies and firewalls with

massive tables are possible defenses

Page 18: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 18CS 136, Spring 2009

Normal SYN Behavior

SYN

SYN/ACK

ACK

Table of open TCP connections

Page 19: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 19CS 136, Spring 2009

A SYN Flood

SYN

SYN/ACK

Table of open TCP connections

SYN

SYN/ACKSYN/ACKSYN/ACK

SYN

Server can’t fill request!

SYNSYN

Page 20: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 20CS 136, Spring 2009

SYN Cookies

SYN

No room in the table, so send back a SYN

cookie, instead

SYN/ACK

SYN/ACK number is secret function of

various information

ACK

Server recalculates cookie to determine if proper response

+ 1

Client IP address & port, server’s IP address and port, and a timer

KEY POINT: Server doesn’t need to save cookie value!

And no changes to TCP protocol

itself

Page 21: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 21CS 136, Spring 2009

General Network Denial of Service Attacks

• Need not tickle any particular vulnerability

• Can achieve success by mere volume of packets

• If more packets sent than can be handled by target, service is denied

• A hard problem to solve

Page 22: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 22CS 136, Spring 2009

Distributed Denial of Service Attacks

• Goal: Prevent a network site from doing its normal business

• Method: overwhelm the site with attack traffic

• Response: ?

Page 23: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 23CS 136, Spring 2009

The Problem

Page 24: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 24CS 136, Spring 2009

Why Are These Attacks Made?

• Generally to annoy

• Sometimes for extortion

• If directed at infrastructure, might cripple parts of Internet

Page 25: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 25CS 136, Spring 2009

Attack Methods

• Pure flooding– Of network connection– Or of upstream network

• Overwhelm some other resource– SYN flood– CPU resources– Memory resources– Application level resource

• Direct or reflection

Page 26: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 26CS 136, Spring 2009

Why “Distributed”?

• Targets are often highly provisioned servers

• A single machine usually cannot overwhelm such a server

• So harness multiple machines to do so

• Also makes defenses harder

Page 27: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 27CS 136, Spring 2009

How to Defend?

• A vital characteristic:– Don’t just stop a flood– ENSURE SERVICE TO

LEGITIMATE CLIENTS!!!• If you deliver a manageable amount of

garbage, you haven’t solved the problem

Page 28: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 28CS 136, Spring 2009

Complicating Factors

• High availability of compromised machines– At least tens of thousands of zombie machines

out there• Internet is designed to deliver traffic

– Regardless of its value• IP spoofing allows easy hiding• Distributed nature makes legal approaches hard• Attacker can choose all aspects of his attack

packets– Can be a lot like good ones

Page 29: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 29CS 136, Spring 2009

Basic Defense Approaches

• Overprovisioning• Dynamic increases in provisioning• Hiding• Tracking attackers• Legal approaches• Reducing volume of attack• None of these are totally effective

Page 30: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 30CS 136, Spring 2009

Network Security Mechanisms

• Again, the usual suspects -

– Encryption

– Authentication

– Access control

– Data integrity mechanisms

– Traffic control

Page 31: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 31CS 136, Spring 2009

Encryption for Network Security

• Relies on the kinds of encryption algorithms and protocols discussed previously

• Can be applied at different places in the network stack

• With different effects and costs

Page 32: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 32CS 136, Spring 2009

Link Level EncryptionSource Destination

plaintext

Let’s say we want to send a message using encryption

ciphertext ciphertextplaintextciphertext ciphertextplaintextciphertext ciphertextplaintextciphertext ciphertextplaintext

Different keys (maybe even different ciphers) used at each hop

Page 33: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 33CS 136, Spring 2009

End-to-End EncryptionSource Destination

plaintextciphertext ciphertext ciphertext ciphertext ciphertextplaintext

Cryptography only at the end points

Only the end points see the plaintext

Normal way network cryptography done

When would link encryption be better?

Page 34: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 34CS 136, Spring 2009

IPSec

• Standard for applying cryptography at the network layer of IP stack

• Provides various options for encrypting and authenticating packets– On end-to-end basis– Without concern for transport layer

(or higher)

Page 35: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 35CS 136, Spring 2009

What IPSec Covers

• Message integrity

• Message authentication

• Message confidentiality

Page 36: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 36CS 136, Spring 2009

What Isn’t Covered

• Non-repudiation• Digital signatures• Key distribution• Traffic analysis• Handling of security associations• Some of these covered in related

standards

Page 37: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 37CS 136, Spring 2009

Some Important Terms for IPsec• Security Association - “A Security

Association (SA) is a simplex "connection" that affords security services to the traffic carried by it. – Basically, a secure one-way channel

• SPI (Security Parameters Index) – Combined with destination IP address and IPsec protocol type, uniquely identifies an SA

Page 38: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 38CS 136, Spring 2009

General Structure of IPsec• Really designed for end-to-end encryption

– Though could do link level• Designed to operate with either IPv4 or IPv6• Meant to operate with a variety of different

encryption protocols• And to be neutral to key distribution methods• Has sub-protocols

– E.g., Encapsulating Security Payload

Page 39: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 39CS 136, Spring 2009

Encapsulating Security Payload (ESP) Protocol

• Encrypt the data and place it within the ESP

• The ESP has normal IP headers

• Can be used to encrypt just the payload of the packet

• Or the entire IP packet

Page 40: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 40CS 136, Spring 2009

ESP Modes• Transport mode

– Encrypt just the transport-level data in the original packet

– No IP headers encrypted• Tunnel mode

– Original IP datagram is encrypted and placed in ESP

– Unencrypted headers wrapped around ESP

Page 41: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 41CS 136, Spring 2009

ESP in Transport Mode

• Extract the transport-layer frame

– E.g., TCP, UDP, etc.

• Encapsulate it in an ESP

• Encrypt it

• The encrypted data is now the last payload of a cleartext IP datagram

Page 42: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 42CS 136, Spring 2009

ESP Transport Mode

Original IP header

ESPHdr

Normal Packet Payload

ESPTrlr

ESPAuth

Encrypted

Authenticated

Page 43: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 43CS 136, Spring 2009

Using ESP in Tunnel Mode

• Encrypt the IP datagram – The entire datagram

• Encapsulate it in a cleartext IP datagram

• Routers not understanding IPsec can still handle it

• Receiver reverses the process

Page 44: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 44CS 136, Spring 2009

ESP Tunnel Mode

New IP hdr

ESPHdr

OriginalPacket Payload

ESPTrlr

ESPAuth

Orig. IP hdr

Encrypted

Authenticated

Page 45: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 45CS 136, Spring 2009

Uses and Implications of Tunnel Mode

• Typically used when there are security gateways between sender and receiver– And/or sender and receiver don’t speak

IPsec• Outer header shows security gateway

identities– Not identities of real parties

• Can thus be used to hide some traffic patterns

Page 46: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 46CS 136, Spring 2009

What IPsec Requires

• Protocol standards– To allow messages to move securely

between nodes• Supporting mechanisms at hosts running

IPsec– E.g., a Security Association Database

• Lots of plug-in stuff to do the cryptographic heavy lifting

Page 47: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 47CS 136, Spring 2009

The Protocol Components

• Pretty simple• Necessary to interoperate with non-IPsec

equipment• So everything important is inside an

individual IP packet’s payload• No inter-message components to protocol

– Though some security modes enforce inter-message invariants

Page 48: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 48CS 136, Spring 2009

The Supporting Mechanisms

• Methods of defining security associations

• Databases for keeping track of what’s going on with other IPsec nodes

– To know what processing to apply to outgoing packets

– To know what processing to apply to incoming packets

Page 49: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 49CS 136, Spring 2009

Plug-In Mechanisms

• Designed for high degree of generality

• So easy to plug in:

– Different crypto algorithms

– Different hashing/signature schemes

– Different key management mechanisms

Page 50: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 50CS 136, Spring 2009

Status of IPsec

• Accepted Internet standard• Widely implemented and used

– Supported in Windows 2000, XP, and Vista– In Linux 2.6 kernel

• The architecture doesn’t require everyone to use it• RFC 3602 on using AES in IPsec still listed as

“proposed”• Expected that AES will become default for ESP in

IPsec

Page 51: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 51CS 136, Spring 2009

Traffic Control Mechanisms

• Filtering

– Source address filtering

– Other forms of filtering

• Rate limits

• Protection against traffic analysis

– Padding

– Routing control

Page 52: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 52CS 136, Spring 2009

Source Address Filtering

• Filtering out some packets because of their source address value

– Usually because you believe their source address is spoofed

• Often called ingress filtering

– Or egress filtering . . .

Page 53: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 53CS 136, Spring 2009

Source Address Filtering for Address Assurance

• Router “knows” what network it sits in front of– In particular, knows IP addresses of

machines there• Filter outgoing packets with source

addresses not in that range• Prevents your users from spoofing other

nodes’ addresses– But not from spoofing each other’s

Page 54: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 54CS 136, Spring 2009

Source Address Filtering Example

128.171.192.*

95.113.27.12 56.29.138.2

My network shouldn’t be creating packets with this

source addressSo drop the packet

Page 55: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 55CS 136, Spring 2009

Source Address Filtering in the Other Direction

• Often called egress filtering– Or ingress filtering . . .

• Occurs as packets leave the Internet and enter a border router– On way to that router’s network

• What addresses shouldn’t be coming into your local network?

Page 56: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 56CS 136, Spring 2009

Filtering Incoming Packets

128.171.192.*

128.171.192.5 128.171.192.7

Packets with this source address should be going out,

not coming inSo drop the packet

Page 57: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 57CS 136, Spring 2009

Other Forms of Filtering

• One can filter on things other than source address– Such as worm signatures, unknown protocol

identifiers, etc.• Also, there are unallocated IP addresses in IPv4

space– Can filter for packets going to or coming from

those addresses• Also, certain source addresses are for local use

only– Internet routers can drop packets to/from them

Page 58: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 58CS 136, Spring 2009

Rate Limits

• Many routers can place limits on the traffic they send to a destination

• Ensuring that the destination isn’t overloaded– Popular for denial of service defenses

• Limits can be defined somewhat flexibly• But often not enough flexibility to let the

good traffic through and stop the bad

Page 59: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 59CS 136, Spring 2009

Padding

• Sometimes you don’t want intruders to know what your traffic characteristics are

• Padding adds extra traffic to hide the real stuff

• Fake traffic must look like real traffic– Usually means encrypt it all

• Must be done carefully, or clever attackers can tell the good stuff from the noise

Page 60: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 60CS 136, Spring 2009

Routing Control

• Use ability to control message routing to conceal the traffic in the network

• Used in onion routing to hide who is sending traffic to whom– For anonymization purposes

• Routing control also used in some network defense– To hide real location of a machine– E.g., SOS DDoS defense system

Page 61: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 61CS 136, Spring 2009

Onion Routing

• Meant to hide source and destination of traffic

• Encrypt real packet

• Wrap it in another packet

– With intermediate receiver

– Who actively participates

• Generally, do it multiple times

Page 62: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 62CS 136, Spring 2009

The Effect of Onion Routing

• Lots of packets with encrypted payloads flow around

• At each step, one layer of encryption peeled off

• None of the intermediate routers are sure when real delivery occurs

– Last layer also encrypted

Page 63: Lecture 11 Page 1 CS 136, Spring 2009 Network Security CS 136 Computer Security Peter Reiher May 7, 2009.

Lecture 11Page 63CS 136, Spring 2009

Costs of Onion Routing

• Multiple encryptions per packet

• Packet travels further

• Decryption done at app level

– So multiple trips up and down the network stack

• Unless carefully done, observers can deduce who’s sending to whom