Outline. WEP privacy. Side-channel attacks. WEP shared key. WEP key size and IV size. Crypto failures, cont d

Similar documents
Lecture 33. Firewalls. Firewall Locations in the Network. Castle and Moat Analogy. Firewall Types. Firewall: Illustration. Security April 15, 2005

Our Narrow Focus Computer Networking Security Vulnerabilities. Outline Part II

Exam : JK Title : CompTIA E2C Security+ (2008 Edition) Exam. Version : Demo

Computer Security and Privacy

CIS 551 / TCOM 401 Computer and Network Security. Spring 2007 Lecture 8

Proxy server is a server (a computer system or an application program) that acts as an intermediary between for requests from clients seeking

Introduction and Overview. Why CSCI 454/554?

Our Narrow Focus Computer Networking Security Vulnerabilities. IP-level vulnerabilities

On the Internet, nobody knows you re a dog.

Most Common Security Threats (cont.)

Acronyms. International Organization for Standardization International Telecommunication Union ITU Telecommunication Standardization Sector

CSCE 715: Network Systems Security

CIS 551 / TCOM 401 Computer and Network Security. Spring 2007 Lecture 12

IP Security IK2218/EP2120

AIT 682: Network and Systems Security

CSC 4900 Computer Networks: Security Protocols (2)

Computer and Network Security

IPsec (AH, ESP), IKE. Guevara Noubir CSG254: Network Security

FRONT RUNNER DIPLOMA PROGRAM Version 8.0 INFORMATION SECURITY Detailed Course Curriculum Course Duration: 6 months

Chapter 24 Wireless Network Security

Int ernet w orking. Internet Security. Literature: Forouzan: TCP/IP Protocol Suite : Ch 28

Network Security. Thierry Sans

Introduction to Computer Security

Network Security - ISA 656 IPsec IPsec Key Management (IKE)

Advanced Computer Networking. CYBR 230 Jeff Shafer University of the Pacific. IPv6

Application Firewalls

L13. Reviews. Rocky K. C. Chang, April 10, 2015

Distributed Systems. 27. Firewalls and Virtual Private Networks Paul Krzyzanowski. Rutgers University. Fall 2013

IPSec. Slides by Vitaly Shmatikov UT Austin. slide 1

CS 6324: Information Security More Info on Key Establishment: RSA, DH & QKD

CRYPTOGRAPHY AND NETWROK SECURITY-QUESTION BANK

APNIC elearning: Cryptography Basics

Fundamental Questions to Answer About Computer Networking, Jan 2009 Prof. Ying-Dar Lin,

CSC Network Security

SECURITY STORY WE NEVER SEE, TOUCH NOR HOLD YOUR DATA

CS155 Firewalls. Why Firewalls? Why Firewalls? Bugs, Bugs, Bugs

CompTIA Security+ (2008 Edition) Exam

CSE 127: Computer Security Cryptography. Kirill Levchenko

David Wetherall, with some slides from Radia Perlman s security lectures.

Lecture 13 Page 1. Lecture 13 Page 3

Transport Layer Security

Summary on Crypto Primitives and Protocols

Lecture Nov. 21 st 2006 Dan Wendlandt ISP D ISP B ISP C ISP A. Bob. Alice. Denial-of-Service. Password Cracking. Traffic.

Computer and Network Security

Internetworking Lecture 10. Communications and network security

Computer Security. 12. Firewalls & VPNs. Paul Krzyzanowski. Rutgers University. Spring 2018

Computer Security 3e. Dieter Gollmann. Security.di.unimi.it/sicurezza1415/ Chapter 16: 1

Protocols, Technologies and Standards Secure network protocols for the OSI stack P2.1 WLAN Security WPA, WPA2, IEEE i, IEEE 802.1X P2.

BraindumpsVCE. Best vce braindumps-exam vce pdf free download

Encryption. INST 346, Section 0201 April 3, 2018

Securing Internet Communication: TLS

Basic Concepts in Intrusion Detection

A SIMPLE INTRODUCTION TO TOR

Introduction to Network Security Missouri S&T University CPE 5420 Data Integrity Algorithms

Firewalls, Tunnels, and Network Intrusion Detection

Chapter 4: Securing TCP connections

Network Security - ISA 656 Review

VPN Overview. VPN Types

Understanding Cisco Cybersecurity Fundamentals

Overview of SSL/TLS. Luke Anderson. 12 th May University Of Sydney.

Distributed Systems. 26. Cryptographic Systems: An Introduction. Paul Krzyzanowski. Rutgers University. Fall 2015

WAP Security. Helsinki University of Technology S Security of Communication Protocols

TinySec: A Link Layer Security Architecture for Wireless Sensor Networks. Presented by Paul Ruggieri

Hacking Air Wireless State of the Nation. Presented By Adam Boileau

