CMSC 414 Computer (and Network) Security Lecture 24 Jonathan Katz.

Slides:



Advertisements
Similar presentations
CMSC 414 Computer (and Network) Security Lecture 22 Jonathan Katz.
Advertisements

Lecture 10: Mediated Authentication
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.
CSC 474 Information Systems Security
ECE454/CS594 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2011.
CS470, A.SelcukCryptographic Authentication1 Cryptographic Authentication Protocols CS 470 Introduction to Applied Cryptography Instructor: Ali Aydin Selcuk.
1 Security Handshake Pitfalls. 2 Authentication Handshakes Secure communication almost always includes an initial authentication handshake: –Authenticate.
CMSC 414 Computer and Network Security Lecture 26 Jonathan Katz.
COEN 350: Network Security Authentication. Between human and machine Between machine and machine.
CMSC 414 Computer and Network Security Lecture 12 Jonathan Katz.
CS426Fall 2010/Lecture 81 Computer Security CS 426 Lecture 8 User Authentication.
CMSC 414 Computer (and Network) Security Lecture 26 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 6 Jonathan Katz.
CMSC 414 Computer (and Network) Security Lecture 21 Jonathan Katz.
CMSC 414 Computer (and Network) Security Lecture 2 Jonathan Katz.
第十章 1 Chapter 10 Authentication of People. 第十章 2 Introduction This chapter deals with password-related issues like how to force users to choose unguessable.
CMSC 414 Computer and Network Security Lecture 15 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 19 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 21 Jonathan Katz.
Apr 22, 2003Mårten Trolin1 Agenda Course high-lights – Symmetric and asymmetric cryptography – Digital signatures and MACs – Certificates – Protocols Interactive.
CMSC 414 Computer and Network Security Lecture 5 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 17 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 16 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 16 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 14 Jonathan Katz.
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.
CS470, A.SelcukAuthentication Systems1 CS 470 Introduction to Applied Cryptography Instructor: Ali Aydin Selcuk.
CMSC 414 Computer and Network Security Lecture 24 Jonathan Katz.
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
CMSC 414 Computer and Network Security Lecture 18 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 6 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 26 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 23 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 17 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 14 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 22 Jonathan Katz.
Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE CSci530: Computer Security Systems Authentication.
CMSC 414 Computer and Network Security Lecture 11 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 13 Jonathan Katz.
Alexander Potapov.  Authentication definition  Protocol architectures  Cryptographic properties  Freshness  Types of attack on protocols  Two-way.
CMSC 414 Computer and Network Security Lecture 3 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 14 Jonathan Katz.
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 11: Strong Passwords
CMSC 414 Computer and Network Security Lecture 5 Jonathan Katz.
1 Lecture 9: Cryptographic Authentication objectives and classification one-way –secret key –public key mutual –secret key –public key establishing session.
COEN 350: Network Security Authentication. Between human and machine Between machine and machine.
14.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 14 Entity Authentication.
CMSC 414 Computer and Network Security Lecture 20 Jonathan Katz.
Lecture 6.1: Protocols - Authentication and Key Exchange I CS 436/636/736 Spring 2012 Nitesh Saxena.
COEN 350: Network Security Authentication. Between human and machine Between machine and machine.
Identification Authentication. 2 Authentication Allows an entity (a user or a system) to prove its identity to another entity Typically, the entity whose.
The School of Electrical Engineering and Computer Science (EECS) CS/ECE Network Security Dr. Attila Altay Yavuz Authentication Protocols (I): Secure Handshake.
COEN 351 Authentication. Authentication is based on What you know Passwords, Pins, Answers to questions, … What you have (Physical) keys, tokens, smart-card.
Identify Friend or Foe (IFF) Chapter 9 Simple Authentication protocols Namibia Angola 1. N 2. E(N,K) SAAF Impala Russian MIG 1 Military needs many specialized.
1 Authenticated Key Exchange Rocky K. C. Chang 20 March 2007.
Chapter 9 Simple Authentication Protocols Simple Security Protocol Authentication Protocols Authentication and TCP Chapter 9 Simple Authentication protocols.
Lesson Introduction ●Authentication protocols ●Key exchange protocols ●Kerberos Security Protocols.
Chapter eight: Authentication Protocols 2013 Term 2.
Security Handshake Pitfalls. Client Server Hello (K)
Web Applications Security Cryptography 1
Outline The basic authentication problem
CMSC 414 Computer and Network Security Lecture 15
پروتكلهاي احرازاصالت Authentication protocols
Lecture 6.1: Protocols - Authentication and Key Exchange I
AIT 682: Network and Systems Security
Presentation transcript:

