SMUCSE 5349/73491 Authentication Protocols. SMUCSE 5349/73492 The Premise How do we use perfect cryptographic mechanisms (signatures, public-key and symmetric.

Slides:



Advertisements
Similar presentations
1 Kerberos Anita Jones November, Kerberos * : Objective Assumed environment Assumed environment –Open distributed environment –Wireless and Ethernetted.
Advertisements

AUTHENTICATION AND KEY DISTRIBUTION
Overview Network security involves protecting a host (or a group of hosts) connected to a network Many of the same problems as with stand-alone computer.
Supervisor :Dr. Lo'ai Ali Tawalbeh Done by: Wa’el Musa Hadi
Chapter 10 Real world security protocols
KERBEROS LtCdr Samit Mehra (05IT 6018).
Chapter 14 – Authentication Applications
SCSC 455 Computer Security
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.
Kerberos 1 Public domain image of Heracles and Cerberus. From an Attic bilingual amphora, 530–520 BC. From Italy (?).
CIS 725 Key Exchange Protocols. Alice ( PB Bob (M, PR Alice (hash(M))) PB Alice Confidentiality, Integrity and Authenication PR Bob M, hash(M) M, PR Alice.
1 Distributed Computer Security: Authentication and Key Distribution Vijay Jain CSc 8320, Spring 2007.
Computer Science&Technology School of Shandong University Instructor: Hou Mengbo houmb AT sdu.edu.cn Office: Information Security Research Group.
Cryptography and Network Security
Authentication and Digital Signatures CSCI 5857: Encoding and Encryption.
Chapter 14 From Cryptography and Network Security Fourth Edition written by William Stallings, and Lecture slides by Lawrie Brown, the Australian Defence.
Authentication & Kerberos
Cryptography and Network Security Chapter 13 Fourth Edition by William Stallings Lecture slides by Lawrie Brown.
Cryptography and Network Security Chapter 13 Fourth Edition by William Stallings.
1 Digital Signatures & Authentication Protocols. 2 Digital Signatures have looked at message authentication –but does not address issues of lack of trust.
1 Chapter 13 – Digital Signatures & Authentication Protocols Fourth Edition by William Stallings Lecture slides by Lawrie Brown (modified by Prof. M. Singhal,
Lecture 25 Secure Communications CPE 401 / 601 Computer Network Systems slides are modified from Jim Kurose & Keith Ross and Dave Hollinger.
CS555Spring 2012/Topic 161 Cryptography CS 555 Topic 16: Key Management and The Need for Public Key Cryptography.
Wireless Security In wireless networks. Security and Assurance - Goals Integrity Modified only in acceptable ways Modified only by authorized people Modified.
Lecture 22 Network Security CPE 401 / 601 Computer Network Systems slides are modified from Dave Hollinger.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Chapter 30 Message Security, User Authentication, and Key Management.
Cryptography and Network Security Chapter 11 Fourth Edition by William Stallings Lecture slides by Lawrie Brown/Mod. & S. Kondakci.
1 Authentication Protocols Celia Li Computer Science and Engineering York University.
Alexander Potapov.  Authentication definition  Protocol architectures  Cryptographic properties  Freshness  Types of attack on protocols  Two-way.
31.1 Chapter 31 Network Security Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Bob can sign a message using a digital signature generation algorithm
.Net Security and Performance -has security slowed down the application By Krishnan Ganesh Madras.
Part Two Network Security Applications Chapter 4 Key Distribution and User Authentication.
Information Security Principles Assistant Professor Dr. Sana’a Wafa Al-Sayegh 1 st Semester ITGD 2202 University of Palestine.
IT 221: Introduction to Information Security Principles Lecture 6:Digital Signatures and Authentication Protocols For Educational Purposes Only Revised:
Authentication Applications Unit 6. Kerberos In Greek and Roman mythology, is a multi-headed (usually three-headed) dog, or "hellhound” with a serpent's.
Chapter 3: Basic Protocols Dulal C. Kar. Key Exchange with Symmetric Cryptography Session key –A separate key for one particular communication session.
4 th lecture.  Message to be encrypted: HELLO  Key: XMCKL H E L L O message 7 (H) 4 (E) 11 (L) 11 (L) 14 (O) message + 23 (X) 12 (M) 2 (C) 10 (K) 11.
IS511 Introduction to Information Security Lecture 4 Cryptography 2
Chapter 21 Distributed System Security Copyright © 2008.
Network Security Lecture 23 Presented by: Dr. Munam Ali Shah.
Kerberos Named after a mythological three-headed dog that guards the underworld of Hades, Kerberos is a network authentication protocol that was designed.
Cryptography and Network Security Chapter 13 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.
Lecture 13 Page 1 Advanced Network Security Authentication and Authorization in Local Networks Advanced Network Security Peter Reiher August, 2014.
Cryptography and Network Security Chapter 13 Fourth Edition by William Stallings.
Fall 2010/Lecture 321 CS 426 (Fall 2010) Key Distribution & Agreement.
Advanced Database Course (ESED5204) Eng. Hanan Alyazji University of Palestine Software Engineering Department.
Lecture 16: Security CDK4: Chapter 7 CDK5: Chapter 11 TvS: Chapter 9.
Upper OSI Layers Natawut Nupairoj, Ph.D. Department of Computer Engineering Chulalongkorn University.
Digital Signatures, Message Digest and Authentication Week-9.
1 Needham-Schroeder A --> S: A,B, N A S --> A: {N A,B,K AB,{K AB,A} KBS } KAS A --> B:{K AB,A} KBS B --> A:{N B } KAB A --> B:{N B -1} KAB.
X.509 Topics PGP S/MIME Kerberos. Directory Authentication Framework X.509 is part of the ISO X.500 directory standard. used by S/MIME, SSL, IPSec, and.
Cryptography and Network Security Chapter 12 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.
Kerberos By Robert Smithers. History of Kerberos Kerberos was created at MIT, and was named after the 3 headed guard dog of Hades in Greek mythology Cerberus.
31.1 Chapter 31 Network Security Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Cryptography and Network Security Chapter 14 Fourth Edition by William Stallings Lecture slides by Lawrie Brown.
1 Kerberos – Private Key System Ahmad Ibrahim. History Cerberus, the hound of Hades, (Kerberos in Greek) Developed at MIT in the mid 1980s Available as.
1 Kerberos n Part of project Athena (MIT). n Trusted 3rd party authentication scheme. n Assumes that hosts are not trustworthy. n Requires that each client.
CPS Computer Security Tutorial on Creating Certificates SSH Kerberos CPS 290Page 1.
User Authentication  fundamental security building block basis of access control & user accountability  is the process of verifying an identity claimed.
KERBEROS SYSTEM Kumar Madugula.
9.2 SECURE CHANNELS JEJI RAMCHAND VEDULLAPALLI. Content Introduction Authentication Message Integrity and Confidentiality Secure Group Communications.
Pertemuan #8 Key Management Kuliah Pengaman Jaringan.
Dr. Nermi hamza.  A user may gain access to a particular workstation and pretend to be another user operating from that workstation.  A user may eavesdrop.
Fourth Edition by William Stallings Lecture slides by Lawrie Brown
Computer Communication & Networks
SSH: SECURE LOGIN CONNECTIONS OVER THE INTERNET
Kerberos Part of project Athena (MIT).
KERBEROS.
Presentation transcript:

SMUCSE 5349/73491 Authentication Protocols

SMUCSE 5349/73492 The Premise How do we use perfect cryptographic mechanisms (signatures, public-key and symmetric key encryption, hash functions, MACs) to design secure protocols (providing security services) over an un-trusted network?

SMUCSE 5349/73493 Types of Authentication Peer entity authentication –Prevent masquerading –Ensure freshness Data origin authentication –Claims of data origin –Prevention of forgery We are dealing with Entity Authentication

SMUCSE 5349/73494 Definitions Entity authentication: –Corroboration that an entity is the one claimed at a particular point in time. Unilateral authentication: –Provides one entity with assurance of the other’s identity but not vice versa. Mutual authentication: –Provides both entities with assurance of each other’s identity

SMUCSE 5349/73495 Simple Challenge-Response AP 1.A B:N a 2.B A:{ N a } kab nOne way protocol using shared secret key

SMUCSE 5349/73496 Mutual Authentication Using Needham-Schroeder (shared key) M1 A -> S A, B, N a M2 S -> A E Kas {N a, B, K ab, E Kbs {K ab, A} } M3 A -> B E Kbs {K ab, A} M4 B -> A E Kab {N b } M5 A-> B E Kab {N b -1} –N a is a random value chosen by A, N b random chosen by B

SMUCSE 5349/73497 NS – Public Key KDC has well known public key B’s public received from KDC Challenge – response as before –We saw this in last class

SMUCSE 5349/73498 Attacks on AP Crypto system –We have seen many of them Protocol –Replay –Oracle session –Parallel session

SMUCSE 5349/73499

SMUCSE 5349/734910

SMUCSE 5349/ Fix for Replay Attack Use time stamps –Needs securely synchronised clocks to prevent replay – not trivial –Drift window –Log of recent messages within the window –Logical time stamps?

SMUCSE 5349/ Digital Signature Algorithms

SMUCSE 5349/ Need for DS No complete trust between the sender and the receiver Properties: –Able to verify the author, time –Authenticate the content at time of signature –Signature verifiable by a third party Direct and arbitrated

SMUCSE 5349/ Use of RSA When using RSA for both encryption and authentication: –Use the senders private key to sign the message –Use the recipients public key to encrypt the message RSA can be used without increasing message size More commonly use a hash function to create a digest which is then signed –Send this signed digest separate

SMUCSE 5349/ DSA (Digital Signature Algorithm) US Federal Govt. approved signature scheme – used with SHA hash algorithm Designed by NIST & NSA in early 90's DSA is the algorithm, DSS is the standard DSA is a variant on the ElGamal and Schnorr algorithms –Creates a 320 bit signature –Security again rests on difficulty of computing discrete logarithms –Has been quite widely accepted

SMUCSE 5349/ Keyed Hash Functions All the above signature schemes involve public key methods –Cost and size overheads Have a need for a private key signature scheme –Use a fast hash function Include a key along with the message: –KeyedHash = Hash(Key|Message) –KeyedHash = Hash(Key1|Hash(Key2|Message))

SMUCSE 5349/ HMAC Use a keyed hash function HMAC K = Hash((K+ XOR opad)||Hash((K+ XOR ipad)||M)) –where K+ is the key padded out to size –opad, ipad are specified padding values Security is directly related to the security of the underlying hash Any of MD5, SHA-1, RIPEMD-160 hash algorithms can be used

SMUCSE 5349/ Kerberos

SMUCSE 5349/ Kerberos Trusted 3rd party authentication scheme. Assumes that hosts are not trustworthy. Requires that each client (each request for service) prove its identity. Does not require user to enter password every time a service is requested Part of project Athena (MIT)

SMUCSE 5349/ Kerberos Design User must identify itself once at the beginning of a session Every user has a password. Every service has a password. The only entity that knows all the passwords is the Authentication Server Passwords are never sent across the network in clear-text (or stored in memory)

SMUCSE 5349/ ServerServer ServerServer ServerServer ServerServer KerberosDatabase Ticket Granting Server Server Ticket Granting Server Server Authentication Authentication WorkstationWorkstation

SMUCSE 5349/ Components Encryption Current Kerberos implementations (v4) use DES, although Kerberos V5 has hooks so that other algorithms can be used Tickets Each request for a service requires a ticket. A ticket provides a single client with access to a single server Tickets are dispensed by the “Ticket Granting Server” (TGS), which has knowledge of all the encryption keys Tickets are meaningless to clients, they simply use them to gain access to servers.

SMUCSE 5349/ Components - Tickets (cont’d) The TGS seals (encrypts) each ticket with the secret encryption key of the server. Sealed tickets can be sent safely over a network - only the server can make sense out of it. Each ticket has a limited lifetime (a few hours) Ticket Contents Client name (user login name) Server name Client Host network address Session Key for Client/Server Ticket lifetime Creation of timestamp

SMUCSE 5349/ Components - Session Key Random number that is specific to a session. Session Key is used to seal client requests to server Session Key can be used to seal responses (application specific usage)

SMUCSE 5349/ Authenticators Authenticators prove a client’s identity. Includes: –Client user name. –Client network address. –Timestamp. Authenticators are sealed with a session key.

SMUCSE 5349/ Bootstrap Each time a client wants to contact a server, it must first ask the 3rd party (TGS) for a ticket and session key. In order to request a ticket from the TGS, the client must already have a TG ticket and a session key for communicating with the TGS

SMUCSE 5349/ Authentication Server The client sends a plaintext request to the AS asking for a ticket it can use to talk to the TGS. Request: –login name –TGS name Since this request contains only well-known names, it does not need to be sealed.

SMUCSE 5349/ Authentication Server The AS finds the keys corresponding to the login name and the TGS name. The AS creates a ticket: –login name –TGS name –client network address –TGS session key The AS seals the ticket with the TGS secret key.

SMUCSE 5349/ Authentication Server Response The AS also creates a random session key for the client and the TGS to use. The session key and the sealed ticket are sealed with the user (login name) secret key. TGS session key Ticket: login name TGS name net address TGS session key Sealed with user key Sealed with TGS key

SMUCSE 5349/ Accessing the TGS The client decrypts the message using the user’s password as the secret key. The client now has a session key and ticket that can be used to contact the TGS. The client cannot see inside the ticket, since the client does not know the TGS secret key.

SMUCSE 5349/ When a client wants to start using a server (service), the client must first obtain a ticket. The client composes a request to send to the TGS: Accessing a Server TGS Ticket Authenticator Server Name sealed with TGS key sealed with session key

SMUCSE 5349/ TGS response The TGS decrypts the ticket using its secret key. Inside is the TGS session key. The TGS decrypts the Authenticator using the session key. The TGS check to make sure login names, client addresses and TGS server name are all OK. TGS makes sure the Authenticator is recent.

SMUCSE 5349/ TGS Response Once everything checks out - the TGS: Builds a ticket for the client and requested server. The ticket is sealed with the server key. Creates a session key Seals the entire message with the TGS session key and sends it to the client.

SMUCSE 5349/ Client Accesses Server The client now decrypts the TGS response using the TGS session key. The client now has a session key for use with the new server, and a ticket to use with that server. The client can contact the new server using the same format used to access the TGS.

SMUCSE 5349/ Requirements Secure Reliable Transparent Scalable

SMUCSE 5349/ Problems Single point of failure –Denial-of-service attack Traffic Reliability will compromise security