Chapter 8 Network Security

20-CS Cyber Defense Overview Fall, Network Basics

Information Security: Principles and Practice Second Edition. Mark Stamp

CE Advanced Network Security Wireless Security

Computer Security. 10r. Recitation assignment & concept review. Paul Krzyzanowski. Rutgers University. Spring 2018

Stream Ciphers. Stream Ciphers 1

SSL/TLS. Pehr Söderman Natsak08/DD2495

CSC 474/574 Information Systems Security

TLS 1.1 Security fixes and TLS extensions RFC4346

WiFuzz: Detecting and Exploiting Logical Flaws in the Wi-Fi Cryptographic Handshake

Analysis of Security or Wired Equivalent Privacy Isn t. Nikita Borisov, Ian Goldberg, and David Wagner

CyberP3i Course Module Series

Palo Alto Networks PAN-OS

Managing and Securing Computer Networks. Guy Leduc. Chapter 7: Securing LANs. Chapter goals: security in practice: Security in the data link layer

Internet Protocol and Transmission Control Protocol

CS Paul Krzyzanowski

Sankalchand Patel College of Engineering, Visnagar Department of Computer Engineering & Information Technology. Question Bank

Firewalls, IDS and IPS. MIS5214 Midterm Study Support Materials

Network Defenses 21 JANUARY KAMI VANIEA 1

Unit 4: Firewalls (I)

