Your SlideShare is downloading. ×
Ch7 2ed
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×

Introducing the official SlideShare app

Stunning, full-screen experience for iPhone and Android

Text the download link to your phone

Standard text messaging rates apply

Ch7 2ed

127
views

Published on


0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
127
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
4
Comments
0
Likes
0
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  • 1. Chapter 7Network SecurityA note on the use of these ppt slides:We’re making these slides freely available to all (faculty, students, readers). Computer Networking:They’re in powerpoint form so you can add, modify, and delete slides(including this one) and slide content to suit your needs. They obviously A Top Down Approachrepresent a lot of work on our part. In return for use, we only ask the Featuring the Internet,following: If you use these slides (e.g., in a class) in substantially unaltered form,that you mention their source (after all, we’d like people to use our book!) 2nd edition. Jim Kurose, Keith Ross If you post any slides in substantially unaltered form on a www site, thatyou note that they are adapted from (or perhaps identical to) our slides, andnote our copyright of this material. Addison-Wesley, JulyThanks and enjoy! JFK/KWR 2002.All material copyright 1996-2002J.F Kurose and K.W. Ross, All Rights Reserved Network Security 7-1
  • 2. Chapter 7: Network SecurityChapter goals: understand principles of network security: cryptography and its many uses beyond “confidentiality” authentication message integrity key distribution security in practice: firewalls security in application, transport, network, link layers Network Security 7-2
  • 3. Chapter 7 roadmap7.1 What is network security?7.2 Principles of cryptography7.3 Authentication7.4 Integrity7.5 Key Distribution and certification7.6 Access control: firewalls7.7 Attacks and counter measures7.8 Security in many layers Network Security 7-3
  • 4. What is network security?Confidentiality: only sender, intended receiver should “understand” message contents sender encrypts message receiver decrypts messageAuthentication: sender, receiver want to confirm identity of each otherMessage Integrity: sender, receiver want to ensure message not altered (in transit, or afterwards) without detectionAccess and Availability: services must be accessible and available to users Network Security 7-4
  • 5. Friends and enemies: Alice, Bob, Trudy well-known in network security world Bob, Alice (lovers!) want to communicate “securely” Trudy (intruder) may intercept, delete, add messages Alice Bob data, control channel messagesdata secure secure data sender receiver Trudy Network Security 7-5
  • 6. Who might Bob, Alice be? … well, real-life Bobs and Alices! Web browser/server for electronic transactions (e.g., on-line purchases) on-line banking client/server DNS servers routers exchanging routing table updates other examples? Network Security 7-6
  • 7. There are bad guys (and girls) out there!Q: What can a “bad guy” do?A: a lot! eavesdrop: intercept messages actively insert messages into connection impersonation: can fake (spoof) source address in packet (or any field in packet) hijacking: “take over” ongoing connection by removing sender or receiver, inserting himself in place denial of service: prevent service from being used by others (e.g., by overloading resources)more on this later …… Network Security 7-7
  • 8. Chapter 7 roadmap7.1 What is network security?7.2 Principles of cryptography7.3 Authentication7.4 Integrity7.5 Key Distribution and certification7.6 Access control: firewalls7.7 Attacks and counter measures7.8 Security in many layers Network Security 7-8
  • 9. The language of cryptography Alice’s Bob’s K encryption K decryption A key B keyplaintext encryption ciphertext decryption plaintext algorithm algorithmsymmetric key crypto: sender, receiver keys identicalpublic-key crypto: encryption key public, decryption key secret (private) Network Security 7-9
  • 10. Symmetric key cryptographysubstitution cipher: substituting one thing for another monoalphabetic cipher: substitute one letter for another plaintext: abcdefghijklmnopqrstuvwxyz ciphertext: mnbvcxzasdfghjklpoiuytrewq E.g.: Plaintext: bob. i love you. alice ciphertext: nkn. s gktc wky. mgsbcQ: How hard to break this simple cipher?:  brute force (how hard?)  other? Network Security 7-
  • 11. Symmetric key cryptography KA-B KA-B plaintext encryption ciphertext decryption plaintextmessage, m algorithm algorithm K (m) A-B m=K ( K (m) ) A-B A-B symmetric key crypto: Bob and Alice share know same (symmetric) key: K A-B e.g., key is knowing substitution pattern in mono alphabetic substitution cipher Q: how do Bob and Alice agree on key value? Network Security 7-
  • 12. Symmetric key crypto: DESDES: Data Encryption Standard US encryption standard [NIST 1993] 56-bit symmetric key, 64-bit plaintext input How secure is DES? DES Challenge: 56-bit-key-encrypted phrase (“Strong cryptography makes the world a safer place”) decrypted (brute force) in 4 months no known “backdoor” decryption approach making DES more secure: use three keys sequentially (3-DES) on each datum use cipher-block chaining Network Security 7-
  • 13. Symmetric keycrypto: DESDES operationinitial permutation16 identical “rounds” of function application, each using different 48 bits of keyfinal permutation Network Security 7-
  • 14. AES: Advanced Encryption Standard new (Nov. 2001) symmetric-key NIST standard, replacing DES processes data in 128 bit blocks 128, 192, or 256 bit keys brute force decryption (try each key) taking 1 sec on DES, takes 149 trillion years for AES Network Security 7-
  • 15. Public Key Cryptographysymmetric key crypto public key cryptography requires sender, radically different receiver know shared approach [Diffie- secret key Hellman76, RSA78] Q: how to agree on key sender, receiver do in first place not share secret key (particularly if never public encryption key “met”)? known to all private decryption key known only to receiver Network Security 7-
  • 16. Public key cryptography + Bob’s public K B key - Bob’s private K B key plaintext encryption ciphertext decryption plaintextmessage, m algorithm + algorithm message K (m) - + B m = K B(K (m)) B Network Security 7-
  • 17. Public key encryption algorithmsRequirements: + . 1 need K B( ) and K - ( ) such that B . - + K (K (m)) = m B B + given public key K , it should be impossible to compute private key K 2 B - B RSA: Rivest, Shamir, Adelson algorithm Network Security 7-
  • 18. RSA: Choosing keys1. Choose two large prime numbers p, q. (e.g., 1024 bits each)2. Compute n = pq, z = (p-1)(q-1)3. Choose e (with e<n) that has no common factors with z. (e, z are “relatively prime”).4. Choose d such that ed-1 is exactly divisible by z. (in other words: ed mod z = 1 ).5. Public key is (n,e). Private key is (n,d). + - KB KB Network Security 7-
  • 19. RSA: Encryption, decryption0. Given (n,e) and (n,d) as computed above1. To encrypt bit pattern, m, compute e c = m e mod n (i.e., remainder when m is divided by n)2. To decrypt received bit pattern, c, compute d m = c d mod n (i.e., remainder when c is divided by n) Magic d m = (m e mod n) mod n happens! c Network Security 7-
  • 20. RSA example: Bob chooses p=5, q=7. Then n=35, z=24. e=5 (so e, z relatively prime). d=29 (so ed-1 exactly divisible by z. letter m me c = me mod nencrypt: l 12 1524832 17 ddecrypt: c c m = cd mod n letter 17 481968572106750915091411825223071697 12 l Network Security 7-
  • 21. RSA: Why is that d m = (m e mod n) mod nUseful number theory result: If p,q prime andn = pq, then: y y mod (p-1)(q-1) x mod n = x mod n e(m mod n) d mod n = med mod n ed mod (p-1)(q-1) = m mod n (using number theory result above) 1 = m mod n (since we chose ed to be divisible by (p-1)(q-1) with remainder 1 ) = m Network Security 7-
  • 22. RSA: another important propertyThe following property will be very useful later: - + + - K (K (m)) = m = K (K (m)) B B B B use public key use private key first, followed first, followed by private key by public key Result is the same! Network Security 7-
  • 23. Chapter 7 roadmap7.1 What is network security?7.2 Principles of cryptography7.3 Authentication7.4 Integrity7.5 Key Distribution and certification7.6 Access control: firewalls7.7 Attacks and counter measures7.8 Security in many layers Network Security 7-
  • 24. AuthenticationGoal: Bob wants Alice to “prove” her identity to himProtocol ap1.0: Alice says “I am Alice” “I am Alice” Failure scenario?? Network Security 7-
  • 25. AuthenticationGoal: Bob wants Alice to “prove” her identity to himProtocol ap1.0: Alice says “I am Alice” in a network, Bob can not “see” Alice, so Trudy simply “I am Alice” declares herself to be Alice Network Security 7-
  • 26. Authentication: another try Protocol ap2.0: Alice says “I am Alice” in an IP packet containing her source IP address Alice’s IP address “I am Alice” Failure scenario?? Network Security 7-
  • 27. Authentication: another try Protocol ap2.0: Alice says “I am Alice” in an IP packet containing her source IP address Trudy can create a packet Alice’s “spoofing” IP address “I am Alice” Alice’s address Network Security 7-
  • 28. Authentication: another try Protocol ap3.0: Alice says “I am Alice” and sends her secret password to “prove” it. Alice’s Alice’s “I’m Alice” IP addr password Alice’s Failure scenario?? OK IP addr Network Security 7-
  • 29. Authentication: another try Protocol ap3.0: Alice says “I am Alice” and sends her secret password to “prove” it. Alice’s Alice’s “I’m Alice” IP addr password playback attack: Trudy Alice’s records Alice’s packet OK IP addr and later plays it back to Bob Alice’s Alice’s “I’m Alice” IP addr password Network Security 7-
  • 30. Authentication: yet another try Protocol ap3.1: Alice says “I am Alice” and sends her encrypted secret password to “prove” it. Alice’s encrypted “I’m Alice” IP addr password Alice’s Failure scenario?? OK IP addr Network Security 7-
  • 31. Authentication: another try Protocol ap3.1: Alice says “I am Alice” and sends her encrypted secret password to “prove” it. Alice’s encryppted IP addr password “I’m Alice” record and Alice’s OK playback IP addr still works! Alice’s encrypted “I’m Alice” IP addr password Network Security 7-
  • 32. Authentication: yet another try Goal: avoid playback attackNonce: number (R) used only once –in-a-lifetime ap4.0: to prove Alice “live”, Bob sends Alice nonce, R. Alice must return R, encrypted with shared secret key “I am Alice” R KA-B(R) Alice is live, and only Alice knows key to encrypt nonce, so it must Failures, drawbacks? be Alice! Network Security 7-
  • 33. Authentication: ap5.0ap4.0 requires shared symmetric key can we authenticate using public key techniques?ap5.0: use nonce, public key cryptography “I am Alice” Bob computes R + - - KA(KA (R)) = R K A (R) and knows only Alice “send me your public key” could have the private + key, that encrypted R KA such that + - K (K (R)) = R A A Network Security 7-
  • 34. ap5.0: security hole Man (woman) in the middle attack: Trudy poses as Alice (to Bob) and as Bob (to Alice) I am Alice I am Alice R - K (R) T R - Send me your public key K (R) + A K T Send me your public key + K A + K (m) Trudy gets T - + + m = K (K (m)) K (m) A sends T to Alice m T - + ennrypted withm = K (K (m)) A A Alice’s public key Network Security 7-
  • 35. ap5.0: security holeMan (woman) in the middle attack: Trudy poses as Alice (to Bob) and as Bob (to Alice)Difficult to detect: Bob receives everything that Alice sends, and viceversa. (e.g., so Bob, Alice can meet one week later andrecall conversation) problem is that Trudy receives all messages as well! Network Security 7-
  • 36. Chapter 7 roadmap7.1 What is network security?7.2 Principles of cryptography7.3 Authentication7.4 Message integrity7.5 Key Distribution and certification7.6 Access control: firewalls7.7 Attacks and counter measures7.8 Security in many layers Network Security 7-
  • 37. Digital SignaturesCryptographic technique analogous to hand- written signatures. sender (Bob) digitally signs document, establishing he is document owner/creator. verifiable, nonforgeable: recipient (Alice) can prove to someone that Bob, and no one else (including Alice), must have signed document Network Security 7-
  • 38. Digital Signatures Simple digital signature for message m: Bob signs m by encrypting with his private key - - KB, creating “signed” message, KB(m) - Bob’s message, m K B Bob’s private - K B(m) key Dear Alice Bob’s message, Oh, how I have missed Public key m, signed you. I think of you all the time! …(blah blah blah) encryption (encrypted) with algorithm his private key Bob Network Security 7-
  • 39. Digital Signatures (more) - Suppose Alice receives msg m, digital signature KB(m) Alice verifies m signed by Bob by applying Bob’s - + + - public key KB to KB(m) then checks KB(KB(m) ) = m. + - If KB(KB(m) ) = m, whoever signed m must have used Bob’s private key. Alice thus verifies that: Bob signed m. No one else signed m. Bob signed m and not m’. Non-repudiation: -  Alice can take m, and signature KB(m) to court and prove that Bob signed m. Network Security 7-
  • 40. Message Digests large H: Hash message Function mComputationally expensive to public-key-encrypt H(m) long messagesGoal: fixed-length, easy- Hash function properties: to-compute digital many-to-1 “fingerprint” produces fixed-size msg apply hash function H digest (fingerprint) to m, get fixed size given message digest x, message digest, H(m). computationally infeasible to find m such that x = H(m) Network Security 7-
  • 41. Internet checksum: poor crypto hash functionInternet checksum has some properties of hash function: produces fixed length digest (16-bit sum) of message is many-to-oneBut given message with given hash value, it is easy to find another message with same hash value:message ASCII format message ASCII formatI O U 1 49 4F 55 31 I O U 9 49 4F 55 390 0 . 9 30 30 2E 39 0 0 . 1 30 30 2E 319 B O B 39 42 D2 42 9 B O B 39 42 D2 42 B2 C1 D2 AC different messages B2 C1 D2 AC but identical checksums! Network Security 7-
  • 42. Digital signature = signed message digest Alice verifies signature and Bob sends digitally signed integrity of digitally signed message: message: large message H: Hash encrypted m function H(m) msg digest - KB(H(m)) Bob’s digital large private signature message - Bob’s key KB (encrypt) m digital public + signature key KB encrypted H: Hash (decrypt) msg digest function - + KB(H(m)) H(m) H(m) equal ? Network Security 7-
  • 43. Hash Function Algorithms MD5 hash function widely used (RFC 1321) computes 128-bit message digest in 4-step process. arbitrary 128-bit string x, appears difficult to construct msg m whose MD5 hash is equal to x. SHA-1 is also used. US standard [NIST, FIPS PUB 180-1] 160-bit message digest Network Security 7-
  • 44. Chapter 7 roadmap7.1 What is network security?7.2 Principles of cryptography7.3 Authentication7.4 Integrity7.5 Key distribution and certification7.6 Access control: firewalls7.7 Attacks and counter measures7.8 Security in many layers Network Security 7-
  • 45. Trusted IntermediariesSymmetric key problem: Public key problem: How do two entities When Alice obtains establish shared secret Bob’s public key (from key over network? web site, e-mail,Solution: diskette), how does she know it is Bob’s public trusted key distribution key, not Trudy’s? center (KDC) acting as intermediary between Solution: entities trusted certification authority (CA) Network Security 7-
  • 46. Key Distribution Center (KDC) Alice, Bob need shared symmetric key. KDC: server shares different secret key with each registered user (many users) Alice, Bob know own symmetric keys, KA-KDC KB-KDC , for communicating with KDC. KDC KA-KDC KP-KDC KX-KDC KP-KDC KB-KDC KY-KDC KZ-KDC KA-KDC KB-KDC Network Security 7-
  • 47. Key Distribution Center (KDC)Q: How does KDC allow Bob, Alice to determine sharedsymmetric secret key to communicate with each other? KDC generates KA-KDC(A,B) R1Alice KA-KDC(R1, KB-KDC(A,R1) ) Bob knows toknows use R1 to R1 KB-KDC(A,R1) communicate with Alice Alice and Bob communicate: using R1 as session key for shared symmetric encryption Network Security 7-
  • 48. Certification Authorities Certification authority (CA): binds public key to particular entity, E. E (person, router) registers its public key with CA. E provides “proof of identity” to CA. CA creates certificate binding E to its public key. certificate containing E’s public key digitally signed by CA – CA says “this is E’s public key” Bob’s digital + public + signature KB key KB (encrypt) CA certificate for K- Bob’s private identifying key CA Bob’s public key,information signed by CA Network Security 7-
  • 49. Certification Authorities When Alice wants Bob’s public key: gets Bob’s certificate (Bob or elsewhere). apply CA’s public key to Bob’s certificate, get Bob’s public key + digital Bob’s KB signature public + (decrypt) K B key CA public + K CA key Network Security 7-
  • 50. A certificate contains: Serial number (unique to issuer) info about certificate owner, including algorithm and key value itself (not shown) info about certificate issuer valid dates digital signature by issuer Network Security 7-
  • 51. Chapter 7 roadmap7.1 What is network security?7.2 Principles of cryptography7.3 Authentication7.4 Integrity7.5 Key Distribution and certification7.6 Access control: firewalls7.7 Attacks and counter measures7.8 Security in many layers Network Security 7-
  • 52. Firewallsfirewallisolates organization’s internal net from largerInternet, allowing some packets to pass,blocking others. administered public network Internet firewall Network Security 7-
  • 53. Firewalls: Whyprevent denial of service attacks: SYN flooding: attacker establishes many bogus TCP connections, no resources left for “real” connections.prevent illegal modification/access of internal data. e.g., attacker replaces CIA’s homepage with something elseallow only authorized access to inside network (set of authenticated users/hosts)two types of firewalls: application-level packet-filtering Network Security 7-
  • 54. Should arrivingPacket Filtering packet be allowed in? Departing packet let out? internal network connected to Internet via router firewall router filters packet-by-packet, decision to forward/drop packet based on: source IP address, destination IP address TCP/UDP source and destination port numbers ICMP message type TCP SYN and ACK bits Network Security 7-
  • 55. Packet Filtering Example 1: block incoming and outgoing datagrams with IP protocol field = 17 and with either source or dest port = 23. All incoming and outgoing UDP flows and telnet connections are blocked. Example 2: Block inbound TCP segments with ACK=0. Prevents external clients from making TCP connections with internal clients, but allows internal clients to connect to outside. Network Security 7-
  • 56. Application gateways gateway-to-remote host telnet session host-to-gateway telnet session Filters packets on application data as well application gateway router and filter as on IP/TCP/UDP fields. Example: allow select internal users to telnet outside. 1. Require all telnet users to telnet through gateway. 2. For authorized users, gateway sets up telnet connection to dest host. Gateway relays data between 2 connections 3. Router filter blocks all telnet connections not originating from gateway. Network Security 7-
  • 57. Limitations of firewalls and gateways IP spoofing: router filters often use all or can’t know if data nothing policy for UDP. “really” comes from tradeoff: degree of claimed source communication with if multiple app’s. need outside world, level of special treatment, each security has own app. gateway. many highly protected client software must sites still suffer from know how to contact attacks. gateway. e.g., must set IP address of proxy in Web browser Network Security 7-
  • 58. Chapter 7 roadmap7.1 What is network security?7.2 Principles of cryptography7.3 Authentication7.4 Integrity7.5 Key Distribution and certification7.6 Access control: firewalls7.7 Attacks and counter measures7.8 Security in many layers Network Security 7-
  • 59. Internet security threatsMapping: before attacking: “case the joint” – find out what services are implemented on network Use ping to determine what hosts have addresses on network Port-scanning: try to establish TCP connection to each port in sequence (see what happens) nmap (http://www.insecure.org/nmap/) mapper: “network exploration and security auditing”Countermeasures? Network Security 7-
  • 60. Internet security threatsMapping: countermeasures record traffic entering network look for suspicious activity (IP addresses, pots being scanned sequentially) Network Security 7-
  • 61. Internet security threatsPacket sniffing: broadcast media promiscuous NIC reads all packets passing by can read all unencrypted data (e.g. passwords) e.g.: C sniffs B’s packets A C src:B dest:A payload BCountermeasures? Network Security 7-
  • 62. Internet security threatsPacket sniffing: countermeasures all hosts in orgnization run software that checks periodically if host interface in promiscuous mode. one host per segment of broadcast media (switched Ethernet at hub) A C src:B dest:A payload B Network Security 7-
  • 63. Internet security threatsIP Spoofing: can generate “raw” IP packets directly from application, putting any value into IP source address field receiver can’t tell if source is spoofed e.g.: C pretends to be B A C src:B dest:A payload BCountermeasures? Network Security 7-
  • 64. Internet security threatsIP Spoofing: ingress filtering routers should not forward outgoing packets with invalid source addresses (e.g., datagram source address not in router’s network) great, but ingress filtering can not be mandated for all networks A C src:B dest:A payload B Network Security 7-
  • 65. Internet security threatsDenial of service (DOS): flood of maliciously generated packets “swamp” receiver Distributed DOS (DDOS): multiple coordinated sources swamp receiver e.g., C and remote host SYN-attack A A C SYN SYN SYN SYN SYN B SYNCountermeasures? SYN Network Security 7-
  • 66. Internet security threatsDenial of service (DOS): countermeasures filter out flooded packets (e.g., SYN) before reaaching host: throw out good with bad traceback to source of floods (most likely an innocent, compromised machine) A C SYN SYN SYN SYN SYN B SYN SYN Network Security 7-
  • 67. Chapter 7 roadmap7.1 What is network security?7.2 Principles of cryptography7.3 Authentication7.4 Integrity7.5 Key Distribution and certification7.6 Access control: firewalls7.7 Attacks and counter measures7.8 Security in many layers 7.8.1. Secure email 7.8.2. Secure sockets 7.8.3. IPsec 8.8.4. 802.11 WEP Network Security 7-
  • 68. Secure e-mail Alice wants to send confidential e-mail, m, to Bob. KSm K (. S ) KS(m ) KS(m ) KS( ) . m + Internet - KS KS +. K () B + + - . KB ( ) KB(KS ) KB(KS ) + - KB KBAlice: generates random symmetric private key, KS. encrypts message with KS (for efficiency) also encrypts KS with Bob’s public key. sends both KS(m) and KB(KS) to Bob. Network Security 7-
  • 69. Secure e-mail Alice wants to send confidential e-mail, m, to Bob. KSm K (. S ) KS(m ) KS(m ) KS( ) . m + Internet - KS KS +. K () B + + - . KB ( ) KB(KS ) KB(KS ) + - KB KBBob: uses his private key to decrypt and recover KS uses KS to decrypt KS(m) to recover m Network Security 7-
  • 70. Secure e-mail (continued)• Alice wants to provide sender authenticationmessage integrity. - KA + KA - -m . H( ) -. K () A KA(H(m)) KA(H(m)) + KA( ) . H(m ) + Internet - compare m H( ). H(m ) m• Alice digitally signs message.• sends both message (in the clear) and digital signature. Network Security 7-
  • 71. Secure e-mail (continued)• Alice wants to provide secrecy, sender authentication, message integrity. - KA - m . H( ) - KA( ) . KA(H(m)) KS + KS( ) . m + Internet KS + KB ( ) . + KB(KS ) + KB Alice uses three keys: her private key, Bob’s public key, newly created symmetric key Network Security 7-
  • 72. Pretty good privacy (PGP) Internet e-mail encryption A PGP signed message: scheme, de-facto standard. ---BEGIN PGP SIGNED MESSAGE--- uses symmetric key Hash: SHA1 cryptography, public key cryptography, hash Bob:My husband is out of town tonight.Passionately yours, function, and digital Alice signature as described. provides secrecy, sender ---BEGIN PGP SIGNATURE--- Version: PGP 5.0 authentication, integrity. Charset: noconv inventor, Phil Zimmerman, yhHJRHhGJGhgg/12EpJ+lo8gE4vB3mqJh was target of 3-year FEvZP9t6n7G6m5Gw2 ---END PGP SIGNATURE--- federal investigation. Network Security 7-
  • 73. Secure sockets layer (SSL) transport layer server authentication: SSL-enabled browser security to any TCP- includes public keys for based app using SSL trusted CAs. services. Browser requests server certificate, used between Web issued by trusted CA. browsers, servers for Browser uses CA’s e-commerce (shttp). public key to extract server’s public key from security services: certificate. server authentication check your browser’s data encryption security menu to see client authentication its trusted CAs. (optional) Network Security 7-
  • 74. SSL (continued)Encrypted SSL session: SSL: basis of IETF Browser generates Transport Layer symmetric session key, Security (TLS). encrypts it with server’s SSL can be used for public key, sends non-Web applications, encrypted key to server. e.g., IMAP. Using private key, server Client authentication decrypts session key. can be done with client Browser, server know certificates. session key All data sent into TCP socket (by client or server) encrypted with session key. Network Security 7-
  • 75. IPsec: Network Layer SecurityNetwork-layer secrecy: For both AH and ESP, source, sending host encrypts the destination handshake: data in IP datagram create network-layer TCP and UDP segments; logical channel called a ICMP and SNMP security association (SA) messages. Each SA unidirectional.Network-layer authentication Uniquely determined by: destination host can authenticate source IP security protocol (AH or address ESP)Two principle protocols: source IP address authentication header 32-bit connection ID (AH) protocol encapsulation security payload (ESP) protocol Network Security 7-
  • 76. Authentication Header (AH) Protocol provides source AH header includes: authentication, data connection identifier integrity, no authentication data: confidentiality source- signed message AH header inserted digest calculated over between IP header, original IP datagram. data field. next header field: protocol field: 51 specifies type of data intermediate routers (e.g., TCP, UDP, ICMP) process datagrams as usual IP header AH header data (e.g., TCP, UDP segment) Network Security 7-
  • 77. ESP Protocol provides secrecy, host ESP authentication authentication, data field is similar to AH integrity. authentication field. data, ESP trailer Protocol = 50. encrypted. next header field is in ESP trailer. authenticated encrypted ESP ESP ESP IP header TCP/UDP segment header trailer authent. Network Security 7-
  • 78. IEEE 802.11 security War-driving: drive around Bay area, see what 802.11 networks available? More than 9000 accessible from public roadways 85% use no encryption/authentication packet-sniffing and various attacks easy! Wired Equivalent Privacy (WEP): authentication as in protocol ap4.0 host requests authentication from access point access point sends 128 bit nonce host encrypts nonce using shared symmetric key access point decrypts nonce, authenticates host Network Security 7-
  • 79. IEEE 802.11 security Wired Equivalent Privacy (WEP): data encryption Host/AP share 40 bit symmetric key (semi- permanent) Host appends 24-bit initialization vector (IV) to create 64-bit key 64 bit key used to generate stream of keys, kiIV kiIV used to encrypt ith byte, di, in frame: ci = di XOR kiIV IV and encrypted bytes, ci sent in frame Network Security 7-
  • 80. 802.11 WEP encryption IV(per frame) KS: 40-bit key sequence generator secret ( for given KS, IV) symmetric k1IV k2IV k3IV … kNIV kN+1IV… kN+1IV 802.11 WEP-encrypted data key IV header plus CRC plaintextframe data d1 d2 d3 … dN CRC1 … CRC4 plus CRC c1 c2 c3 … cN cN+1 … cN+4 Sender-side WEP encryption Figure 7.8-new1: 802.11 WEP protocol Network Security 7-
  • 81. Breaking 802.11 WEP encryptionSecurity hole: 24-bit IV, one IV per frame, -> IV’s eventually reused IV transmitted in plaintext -> IV reuse detected Attack: Trudy causes Alice to encrypt known plaintext d1 d2 d3 d4 … Trudy sees: ci = di XOR kiIV Trudy knows ci di, so can compute kiIV Trudy knows encrypting key sequence k1IV k2IV k3IV … Next time IV is used, Trudy can decrypt! Network Security 7-
  • 82. Network Security (summary)Basic techniques…... cryptography (symmetric and public) authentication message integrity key distribution…. used in many different security scenarios secure email secure transport (SSL) IP sec 802.11 WEP Network Security 7-