chapter 8 network security - nyu computer science .2005-03-01 · 8: network security 8-5 chapter

Download Chapter 8 Network Security - NYU Computer Science .2005-03-01 · 8: Network Security 8-5 Chapter

Post on 19-Jul-2018

213 views

Category:

Documents

0 download

Embed Size (px)

TRANSCRIPT

  • 8: Network Security 8-1

    Internet and Intranet Protocols and Applications

    Lecture 7: Security 2

    March 1, 2005Arthur Goldberg

    Computer Science DepartmentNew York University

    artg@cs.nyu.edu

    8: Network Security 8-2

    Assuming that youve learned the rest from the reading, in class we will only cover slides with titles in italics.

    8: Network Security 8-3

    Chapter 8Network Security

    A note on the use of these ppt slides:Were making these slides freely available to all (faculty, students, readers). Theyre in PowerPoint form so you can add, modify, and delete slides (including this one) and slide content to suit your needs. They obviously represent a lot of work on our part. In return for use, we only ask the following:

    If you use these slides (e.g., in a class) in substantially unaltered form, that you mention their source (after all, wed like people to use our book!)

    If you post any slides in substantially unaltered form on a www site, that you note that they are adapted from (or perhaps identical to) our slides, and note our copyright of this material.

    Thanks and enjoy! JFK/KWR

    All material copyright 1996-2004J.F Kurose and K.W. Ross, All Rights Reserved

    Computer Networking: A Top Down Approach Featuring the Internet,

    3rd edition. Jim Kurose, Keith RossAddison-Wesley, July 2004.

    8: Network Security 8-4

    RSA: another important property

    The following property will be very useful later:

    K (K (m)) = m BB- +

    K (K (m)) BB+ -=

    use public key first, followed by private key

    use private key first, followed by public key

    Result is the same!

  • 8: Network Security 8-5

    Chapter 8 roadmap

    8.1 What is network security?8.2 Principles of cryptography8.3 Authentication8.4 Integrity8.5 Key Distribution and certification8.6 Access control: firewalls8.7 Attacks and counter measures8.8 Security in many layers

    8: Network Security 8-6

    Authentication

    Goal: Bob wants Alice to prove her identity to him

    Protocol ap1.0: Alice says I am Alice

    Failure scenario??I am Alice

    8: Network Security 8-7

    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 declares

    herself to be AliceI am Alice

    8: Network Security 8-8

    Authentication: another try

    Protocol ap2.0: Alice says I am Alice in an IP packetcontaining her source IP address

    Failure scenario??

    I am AliceAlices IP address

  • 8: Network Security 8-9

    Authentication: another try

    Protocol ap2.0: Alice says I am Alice in an IP packetcontaining her source IP address

    Trudy can createa packet

    spoofingAlices addressI am Alice

    Alices IP address

    8: Network Security 8-10

    Authentication: another try

    Protocol ap3.0: Alice says I am Alice and sends her secret password to prove it.

    Failure scenario??

    Im AliceAlices IP addrAlices

    password

    OKAlices IP addr

    8: Network Security 8-11

    Authentication: another tryProtocol ap3.0: Alice says I am Alice and sends her

    secret password to prove it.

    playback attack: Trudy records Alices packet

    and laterplays it back to Bob

    Im AliceAlices IP addrAlices

    password

    OKAlices IP addr

    Im AliceAlices IP addrAlices

    password

    8: Network Security 8-12

    Authentication: yet another try

    Protocol ap3.1: Alice says I am Alice and sends her encrypted secret password to prove it.

    Failure scenario??

    Im AliceAlices IP addrencrypted password

    OKAlices IP addr

  • 8: Network Security 8-13

    Authentication: another tryProtocol ap3.1: Alice says I am Alice and sends her

    encrypted secret password to prove it.

    recordand

    playbackstill works!

    Im AliceAlices IP addrencryptedpassword

    OKAlices IP addr

    Im AliceAlices IP addrencryptedpassword

    8: Network Security 8-14

    Authentication: yet another tryGoal: avoid playback attack

    Failures, drawbacks?

    Nonce: number (R) used only once in-a-lifetimeap4.0: to prove Alice live, Bob sends Alice nonce, R. Alice must return R, encrypted with shared secret key

    I am Alice

    R

    K (R)A-BAlice is live, and only Alice knows key to encrypt

    nonce, so it must be Alice!

    8: Network Security 8-15

    Authentication: ap5.0

    ap4.0 requires shared symmetric key can we authenticate using public key techniques?ap5.0: use nonce, public key cryptography

    I am AliceR

    Bob computes

    K (R)A-

    send me your public key

    K A+

    (K (R)) = RA-K A

    +

    and knows only Alice could have the private key, that encrypted R

    such that(K (R)) = RA

    -K A

    +

    8: Network Security 8-16

    ap5.0: security holeMan (woman) in the middle attack: Trudy poses as

    Alice (to Bob) and as Bob (to Alice)

    I am Alice I am AliceR

    TK (R)-

    Send me your public key

    TK +

    AK (R)-

    Send me your public key

    AK +

    TK (m)+

    Tm = K (K (m))+

    T-

    Trudy gets

    sends m to Alice encrypted with

    Alices public key

    AK (m)+

    Am = K (K (m))+

    A-

    R

  • 8: Network Security 8-17

    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 vice

    versa. (e.g., so Bob, Alice can meet one week later and recall conversation)

    problem is that Trudy receives all messages as well!

    8: Network Security 8-18

    Chapter 8 roadmap

    8.1 What is network security?8.2 Principles of cryptography8.3 Authentication8.4 Message integrity8.5 Key Distribution and certification8.6 Access control: firewalls8.7 Attacks and counter measures8.8 Security in many layers

    8: Network Security 8-19

    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 prove to someone that Bob, and no one else (including Alice), must have signed document

    8: Network Security 8-20

    Digital Signatures

    Simple digital signature for message m: Bob signs m by encrypting with his private key

    KB, creating signed message, KB(m)--

    Dear AliceOh, how I have missed you. I think of you all the time! (blah blah blah)

    Bob

    Bobs message, m

    Public keyencryptionalgorithm

    Bobs privatekey

    K B-

    Bobs message, m, signed

    (encrypted) with his private key

    K B-(m)

  • 8: Network Security 8-21

    Digital Signatures (more) Suppose Alice receives msg m, digital signature KB(m) Alice verifies m signed by Bob by applying Bobs

    public key KB to KB(m) then checks KB(KB(m) ) = m. If KB(KB(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 KB(m) to court and prove that Bob signed m.

    -

    8: Network Security 8-22

    Message Digests

    Computationally expensive to public-key-encrypt long messages

    Goal: fixed-length, easy- to-compute digital fingerprint

    apply hash function H to m, get fixed size message digest, H(m).

    Hash function properties: many-to-1 produces fixed-size msg

    digest (fingerprint) given message digest x,

    computationally infeasible to find m such that x = H(m)

    large message

    m

    H: HashFunction

    H(m)

    8: Network Security 8-23

    Internet checksum: poor crypto hash function

    Internet checksum has some properties of hash function: produces fixed length digest (16-bit sum) of message is many-to-one

    But given message with given hash value, it is easy to find another message with same hash value:

    I O U 10 0 . 99 B O B

    49 4F 55 3130 30 2E 3939 42 D2 42

    message ASCII format

    B2 C1 D2 AC

    I O U 90 0 . 19 B O B

    49 4F 55 3930 30 2E 3139 42 D2 42

    message ASCII format

    B2 C1 D2 ACdifferent messagesbut identical checksums!

    8: Network Security 8-24

    large message

    mH: Hashfunction H(m)

    digitalsignature(encrypt)

    Bobs private

    key K B-

    +

    Bob sends digitally signed message:

    Alice verifies signature and integrity of digitally signed message:

    KB(H(m))-

    encrypted msg digest

    KB(H(m))-

    encrypted msg digest

    large message

    m

    H: Hashfunction

    H(m)

    digitalsignature(decrypt)

    H(m)

    Bobs public

    key K B+

    equal ?

    Digital signature = signed message digest

  • 8: Network Security 8-25

    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

    8: Network Security 8-26

    Chapter 8 roadmap

    8.1 What is network security?8.2 Principles of cryptography8.3 Authentication8.4 Integrity8.5 Key distribution and certification8.6 Access control: firewalls8.7 Attacks and counter measures8.8 Security in many layers

    8: Network Security 8-27

    Trusted Intermediaries

    Symmetric key problem: How do two entities

    establish shared secret key over network?

    Solution: trusted key distribution

    cen

Recommended

View more >