Kemal AkkayaWireless & Network Security 1 Department of Computer Science Southern Illinois University Carbondale CS 591 – Wireless & Network Security Lecture.

Slides:



Advertisements
Similar presentations
1 Key Exchange Solutions Diffie-Hellman Protocol Needham Schroeder Protocol X.509 Certification.
Advertisements

Key Management. Shared Key Exchange Problem How do Alice and Bob exchange a shared secret? Offline – Doesnt scale Using public key cryptography (possible)
Key distribution and certification In the case of public key encryption model the authenticity of the public key of each partner in the communication must.
DIGITAL SIGNATURES and AUTHENTICATION PROTOCOLS - Chapter 13
DIGITAL SIGNATURES and AUTHENTICATION PROTOCOLS - Chapter 13 DIGITAL SIGNATURES and AUTHENTICATION PROTOCOLS - Chapter 13 Digital Signatures Authentication.
ECE454/CS594 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2011.
CS470, A.SelcukNeedham-Schroeder1 Needham-Schroeder Protocol Authentication & Key Establishment CS 470 Introduction to Applied Cryptography Instructor:
Chapter 14 From Cryptography and Network Security Fourth Edition written by William Stallings, and Lecture slides by Lawrie Brown, the Australian Defence.
CS470, A.SelcukReal-Time Communication Issues1 Real-Time Communication Security IPsec & SSL Issues CS 470 Introduction to Applied Cryptography Instructor:
CSCI283 Fall 2005 GWU All slides from Bishop’s slide set Public Key Infrastructure (PKI)
 Authorization via symmetric crypto  Key exchange o Using asymmetric crypto o Using symmetric crypto with KDC  KDC shares a key with every participant.