Total No. of Questions : 09 ] [ Total No.of Pages : 02

IPSec. Overview. Overview. Levente Buttyán

Computer Security 3/23/18

symmetric cryptography s642 computer security adam everspaugh

CIS 4360 Secure Computer Systems Applied Cryptography

Network Defenses KAMI VANIEA 1

ECE 435 Network Engineering Lecture 23

ACS / Computer Security And Privacy. Fall 2018 Mid-Term Review

PRNGs & DES. Luke Anderson. 16 th March University Of Sydney.

Prof. Shervin Shirmohammadi SITE, University of Ottawa. Security Architecture. Lecture 13: Prof. Shervin Shirmohammadi CEG

Computer Networks. Wenzhong Li. Nanjing University

(2½ hours) Total Marks: 75

CPSC 467: Cryptography and Computer Security

Coming of Age: A Longitudinal Study of TLS Deployment

EEC-682/782 Computer Networks I

n Learn about the Security+ exam n Learn basic terminology and the basic approaches n Implement security configuration parameters on network

Transcription:

Outline CSci 5271 Introduction to Computer Security Day 21: Firewalls, NATs, and IDSes Stephen McCamant University of Minnesota, Computer Science & Engineering Side-channel attacks Timing analysis: Number of 1 bits in modular exponentiation Unpadding, MAC checking, error handling Probe cache state of AES table entries Power analysis Especially useful against smartcards Fault injection Data non-erasure Hard disks, cold boot on RAM WEP privacy First WiFi encryption standard: Wired Equivalent Privacy (WEP) F&S: designed by a committee that contained no cryptographers Problem 1: note privacy : what about integrity? Nope: stream cipher + CRC = easy bit flipping WEP shared key Single key known by all parties on network Easy to compromise Hard to change Also often disabled by default Example: a previous employer WEP key size and IV size Original sizes: 40-bit shared key (export restrictions) plus 24-bit IV = 64-bit RC4 key Both too small 128-bit upgrade kept 24-bit IV Vague about how to choose IVs Least bad: sequential, collision takes hours Worse: random or everyone starts at zero

WEP RC4 related key attacks Only true crypto weakness RC4 key schedule vulnerable when: RC4 keys very similar (e.g., same key, similar IV) First stream bytes used Not a practical problem for other RC4 users like SSL Key from a hash, skip first output bytes New problem with WPA (CCS 17) Session key set up in a 4-message handshake Key reinstallation attack: replay #3 Causes most implementations to reset nonce and replay counter In turn allowing many other attacks One especially bad case: reset key to 0 Protocol state machine behavior poorly described in spec Outside the scope of previous security proofs Trustworthiness of primitives Classic worry: DES S-boxes Obviously in trouble if cipher chosen by your adversary In a public spec, most worrying are unexplained elements Best practice: choose constants from well-known math, like digits of Dual EC DRBG (1) Pseudorandom generator in NIST standard, based on elliptic curve Looks like provable (slow enough!) but strangely no proof Specification includes long unexplained constants Academic researchers find: Some EC parts look good But outputs are statistically distinguishable Dual EC DRBG (2) Found 2007: special choice of constants allows prediction attacks Big red flag for paranoid academics Significant adoption in products sold to US govt. FIPS-140 standards Semi-plausible rationale from RSA (EMC) NSA scenario basically confirmed by Snowden leaks NIST and RSA immediately recommend withdrawal Post-quantum cryptography One thing quantum computers would be good for is breaking crypto Square root speedup of general search Countermeasure: double symmetric security level Factoring and discrete log become poly-time DH, RSA, DSA, elliptic curves totally broken Totally new primitives needed (lattices, etc.) Not a problem yet, but getting ready

Outline Note to early readers This is the section of the slides most likely to change in the final version If class has already happened, make sure you have the latest slides for announcements More readings coming up HA2 in the home stretch More details on how to set up firewalls Burglar alarms and mimicry attack on IDSes Containing high-speed worms Virus evolution All parts due Friday by 11:55pm Extra office hour Thursday 10-11am 4-225E Outline Internet addition: middleboxes Original design: middle of net is only routers End-to-end principle Modern reality: more functionality in the network Security is one major driver

Security/connectivity tradeoff What a firewall is A lot of security risk comes from a network connection Attacker could be anywhere in the world Reducing connectivity makes security easier Connectivity demand comes from end users Basically, a router that chooses not to forward some traffic Based on an a-priori policy More complex architectures have multiple layers DMZ: area between outer and inner layers, for outward-facing services Inbound and outbound control Default: deny Most obvious firewall use: prevent attacks from the outside Often also some control of insiders Block malware-infected hosts Employees wasting time on Facebook Selling sensitive info to competitors Nation-state Internet management May want to log or rate-limit, not block Usual whitelist approach: first, block everything Then allow certain traffic Basic: filter packets based on headers More sophisticated: proxy traffic at a higher level IPv4 address scarcity Design limit of 2 32 hosts Actually less for many reasons Addresses becoming gradually more scarce over a many-year scale Some high-profile exhaustions in 2011 IPv6 adoption still very low, occasional signs of progress Network address translation (NAT) Middlebox that rewrites addresses in packets Main use: allow inside network to use non-unique IP addresses RFC 1918: 10.*, 192.168.*, etc. While sharing one outside IP address Inside hosts not addressable from outside De-facto firewall

Packet filtering rules Match based on: Source IP address Source port Destination IP address Destination port Packet flags: TCP vs. UDP, TCP ACK, etc. Action, e.g. allow or block Obviously limited in specificity Client and server ports TCP servers listen on well-known port numbers Often < 1024, e.g. 22 for SSH or 80 for HTTP Clients use a kernel-assigned random high port Plain packet filter would need to allow all high-port incoming traffic Stateful filtering In general: firewall rules depend on previously-seen traffic Key instance: allow replies to an outbound connection See: port 23746 to port 80 Allow incoming port 23746 To same inside host Needed to make a NAT practical Circuit-level proxying Firewall forwards TCP connections for inside client Standard protocol: SOCKS Supported by most web browsers Wrapper approaches for non-aware apps Not much more powerful than packet-level filtering Application-level proxying Tunneling Knows about higher-level semantics Long history for, e.g., email, now HTTP most important More knowledge allows better filtering decisions But, more effort to set up Newer: transparent proxy Pretty much a man-in-the-middle Any data can be transmitted on any channel, if both sides agree E.g., encapsulate IP packets over SSH connection Compare covert channels, steganography Powerful way to subvert firewall Some legitimate uses

Outline Basic idea: detect attacks The worst attacks are the ones you don t even know about Best case: stop before damage occurs Marketed as prevention Still good: prompt response Challenge: what is an attack? Network and host-based IDSes Signature matching Network IDS: watch packets similar to firewall But don t know what s bad until you see it More often implemented offline Host-based IDS: look for compromised process or user from within machine Signature is a pattern that matches known bad behavior Typically human-curated to ensure specificity See also: anti-virus scanners Anomaly detection Recall: FPs and FNs Learn pattern of normal behavior Not normal is a sign of a potential attack Has possibility of finding novel attacks Performance depends on normal behavior too False positive: detector goes off without real attack False negative: attack happens without detection Any detector design is a tradeoff between these (ROC curve)

Signature and anomaly weaknesses Signatures Won t exist for novel attacks Often easy to attack around Anomaly detection Hard to avoid false positives Adversary can train over time Base rate problems If the true incidence is small (low base rate), most positives will be false Example: screening test for rare disease Easy for false positives to overwhelm admins E.g., 100 attacks out of 10 million packets, 0.01% FP rate How many false alarms? Adversarial challenges FP/FN statistics based on a fixed set of attacks But attackers won t keep using techniques that are detected Instead, will look for: Existing attacks that are not detected Minimal changes to attacks Truly novel attacks Wagner and Soto mimicry attack Host-based IDS based on sequence of syscalls Compute A \ M, where: A models allowed sequences M models sequences achieving attacker s goals Further techniques required: Many syscalls made into NOPs Replacement subsequences with similar effect Next time Malware and network denial of service