Dec 31, 2015

Internet and Intranet Protocols and Applications. Lecture 10 Network (Internet) Security April 3, 2002 Joseph Conron Computer Science Department New York University jconron@cs.nyu.edu. What is network security?. Secrecy: only sender, intended receiver should “understand” msg contents - PowerPoint PPT Presentation

Internet and Intranet Protocols and ApplicationsLecture 10

Network (Internet) Security

April 3, 2002

Joseph ConronComputer Science DepartmentNew York Universityjconron@cs.nyu.edu

What is network security?Secrecy: only sender, intended receiver should understand msg contentssender encrypts msgreceiver decrypts msgAuthentication: sender, receiver want to confirm identity of each other Message Integrity: sender, receiver want to ensure message not altered (in transit, or afterwards) without detectionNon-repudiation: sender cannot claim other than what was sent

Internet security threatsPacket sniffing: broadcast mediapromiscuous NIC reads all packets passing bycan read all unencrypted data (e.g. passwords)e.g.: C sniffs Bs packetsABC

Internet security threatsIP Spoofing: can generate raw IP packets directly from application, putting any value into IP source address fieldreceiver cant tell if source is spoofede.g.: C pretends to be BABC

Internet security threatsDenial of service (DOS): flood of maliciously generated packets swamp receiverDistributed DOS (DDOS): multiple coordinated sources swamp receivere.g., C and remote host SYN-attack AABC

CryptographyEncryption is a process applied to a bit of information that changes the informations appearance, but not its (decrypted) meaning.Decryption is the reverse process.If C is a bit of cipher text (encrypted data) and M is a message (plain text) then,C = Ek(M) and M = Dk(C)Where Ek and Dk are encryption and decryption processes respectively.Ek and Dk are both based on some key k.

Cryptography Algorithmssymmetric key crypto: sender, receiver keys identicalpublic-key crypto: encrypt key public, decrypt key secret Figure 7.3 goes hereplaintextplaintextciphertext

Friends and enemies: Alice, Bob, TrudyWell-known model in network security worldBob, Alice want to communicate securelyTrudy, the intruder may intercept, delete, add messagesSometimes Trudys friend Mallory (malicious) may appearFigure 7.1 goes here

Cryptography BasicsSymmetric Key Cryptography:Ek = Dk (and must be kept SECRET!!!)

Public Key Cryptography:Ek is a public key (everyone can know it)Dk is a private key and belongs to ONE entity.

Symmetric Key Algorithms are fastPublic Key Algorithms are SLOW!!!

Symmetric Key CiphersSubstitution: (a = k, b = q, )Transposition: (c1 = c12, c2 = c5, c3 = c1, )Composition (both substitution and transposition, such as DES)One-Time code pad

Symmetric key cryptographysubstitution cipher: substituting one thing for anothermonoalphabetic cipher: substitute one letter for anotherplaintext: abcdefghijklmnopqrstuvwxyzciphertext: mnbvcxzasdfghjklpoiuytrewqPlaintext: bob. i love you. aliceciphertext: nkn. s gktc wky. mgsbcE.g.:

DES: Data Encryption StandardUS encryption standard [NIST 1993]56-bit symmetric key, 64 bit plain-text inputHow secure is DES?DES Challenge: 56-bit-key-encrypted phrase (Strong cryptography makes the world a safer place) decrypted (brute force) in 4 monthsno known backdoor decryption approach

Symmetric key crypto: DESinitial permutation 16 identical rounds of function application, each using different 48 bits of keyfinal permutation

Public key cryptographyFigure 7.7 goes here

How do public key algorithms work?They depend on the existence of some very hard mathematical problems to solve:Factoring VERY large numbers (example, a number containing 1024 bits!)Calculating discrete logarithmsFind x where ax b (mod n)By hard we mean that it will take a super computer a very long time (months or years)

RSA encryption algorithmRSA depends on factoring large numbers. Here is the algorithm:Need dB( ) and eB( ) such thatNeed public and private keys fordB( ) and eB( )Two inter-related requirements:

- 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
RSA: Encryption, decryption0. Given (n,e) and (n,d) as computed above2. To decrypt received bit pattern, c, compute(i.e., remainder when c is divided by n)d

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. lettermmel12152483217c1748196857210675091509141182522307200012letterlencrypt:decrypt:

AuthenticationGoal: Bob wants Alice to prove her identity to himProtocol ap1.0: Alice says I am AliceFailure scenario??

Authentication: another tryProtocol ap2.0: Alice says I am Alice and sends her IPaddress along to prove it.Failure scenario?

