Digital Signatures, Message Digest and Authentication Week-9.

Slides:



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

Last Class: The Problem BobAlice Eve Private Message Eavesdropping.
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.
CS470, A.SelcukCryptographic Authentication1 Cryptographic Authentication Protocols CS 470 Introduction to Applied Cryptography Instructor: Ali Aydin Selcuk.
Internet and Intranet Protocols and Applications Lecture 9a: Secure Sockets Layer (SSL) March, 2004 Arthur Goldberg Computer Science Department New York.
Digital Signatures Good properties of hand-written signatures: 1. Signature is authentic. 2. Signature is unforgeable. 3. Signature is not reusable (it.
Netprog: Cryptgraphy1 Cryptography Reference: Network Security PRIVATE Communication in a PUBLIC World. by Kaufman, Perlman & Speciner.
 Public key (asymmetric) cryptography o Modular exponentiation for encryption/decryption  Efficient algorithms for this o Attacker needs to factor large.
EEC 693/793 Special Topics in Electrical Engineering Secure and Dependable Computing Lecture 6 Wenbing Zhao Department of Electrical and Computer Engineering.
BY MUKTADIUR RAHMAN MAY 06, 2010 INTERODUCTION TO CRYPTOGRAPHY.
8-1 What is network security? Confidentiality: only sender, intended receiver should “understand” message contents m sender encrypts message m receiver.
Encryption An Overview. Fundamental problems Internet traffic goes through many networks and routers Many of those networks are broadcast media Sniffing.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Chapter 30 Message Security, User Authentication, and Key Management.
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.
Introduction to Public Key Infrastructure (PKI) Office of Information Security The University of Texas at Brownsville & Texas Southmost College.
Network Security – Part 2 V.T. Raja, Ph.D., Oregon State University.
1 CS 194: Distributed Systems Security Scott Shenker and Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences.
Overview of Digital Signatures Introduction To Networks and Communications (CS 555) Presented by Bharath Kongara.
Alexander Potapov.  Authentication definition  Protocol architectures  Cryptographic properties  Freshness  Types of attack on protocols  Two-way.
Chapter 31 Network Security
Csci5233 Computer Security1 Bishop: Chapter 10 Key Management: Digital Signature.
31.1 Chapter 31 Network Security Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
CS5204 – Fall Cryptographic Security Presenter: Hamid Al-Hamadi October 13, 2009.
Page 1 Secure Communication Paul Krzyzanowski Distributed Systems Except as otherwise noted, the content of this presentation.
1 Cryptography Basics. 2 Cryptography Basic terminologies Symmetric key encryption Asymmetric key encryption Public Key Infrastructure Digital Certificates.
Pretty Good Privacy by Philip Zimmerman presented by: Chris Ward.
Computer Security Tran, Van Hoai Department of Systems & Networking Faculty of Computer Science & Engineering HCMC University of Technology.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Network Security (A Very Brief Introduction)
8-1Network Security Chapter 8 roadmap 8.1 What is network security? 8.2 Principles of cryptography 8.3 Message integrity, authentication.
Network Security – Part 2 (Continued) Lecture Notes for May 8, 2006 V.T. Raja, Ph.D., Oregon State University.
IT 221: Introduction to Information Security Principles Lecture 6:Digital Signatures and Authentication Protocols For Educational Purposes Only Revised:
_______________________________________________________________________________________________________________ E-Commerce: Fundamentals and Applications1.
Symmetric versus Asymmetric Cryptography. Why is it worth presenting cryptography? Top concern in security Fundamental knowledge in computer security.
Cryptography, Authentication and Digital Signatures
Authentication: keys, MAC, hashes, message digests, digital signatures.
©The McGraw-Hill Companies, Inc., 2000© Adapted for use at JMU by Mohamed Aboutabl, 2003Mohamed Aboutabl1 1 Chapter 29 Internet Security.
CSCD 218 : DATA COMMUNICATIONS AND NETWORKING 1
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,
EE515/IS523 Think Like an Adversary Lecture 4 Crypto in a Nutshell Yongdae Kim.
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.
Introduction1-1 Data Communications and Computer Networks Chapter 6 CS 3830 Lecture 31 Omar Meqdadi Department of Computer Science and Software Engineering.
23-1 Last time □ P2P □ Security ♦ Intro ♦ Principles of cryptography.
Chapter 16 Security Introduction to CS 1 st Semester, 2012 Sanghyun Park.
Network Security7-1 CIS3360: Chapter 8: Cryptography Application of Public Cryptography Cliff Zou Spring 2012 TexPoint fonts used in EMF. Read the TexPoint.
Internet-security.ppt-1 ( ) 2000 © Maximilian Riegel Maximilian Riegel Kommunikationsnetz Franken e.V. Internet Security Putting together the.
1 Cryptography NOTES. 2 Secret Key Cryptography Single key used to encrypt and decrypt. Key must be known by both parties. Assuming we live in a hostile.
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.
8-1 Chapter 8 Security Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 part 2: Message integrity.
31.1 Chapter 31 Network Security Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Cryptography: Digital Signatures Message Digests Authentication
1 Normal executable Infected executable Sequence of program instructions Entry Original program Entry Jump Replication and payload Viruses.
Authentication Issues and Solutions CSCI 5857: Encoding and Encryption.
31.1 Chapter 31 Network Security Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Network Security Continued. Digital Signature You want to sign a document. Three conditions. – 1. The receiver can verify the identity of the sender.
Group 9 Chapter 8.3 – 8.6. Public Key Algorithms  Symmetric Key Algorithms face an inherent problem  Keys must be distributed to all parties but kept.
1 Cryptography Troy Latchman Byungchil Kim. 2 Fundamentals We know that the medium we use to transmit data is insecure, e.g. can be sniffed. We know that.
EE 122: Lecture 24 (Security) Ion Stoica December 4, 2001.
Cryptographic Security Aveek Chakraborty CS5204 – Operating Systems1.
Security. Security Needs Computers and data are used by the authorized persons Computers and their accessories, data, and information are available to.
Computer Communication & Networks
Cryptography Reference: Network Security
Cryptography Reference: Network Security
Basic Network Encryption
NET 311 Information Security
Cryptography Reference: Network Security
Basic Network Encryption
Presentation transcript:

Digital Signatures, Message Digest and Authentication Week-9

Digital Signatures Non-repudiation (non-denial) How do you legally prove who actually send you the message? Receiver can verify the claimed identity of sender Sender cannot later repudiate contents of the message Receiver cannot possibly have concocted message by himself/herself

Digital Signatures Purpose Authenticity of legal / financial documents is determined by authorised handwritten signatures Photocopies may be forged and don’t count! Growing need for computing systems to replace physical transport of paper documents The problem is devising a method of “digital signatures” to be used as legal signatures

Digital Signatures Symmetric Scheme Trusted Central Authority (CA) is needed CA shares secret key K with sender (Alice) and receiver (Bob): K A and K b Alice (A)sends message (M)encrypted with her key (K A ) to her banker Bob (B) via CA A, K A (B, R A, t, M) A = Alice’s identity B = Bob’s identity R A = Random number chosen by Alice t = timestamp to ensure freshness K A = message is encrypted using the secret key Alice shares with CA

Digital Signatures CA sees message is from Alice and decrypts it using Alice’s secret key, K A CA then uses Bob’s secret, K B, to encrypt an extended message containing: Alice’s original plaintext message to Bob the “signed message” encrypted with CA’s secret key, K CA (A, t, M) Extended message is then sent to Bob K B (A, R A, t, M, K CA (A, t, M))

Digital Signatures Verification: A case in Court Alice later denies sending message to Bob Bob tells judge that CA will only accept message form Alice if encrypted with her key, K A Bob produces Exhibit 1:K CA (A, t, M) Judge asks trustworthy CA to decrypt Exhibit 1 who also testifies that Bob is telling the truth Judge rules in favour of Bob, case dismissed!

Digital Signatures Problems Replay attacks: Suppose in the communication of two parties A and B; A is sharing his key to B to prove his identity but in the meanwhile Attacker C eavesdrop the conversation between them and keeps the information which are needed to prove his identity to B. Later C contacts to B and prove its authenticity.

Digital Signatures Solutions Solutions: Timestamp and Random Number Using timestamps throughout minimises the problem Based on timestamps old messages are rejected To guard against instant replay attacks Bob checks R A of every incoming message R A (Random number in Alice’s message) is checked to see if any other incoming message contains the same R A. If not then the assumption is that this is new message / request.

Message Digest (MD) Integrity One –way Hash function Digital signatures couple together two distinct functions (criticism): “authentication” (i.e. verification) & secrecy “Authentication” is often needed but secrecy is not Message digests provide a more efficient approach to digital signatures

Message Digest (MD) Comparing Digital Signature and Message Digests A message digest is a fixed size numeric representation of the contents of a message, computed by a hash function. The sender can also generate a message digest and then encrypt the digest using the private key of an asymmetric key pair, forming a digital signature. The signature must then be decrypted by the receiver, before comparing it with a locally generated digest.

Digital Signatures Verification: A case in Court

Message Digest (MD) Applications Message Digest 5 (MD5) / & MD6 are prominent by Ronald Rivest Secure Hash Algorithm (SHA-1) + newer versions of SHA-1 Others (Investigate)

Authentication Authentication Vs Digital Signatures Digital Signatures guarantee non-repudiation at some point in the future Authentication – verifying someone’s identity during communication Authentication – how do you know it’s Alice and not Trudy (imposter) you are ‘talking’ to?

Authentication Authentication Vs Authorisation Authorisation – what a process is permitted to do Server: Is Bob’s process allowed to delete a file ? Authentication – are you actually communicating with the process you think you are? Server: Needs to determine if this is Bob’s process

Authentication Based on shared secret key (symmetric) Commonly known as challenge-response protocols Alice and Bob share secret key, K AB Alice or Bob sends a random number to the other Alice or Bob transforms it in some way and returns the result back to the other

Two way Authentication: challenge –response Alice A K AB (R B ) Bob RARA K AB (R A ) RBRB

Two way Authentication: challenge –response - Alice sends her identity to Bob - Bob chooses a challenge to be sure this came from Alice and not Trudy - The challenge Bob sends is a large random number R B as plaintext to Alice - Alice encrypts message using shared secret key and sends ciphertext K AB (R B ) to Bob - Bob decrypts ciphertext and checks R B

Two way Authentication: challenge –response - Bob is now sure he is talking to Alice and not Trudy (Trudy does not know K AB ) - But Alice does not know she is talking to Bob (Trudy could have sent plaintext R B to Alice!) - Therefore, Alice sends Bob her own R A and when Bob returns K AB (R A ), Alice knows it’s from him - To establish a session key (optional), Alice picks a session key K S and sends Bob K AB (K S )

Thank You !