DOC PREVIEW
Pitt IS 2150 - Key Management

This preview shows page 1-2-3-4-29-30-31-32-33-60-61-62-63 out of 63 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Nov 1, 2005IssuesNotationSession, Interchange KeysBenefitsKey Exchange AlgorithmsClassical Key ExchangeSimple Key Exchange ProtocolProblemsNeedham-SchroederArgument: Alice talking to BobArgument: Bob talking to AliceProblem with Needham-SchroederSolution: Denning-Sacco ModificationNeedham-Schroeder with Denning-Sacco ModificationOtway-Rees ProtocolThe ProtocolSlide 18Slide 19Replay AttackKerberosSlide 22OverviewTicketAuthenticatorProtocolAnalysisSlide 28Public Key Key ExchangeProblem and SolutionNotesMan-in-the-Middle AttackKey GenerationWhat is “Random”?What is “Pseudorandom”?Best Pseudorandom NumbersCryptographic Key InfrastructureCertificatesUseMerkle’s Tree SchemeDetailsValidationProblemCertificate Signature ChainsX.509 ChainsX.509 Certificate ValidationIssuersValidation and Cross-CertifyingPGP ChainsOpenPGP Signature PacketSigningValidating CertificatesStream and Block CipherDigital SignatureCommon ErrorClassical Digital SignaturesPublic Key Digital Signatures (RSA)RSA Digital SignaturesAttack #1Attack #2: Bob’s RevengeEl Gamal Digital SignatureExampleAttack1IS2150/TEL2810: Introduction to Computer SecurityNov 1, 2005Nov 1, 2005Introduction to Introduction to Computer SecurityComputer SecurityLecture 8Lecture 8Key ManagementKey ManagementIS2150/TEL2810: Introduction to Computer Security 2IssuesIssuesAuthentication and distribution of keysAuthentication and distribution of keysSession keyKey exchange protocolsKerberosMechanisms to bind an identity to a keyMechanisms to bind an identity to a keyGeneration, maintenance and revoking of Generation, maintenance and revoking of keyskeysIS2150/TEL2810: Introduction to Computer Security 3NotationNotationXX  YY : { : { ZZ || || WW } } kkXX,,YYX sends Y the message produced by concatenating Z and W enciphered by key kX,Y, which is shared by users X and YAA  TT : { : { ZZ } } kkAA || { || { WW } } kkAA,,TTA sends T a message consisting of the concatenation of Z enciphered using kA, A’s key, and W enciphered using kA,T, the key shared by A and Trr11, , rr22 nonces (nonrepeating random numbers) nonces (nonrepeating random numbers)IS2150/TEL2810: Introduction to Computer Security 4Session, Interchange KeysSession, Interchange KeysAlice wants to send a message Alice wants to send a message mm to Bob to BobAssume public key encryptionAlice generates a random cryptographic key ks and uses it to encipher mTo be used for this message onlyCalled a session keyShe enciphers ks with Bob’s public key kBkB enciphers all session keys Alice uses to communicate with BobCalled an interchange keyAlice sends { m } ks { ks } kBIS2150/TEL2810: Introduction to Computer Security 5BenefitsBenefitsLimits amount of traffic enciphered with single keyLimits amount of traffic enciphered with single keyStandard practice, to decrease the amount of traffic an attacker can obtainMakes replay attack less effectiveMakes replay attack less effectivePrevents some attacksPrevents some attacksExample: Alice will send Bob message that is either “BUY” or “SELL”. Eve computes possible ciphertexts {“BUY”} kB and {“SELL”} kB. Eve intercepts enciphered message, compares, and gets plaintext at onceIS2150/TEL2810: Introduction to Computer Security 6Key Exchange AlgorithmsKey Exchange AlgorithmsGoal: Alice, Bob use a shared key to Goal: Alice, Bob use a shared key to communicate secretlycommunicate secretlyCriteriaCriteriaKey cannot be sent in clearAttacker can listen inKey can be sent enciphered, or derived from exchanged data plus data not known to an eavesdropperAlice, Bob may trust third partyAll cryptosystems, protocols publicly knownOnly secret data is the keys, ancillary information known only to Alice and Bob needed to derive keysAnything transmitted is assumed known to attackerIS2150/TEL2810: Introduction to Computer Security 7Classical Key ExchangeClassical Key ExchangeHow do Alice, Bob begin? How do Alice, Bob begin? Alice can’t send it to Bob in the clear!Assume trusted third party, CathyAssume trusted third party, CathyAlice and Cathy share secret key kABob and Cathy share secret key kBUse this to exchange shared key Use this to exchange shared key kkssIS2150/TEL2810: Introduction to Computer Security 8Simple Key Exchange ProtocolSimple Key Exchange ProtocolAliceCathy{ request for session key to Bob } kAAliceCathy{ ks }kA , { ks }kBAliceBob{ ks } kBAliceBob{m}ksEveIS2150/TEL2810: Introduction to Computer Security 9ProblemsProblemsHow does Bob know he is talking to Alice?How does Bob know he is talking to Alice?Replay attack: Eve records message from Alice to Bob, later replays it; Bob may think he’s talking to Alice, but he isn’tSession key reuse: Eve replays message from Alice to Bob, so Bob re-uses session keyProtocols must provide authentication and Protocols must provide authentication and defense against replaydefense against replayIS2150/TEL2810: Introduction to Computer Security 10Needham-SchroederNeedham-SchroederAlice CathyAlice || Bob || r1Alice Cathy{ Alice || Bob || r1 || ks , { Alice || ks } kB } kAAlice Bob{ Alice || ks } kBAlice Bob{ r2 } ksAlice Bob{ r2 – 1 } ksIS2150/TEL2810: Introduction to Computer Security 11Argument: Alice talking to BobArgument: Alice talking to BobSecond messageSecond messageEnciphered using key only she, Cathy knowSo Cathy enciphered itResponse to first messageAs r1 in it matches r1 in first messageThird messageThird messageAlice knows only Bob can read itAs only Bob can derive session key from messageAny messages enciphered with that key are from BobIS2150/TEL2810: Introduction to Computer Security 12Argument: Bob talking to AliceArgument: Bob talking to AliceThird messageThird messageEnciphered using key only he, Cathy knowSo Cathy enciphered itNames Alice, session keyCathy provided session key, says Alice is other partyFourth messageFourth messageUses session key to determine if it is replay from EveIf not, Alice will respond correctly in fifth messageIf so, Eve can’t decipher r2 and so can’t respond, or responds incorrectlyIS2150/TEL2810: Introduction to Computer Security 13Problem withProblem withNeedham-Schroeder Needham-Schroeder Assumption: all keys are secretAssumption: all keys are secretQuestion: suppose Eve can obtain session key. Question: suppose Eve can


View Full Document

Pitt IS 2150 - Key Management

Documents in this Course
QUIZ

QUIZ

8 pages

Assurance

Assurance

40 pages

Load more
Download Key Management
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Key Management and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Key Management 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?