Authentication: another tryProtocol ap3.0: Alice says I am Alice and sends her secret password to prove it.Failure scenario?

Authentication: yet another tryProtocol ap3.1: Alice says I am Alice and sends her encrypted secret password to prove it.Failure scenario?I am Aliceencrypt(password)

Authentication: yet another tryGoal: avoid playback attackFailures, drawbacks?Figure 7.11 goes hereNonce: number (R) used only once in a lifetimeap4.0: to prove Alice live, Bob sends Alice nonce, R. Alicemust return R, encrypted with shared secret key

Authentication: ap5.0ap4.0 requires shared symmetric keyproblem: how do Bob, Alice agree on keycan we authenticate using public key techniques?ap5.0: use nonce, public key cryptographyFigure 7.12 goes here

ap5.0: security holeMan (woman) in the middle attack: Trudy poses as Alice (to Bob) and as Bob (to Alice)Figure 7.14 goes here

Digital Signatures Cryptographic technique analogous to hand-written signatures.Sender (Bob) digitally signs document, establishing he is document owner/creator. Verifiable, nonforgeable: recipient (Alice) can verify that Bob, and no one else, signed document.Simple digital signature for message m:Bob encrypts m with his private key dB, creating signed message, dB(m).Bob sends m and dB(m) to Alice.

Digital Signatures (more)Suppose Alice receives msg m, and digital signature dB(m)Alice verifies m signed by Bob by applying Bobs public key eB to dB(m) then checks eB(dB(m) ) = m.If eB(dB(m) ) = m, whoever signed m must have used Bobs 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 dB(m) to court and prove that Bob signed m.

Message DigestsComputationally expensive to public-key-encrypt long messages Goal: fixed-length,easy to compute digital signature, fingerprintapply hash function H to m, get fixed size message digest, H(m).Hash function properties:Produces fixed-size msg digest (fingerprint)Given message digest x, computationally infeasible to find m such that x = H(m)computationally infeasible to find any two messages m and m such that H(m) = H(m).

Digital signature = Signed message digestBob sends digitally signed message:Alice verifies signature and integrity of digitally signed message:

Hash Function AlgorithmsInternet checksum would make a poor message digest.Too easy to find two messages with same checksum.

MD5 hash function widely used. 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 standard160-bit message digest

Trusted IntermediariesProblem:How do two entities establish shared secret key over network?Solution:trusted key distribution center (KDC) acting as intermediary between entities

Problem:When Alice obtains Bobs public key (from web site, e-mail, diskette), how does she know it is Bobs public key, not Trudys?Solution:trusted certification authority (CA)

Key Distribution Center (KDC)Alice,Bob need shared symmetric key.KDC: server shares different secret key with each registered user. Alice, Bob know own symmetric keys, KA-KDC KB-KDC , for communicating with KDC. Alice communicates with KDC, gets session key R1, and KB-KDC(A,R1)Alice sends Bob KB-KDC(A,R1), Bob extracts R1Alice, Bob now share the symmetric key R1.

Certification AuthoritiesCertification authority (CA) binds public key to particular entity. Entity (person, router, etc.) can register its public key with CA.Entity provides proof of identity to CA. CA creates certificate binding entity to public key.Certificate digitally signed by CA.When Alice wants Bobs public key:gets Bobs certificate (Bob or elsewhere).Apply CAs public key to Bobs certificate, get Bobs public key

Pretty good privacy (PGP)Internet e-mail encryption scheme, a de-facto standard.Uses symmetric key cryptography, public key cryptography, hash function, and digital signature as described.Provides secrecy, sender authentication, integrity.Inventor, Phil Zimmerman, was target of 3-year federal investigation.---BEGIN PGP SIGNED MESSAGE---Hash: SHA1

Bob:My husband is out of town tonight.Passionately yours, Alice

---BEGIN PGP SIGNATURE---Version: PGP 5.0Charset: noconvyhHJRHhGJGhgg/12EpJ+lo8gE4vB3mqJhFEvZP9t6n7G6m5Gw2---END PGP SIGNATURE---

A PGP signed message:

Secure sockets layer (SSL)PGP provides security for a specific network app.SSL works at transport layer. Provides security to any TCP-based app using SSL services. SSL: used between WWW browsers, servers for E-commerce (https).SSL security services:server authenticationdata encryption client authentication (optional)

SSL (continued)Server authentication:SSL-enabled browser includes public keys for trusted CAs.Browser requests server certificate, issued by trusted CA.Browser uses CAs public key to extract servers public key from certificate. Visit your browser's security

Related Documents See more >