1 Authentication Applications Digital Signatures Security Concerns X.509 Authentication Service Kerberos Based on slides by Dr. Lawrie Brown of the Australian.
CS555Spring 2012/Topic 161 Cryptography CS 555 Topic 16: Key Management and The Need for Public Key Cryptography.
1 Key Establishment Symmetric key problem: How do two entities establish shared secret key in the first place? Solutions: Deffie-Hellman trusted key distribution.
Mar 4, 2003Mårten Trolin1 This lecture Diffie-Hellman key agreement Authentication Certificates Certificate Authorities.
8-1 What is network security? Confidentiality: only sender, intended receiver should “understand” message contents m sender encrypts message m receiver.
Chapter 9: Key Management
EEC 693/793 Special Topics in Electrical Engineering Secure and Dependable Computing Lecture 7 Wenbing Zhao Department of Electrical and Computer Engineering.
CMSC 414 Computer and Network Security Lecture 22 Jonathan Katz.
Kemal AkkayaWireless & Network Security 1 Department of Computer Science Southern Illinois University Carbondale CS 591 – Wireless & Network Security Lecture.
More on AuthenticationCS-4513 D-term More on Authentication CS-4513 Distributed Computing Systems (Slides include materials from Operating System.
EEC 688/788 Secure and Dependable Computing Lecture 7 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University
1 Key Establishment Symmetric key problem: How do two entities establish shared secret key over network? Solution: trusted key distribution center (KDC)
Public Key Distribution and X.509 Wade Trappe. Distribution of Public Keys There are several techniques proposed for the distribution of public keys:
CMSC 414 Computer and Network Security Lecture 23 Jonathan Katz.
Key Distribution CS 470 Introduction to Applied Cryptography
Cryptography and Network Security Chapter 10. Chapter 10 – Key Management; Other Public Key Cryptosystems No Singhalese, whether man or woman, would venture.
Security Management.
1 CS 194: Distributed Systems Security Scott Shenker and Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences.
Diffie-Hellman Key Exchange
Key Management in Cryptography
Alexander Potapov.  Authentication definition  Protocol architectures  Cryptographic properties  Freshness  Types of attack on protocols  Two-way.
Computer Science Public Key Management Lecture 5.
CMSC 414 Computer and Network Security Lecture 14 Jonathan Katz.
ECE453 – Introduction to Computer Networks Lecture 18 – Network Security (I)
1 Lecture 14: Real-Time Communication Security real-time communication – two parties interact in real time (as opposed to delayed communication like )
ECE 454/CS 594 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall.
Lecture 14 ISAKMP / IKE Internet Security Association and Key Management Protocol / Internet Key Exchange CIS CIS 5357 Network Security.
Overview of Key Establishment Techniques: Key Distribution, Key Agreement and PKI Wade Trappe.
1 Chapter 9: Key Management All algorithms we have introduced are based on one assumption: keys have been distributed. But how to do that? Key generation,
10. Key Management. Contents Key Management  Public-key distribution  Secret-key distribution via public-key cryptography.
Introduction1-1 Data Communications and Computer Networks Chapter 6 CS 3830 Lecture 31 Omar Meqdadi Department of Computer Science and Software Engineering.
Cryptography and Network Security (CS435) Part Eight (Key Management)
Fall 2010/Lecture 321 CS 426 (Fall 2010) Key Distribution & Agreement.
PUBLIC-KEY CRYPTOGRAPH IT 352 : Lecture 2- part3 Najwa AlGhamdi, MSc – 2012 /1433.
Chapter 3 (B) – Key Management; Other Public Key Cryptosystems.
Lecture 16: Security CDK4: Chapter 7 CDK5: Chapter 11 TvS: Chapter 9.
Digital Signatures, Message Digest and Authentication Week-9.
1 Network Security Lecture 7 Overview of Authentication Systems Waleed Ejaz
1 Chapter 10: Key Management in Public key cryptosystems Fourth Edition by William Stallings Lecture slides by Lawrie Brown (Modified by Prof. M. Singhal,
Fall, Privacy&Security - Virginia Tech – Computer Science Click to edit Master title style Cryptographic Security Identity-Based Encryption.
Network Security Continued. Digital Signature You want to sign a document. Three conditions. – 1. The receiver can verify the identity of the sender.
Computer and Network Security - Message Digests, Kerberos, PKI –
COMP 424 Computer Security Lecture 09 & 10. Protocol ● An orderly sequence of steps agreed upon by two or more parties in order to accomplish a task ●
CS 4803 Fall 04 Public Key Algorithms. Modular Arithmetic n Public key algorithms are based on modular arithmetic. n Modular addition. n Modular multiplication.
Protocol Analysis. CSCE Farkas 2 Cryptographic Protocols Two or more parties Communication over insecure network Cryptography used to achieve goal.
Key Management Network Systems Security Mort Anvari.
Lecture 11 Overview. Digital Signature Properties CS 450/650 Lecture 11: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.
Lecture 9 Overview. Digital Signature Properties CS 450/650 Lecture 9: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.
Cryptography and Network Security Chapter 10 Fourth Edition by William Stallings Lecture slides by Lawrie Brown.
1 Secure Key Exchange: Diffie-Hellman Exchange Dr. Rocky K. C. Chang 19 February, 2002.
Fall 2006CS 395: Computer Security1 Key Management.
1 Chapter 3-3 Key Distribution. 2 Key Management public-key encryption helps address key distribution problems have two aspects of this: –distribution.
Diffie-Hellman Key Exchange first public-key type scheme proposed by Diffie & Hellman in 1976 along with the exposition of public key concepts – note:
Key Management and Distribution Anand Seetharam CST 312.
Lesson Introduction ●Authentication protocols ●Key exchange protocols ●Kerberos Security Protocols.
@Yuan Xue CS 285 Network Security Key Distribution and Management Yuan Xue Fall 2012.
Pertemuan #8 Key Management Kuliah Pengaman Jaringan.
Prof. Reuven Aviv, Nov 2013 Public Key Infrastructure1 Prof. Reuven Aviv Tel Hai Academic College Department of Computer Science Public Key Infrastructure.
CS480 Cryptography and Information Security
Presentation transcript:

Kemal AkkayaWireless & Network Security 1 Department of Computer Science Southern Illinois University Carbondale CS 591 – Wireless & Network Security Lecture 12: Key Management in Wired Networks Dr. Kemal Akkaya

Kemal AkkayaWireless & Network Security 2 Key Management  Key management is the set of techniques and procedures supporting the establishment and maintenance of keying relationships between authorized parties.  Key management encompasses techniques and procedures supporting:  initialization of systems users within a domain;  generation, distribution, and installation of keying material;  controlling the use of keying material;  update, revocation, and destruction of keying material;  storage, backup/recovery, and archival of keying material.

Kemal AkkayaWireless & Network Security 3 Key Distribution/Establishment  How to have two parties agree on an encryption key securely? 1.A can select key and physically deliver to B 2.third party can select & deliver key to A & B 3.if A & B have communicated previously can use previous key to encrypt a new key 4.if A & B have secure communications with a third party C, C can relay key between A & B  Public key encryption: Solves the problem against passive attackers. e.g. DH Key Exchange: Trudy can’t get g ab mod p. BobAlice g a mod p g b mod p K = g ab mod p

Kemal AkkayaWireless & Network Security 4 Active Attacks  Attacker can intercept, modify, insert, delete messages on the network.  E.g., Man-in-the-Middle attack against DH: Trudy can translate messages between Alice & Bob without being noticed  Similar attacks possible on RSA & other PKC protocols. BobAlice g a mod p g b’ mod p K’ = g ab’ mod p g a mod p g b’ mod p Trudy K’’ = g a’b mod p

Kemal AkkayaWireless & Network Security 5 Trusted Third Parties  Solution against active attackers: “Trusted Third Parties” (TTPs)  Symmetric key solution: KDC  Everyone registers with the KDC, shares a secret key.  When A & B want to communicate, they contact the KDC & obtain a session key.  Public key solution: CA  Everyone registers with the CA, obtains a “certificate” for his/her public key.  Certificate: A document signed by the CA, including the ID and the public key of the subject.  People obtain each other’s certificates thru a repository, a webpage, or at the beginning of the protocol,  and use the certified public keys in the protocols.

Kemal AkkayaWireless & Network Security 6 KDC vs. CA  KDC  faster (being based on symmetric keys)  has to be online  Preferred for LANs  CA  doesn’t have to be online  if crashes, doesn’t disable the network  much simpler  scales better  certificates are not disclosure-sensitive  a compromised CA can’t decrypt conversations  Preferred for WANs (e.g., the Internet).

Kemal AkkayaWireless & Network Security 7 Key Distribution with KDC  A simple protocol:  K A, K B : Long-term secret keys of Alice, Bob. K A {m}: Encryption of m with K A.  Problems with this protocol:  possible delayed delivery of K B {A,B,K AB }.  No freshness guarantee for B (i.e., Trudy can replay K B {A,B,K AB } for a previously compromised K AB ). BA A, B K A {A,B,K AB } KDC K B {A,B,K AB } K AB

Kemal AkkayaWireless & Network Security 8 Key Distribution with CA  A simple protocol:  certificates are obtained in advance  session key transport with public key encryption:  {m} X : Encryption of message m with the public key of X  [m] X : Signature on message m with the public key of X  Problems with this protocol:  B doesn’t authenticate A  No freshness guarantee for B BA { [ A, B, r, K AB ] A } B K AB {r}

Kemal AkkayaWireless & Network Security 9 “Station-to-Station” Protocol  Authenticated DH protocol; basis for many real-life app’s.  Certified PKs are used for signing the public DH parameters. A slightly simplified version: where x = g a mod p, y = g b mod p, k = g ab mod p.  STS vs. encrypted key transport: STS (DH) provides “perfect forward secrecy”. (In encrypted transport, if the long-term RSA key is compromised, the session keys are also compromised.) BobAlice x cert(B), y, [x,y] B cert(A), [x,y] A

Kemal AkkayaWireless & Network Security 10 Multiple Domains with KDC A to talk to B:  contacts KDC A  KDC A contacts KDC B, or tells A how to contact KDC B (e.g. generates a session key for A & KDC B )  KDC B generates a session key for A & B, passes it to them. B A KDC A KDC B

Kemal AkkayaWireless & Network Security 11 Multiple Domains with CA  A, to authenticate the public key of B,  verifies B’s cert. issued by CA B,  verifies CA B ’s cert. issued by CA A,  B does vice versa to authenticate A’s key B A CA A CA B certify each other