CMSC 414 Computer (and Network) Security Lecture 24 Jonathan Katz

Administrative stuff…  Please fill out course evaluation –On line –Link from course homepage  Brief remarks on project…

Otway-Rees  A  B: N C, K A (N A, N C, Alice, Bob)  B  KDC: K A (…), K B (N B, N C, Alice, Bob) –KDC checks that N C is the same…  KDC  B: N C, K A (N A, K AB ), K B (N B, K AB )  B  A: K A (…)  A  B: K AB (timestamp) –Note: KDC already authenticated Bob

Analysis?  N C should be unpredictable, not just a nonce –Otherwise, can impersonate B to KDC Send first message: (next N C ), “garbage” B forwards to KDC along with encryption of the next N C Next time A initiates a conversation, replay previous message from B

More about nonces…  Important to understand what qualities the nonce needs to satisfy in order for protocol to be secure –Used once? Unpredictable? Random? –Note that long random nonces have negligible probability of being re-used  E.g., challenge-response or reverse challenge-response

A word about “random”  Random numbers needed for all of cryptography –Difficult to generate “good” random numbers  Possibilities: –“Real” (i.e., hardware) RNG –Cryptographic/non-cryptographic PRNG Must use long (random, unpredictable) seed!! –Generate from user behavior

Authentication tokens  Authentication may be based on: –What you know (e.g., passwords) –What you have (e.g., token) –What you are (e.g., biometrics)  Best security practice is to combine two (or more) of these…  Using tokens/biometrics alone is useless without a secure protocol!

Authentication tokens  Advantages –Difficult to reproduce –Can “store” larger secrets –Psychological barrier to giving out your token  Disadvantages –Can be stolen Combine with PIN/password –Can be lost –Expensive; may require custom hardware

Authentication tokens  Magnetic stripe card –Simply records data and later reveals it –Non-trivial, but not too difficult, to copy  “Smart card” –Embedded CPU/memory –Carries out an interactive protocol

Smart cards  PIN protected memory card –Information on card can be read only with correct PIN –After many wrong guesses, card “locks” itself  “Crypto” card –Card stores key used to perform cryptographic operations (perhaps only with correct PIN) –Tamper resistant --- impossible to obtain key or duplicate card

Smart cards  Readerless smart card –Card interacts directly with the user via keyboard and/or monitor interface –E.g., secureID –Does not require special hardware

Biometrics (briefly)  “What you are…”  Many possibilities: –Fingerprints/handprints –Retinal scans –Etc.

Notes about biometrics  Insecure if biometric data sent in the clear! –Need to use cryptographically-secure protocol –Not clear how to use biometric data as a cryptographic key Data changes slightly every time it is scanned Data is not random, although it has high entropy

Note about biometrics  Biometric data can be forged! –E.g., fingerprints…

Review: checklist  Whether eavesdropping, posing as either party, or acting as a “man-in-the-middle”, an attacker should be unable to: –Learn the contents of messages –Insert messages –“Hijack” a conversation between two parties –Impersonate either party, or learn information allowing impersonation in the future –Perform an off-line dictionary attack (ideally)

Continued…  In addition, when posing as either party an attacker should be unable to: –Trick the other party into “doing something useful” (e.g., signing an arbitrary message)

Continued…  If the server’s database is compromised (and even if further eavesdropping occurs), an attacker should be unable to: –Impersonate the user to this server (ideally; not always the case --- recall that an off-line dictionary attack is always possible) –Impersonate the user to other servers –Decrypt old conversations (forward secrecy)

Final remark  It is not always necessary to achieve all these goals –If shared secret is cryptographically strong, off- line password guessing is not a concern –In some environments, certain attacks may be less feasible and therefore not a concern

An overview of network security

Network layers  Application  Transport  Network  Data link  Physical

Examples  Application layer: PGP, SSH  Transport layer: SSL/TLS  Network layer: IPSec  Not usually done at the data link level…  Can’t really be done at the physical level

Security in what layer?  Depends on the purpose… –What information needs to be protected? –What is the attack model? –Who shares keys in advance? –Should the user be involved?  E.g., a network-layer protocol cannot authenticate two end-users to each other  Also affects efficiency, ease of deployment