DIGITAL SIGNATURES Fred Piper & Mert Özarar Codes & Ciphers Ltd 12 Duncan Road Richmond Surrey TW9 2JD Information Security Group Royal Holloway, University.

Slides:



Advertisements
Similar presentations
Chapter 3 Public Key Cryptography and Message authentication.
Advertisements

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.
Topic 7: Using cryptography in mobile computing. Cryptography basics: symmetric, public-key, hash function and digital signature Cryptography, describing.
Computer Science CSC 474By Dr. Peng Ning1 CSC 474 Information Systems Security Topic 2.1 Introduction to Cryptography.
Digital Signatures and Hash Functions. Digital Signatures.
Digital Signatures and applications Math 7290CryptographySu07.
6/1/20151 Digital Signature and Public Key Infrastructure Course:COSC Instructor:Professor Anvari Student ID: Name:Xin Wen Date:11/25/00.
DIGITAL SIGNATURES Fred Piper Codes & Ciphers Ltd 12 Duncan Road
Session 5 Hash functions and digital signatures. Contents Hash functions – Definition – Requirements – Construction – Security – Applications 2/44.
Public Key Algorithms …….. RAIT M. Chatterjee.
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.
November 1, 2006Sarah Wahl / Graduate Student UCCS1 Public Key Infrastructure By Sarah Wahl.
ECOMMERCE TECHNOLOGY FALL 2003 COPYRIGHT © 2003 MICHAEL I. SHAMOS Cryptography.
Cryptography1 CPSC 3730 Cryptography Chapter 10 Key Management.
Cryptographic Technologies
Presented by Xiaoping Yu Cryptography and PKI Cosc 513 Operating System Presentation Presented to Dr. Mort Anvari.
ITIS 3200: Introduction to Information Security and Privacy Dr. Weichao Wang.
How cryptography is used to secure web services Josh Benaloh Cryptographer Microsoft Research.
Chapter3 Public-Key Cryptography and Message Authentication.
Fall 2010/Lecture 311 CS 426 (Fall 2010) Public Key Encryption and Digital Signatures.
Network Security – Part 2 V.T. Raja, Ph.D., Oregon State University.
Cryptography1 CPSC 3730 Cryptography Chapter 11, 12 Message Authentication and Hash Functions.
Computer Science CSC 774Dr. Peng Ning1 CSC 774 Advanced Network Security Topic 2. Review of Cryptographic Techniques.
CSE 597E Fall 2001 PennState University1 Digital Signature Schemes Presented By: Munaiza Matin.
E- Business Digital Signature Varna Free University Prof. Teodora Bakardjieva.
Cryptographic Security Cryptographic Mechanisms 1Mesbah Islam– Operating Systems.
Computer Science Public Key Management Lecture 5.
Digital Signature Xiaoyan Guo/ Xiaohang Luo/
Controller of Certifying Authorities PKI Technology - Role of CCA Assistant Controller (Technology) Controller of Certifying Authorities Ministry of Communications.
Csci5233 Computer Security1 Bishop: Chapter 10 Key Management: Digital Signature.
Information Security and Management 13. Digital Signatures and Authentication Protocols Chih-Hung Wang Fall
CS5204 – Fall Cryptographic Security Presenter: Hamid Al-Hamadi October 13, 2009.
1 Cryptography Cryptography is a collection of mathematical techniques to ensure confidentiality of information Cryptography is a collection of mathematical.
Lecture 8 Digital Signatures. This lecture considers techniques designed to provide the digital counterpart to a handwritten signature. A digital signature.
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.
Bob can sign a message using a digital signature generation algorithm
1 Introduction to Security and Cryptology Enterprise Systems DT211 Denis Manley.
CS555Topic 211 Cryptography CS 555 Topic 21: Digital Schemes (1)
Cryptography, Authentication and Digital Signatures
How cryptography is used to secure web services Josh Benaloh Cryptographer Microsoft Research.
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.
Key Management. Session and Interchange Keys  Key management – distribution of cryptographic keys, mechanisms used to bind an identity to a key, and.
Cryptography and Network Security (CS435) Part Eight (Key Management)
23-1 Last time □ P2P □ Security ♦ Intro ♦ Principles of cryptography.
Cryptography and Network Security Chapter 9 - Public-Key Cryptography
11.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Message Integrity and Message Authentication.
11-Basic Cryptography Dr. John P. Abraham Professor UTPA.
Cryptography (2) University of Palestine Eng. Wisam Zaqoot April 2010 ITSS 4201 Internet Insurance and Information Hiding.
PUBLIC-KEY CRYPTOGRAPH IT 352 : Lecture 2- part3 Najwa AlGhamdi, MSc – 2012 /1433.
Chapter 3 (B) – Key Management; Other Public Key Cryptosystems.
Advanced Database Course (ESED5204) Eng. Hanan Alyazji University of Palestine Software Engineering Department.
1 Number Theory and Advanced Cryptography 6. Digital Signature Chih-Hung Wang Sept Part I: Introduction to Number Theory Part II: Advanced Cryptography.
Codes & Ciphers Ltd 12 Duncan Road Richmond, Surrey TW9 2JD Information Security Group Royal Holloway, University of London Egham, Surrey TW20 0EX Impersonation.
1 Serbia 2003 INTRODUCTION to CRYPTOGRAPHY Fred Piper Codes & Ciphers Ltd 12 Duncan Road, Richmond Surrey, TW9 2JD ENGLAND Royal Holloway, University of.
Lecture 11 Overview. Digital Signature Properties CS 450/650 Lecture 11: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.
Chapt. 10 – Key Management Dr. Wayne Summers Department of Computer Science Columbus State University
Lecture 9 Overview. Digital Signature Properties CS 450/650 Lecture 9: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.
IT 221: Introduction to Information Security Principles Lecture 5: Message Authentications, Hash Functions and Hash/Mac Algorithms For Educational Purposes.
Cryptographic Security Aveek Chakraborty CS5204 – Operating Systems1.
Fundamentals of Network Security Ravi Mukkamala SCI 101 October 6, 2003.
Cryptographic Hash Function. A hash function H accepts a variable-length block of data as input and produces a fixed-size hash value h = H(M). The principal.
Basics of Cryptography
CSCE 715: Network Systems Security
S/MIME T ANANDHAN.
NET 311 Information Security
Chapter -7 CRYPTOGRAPHIC HASH FUNCTIONS
Chapter 8 roadmap 8.1 What is network security?
Presentation transcript:

DIGITAL SIGNATURES Fred Piper & Mert Özarar Codes & Ciphers Ltd 12 Duncan Road Richmond Surrey TW9 2JD Information Security Group Royal Holloway, University of London Egham, Surrey TW20 0EX

Digital Signatures2 Outline 1.Brief Introduction to Cryptography 2.Public Key Systems 3.Basic Principles of Digital Signatures 4.Public Key Algorithms 5.Signing Processes 6.Arbitrated Signatures 7.Odds and Ends NOTE: We will not cover all the sections

Digital Signatures3 The Essence of Security –Recognition of those you know –Introduction to those you don’t know –Written signature –Private conversation

Digital Signatures4 The Challenge Transplant these basic social mechanisms to the telecommunications and/or business environment.

Digital Signatures5 Sender –Am I happy that the whole world sees this ? –Am I prepared to pay to stop them ? –Am I allowed to stop them ? Recipient –Do I have confidence in : –the originator –the message contents and message stream –no future repudiation. Network Manager –Do I allow this user on to the network ? –How do I control their privileges ? The Security Issues

Digital Signatures6 Cryptography is used to provide: 1. Secrecy 2. Data Integrity 3. User Verification 4. Non-Repudiation

Digital Signatures7 Cipher System cryptogram c Enciphering Algorithm Deciphering Algorithm Key k(E)Key k(D) message m message m Interceptor

Digital Signatures8 The Attacker’s Perspective Deciphering Algorithm Unknown Key k(D) Known c Wants m Note: k(E) is not needed unless it helps determine k(D)

Digital Signatures9 Two Types of Cipher System Conventional or Symmetric –k(D) easily obtained from k(E) Public or Asymmetric –Computationally infeasible to determine k(D) from k(E)

Digital Signatures10 THE SECURITY OF THE SYSTEM IS DEPENDENT ON THE SECURITY OF THE KEYS

Digital Signatures11 Public Key Systems Original Concept For a public key system an enciphering algorithm is agreed and each would-be receiver publishes the key which anyone may use to send a message to him. Thus for a public key system to be secure it must not be possible to deduce the message from a knowledge of the cryptogram and the enciphering key. Once such a system is set up, a directory of all receivers plus their enciphering keys is published. However, the only person to know any given receiver’s deciphering key is the receiver himself.

Digital Signatures12 Public Key Systems For a public key system, encipherment must be a ‘one-way function’ which has a ‘trapdoor’. The trapdoor must be a secret known only to the receiver. A ‘one-way function’ is one which is easy to perform but very difficult to reverse. A ‘trapdoor’ is a trick or another function which makes it easy to reverse the function

Digital Signatures13 Some Mathematical One-Way Functions 1. Multiplication of two large primes. 2. Exponentiation modulo n ( n = pq ). 3. x  a x in GF(2 n ) or GF(p). 4. k  E k (m) for fixed m where E k is encryption in a symmetric key system which is secure against known plaintext attacks. 5. x  a.x where x is an n-bit binary vector and a is a fixed n-tuple of integers. Thus a.x is an integer.

Digital Signatures14 Public Key Cryptosystems –Enable secure communications without exchanging secret keys –Enable 3rd party authentication ( digital signature ) –Use number theoretic techniques –Introduce a whole new set of problems –Are extremely ingenious.

Digital Signatures15 Digital Signatures According to ISO, the term Digital Signature is used: ‘to indicate a particular authentication technique used to establish the origin of a message in order to settle disputes of what message (if any) was sent’.

Digital Signatures16 Digital Signatures A signature on a message is some data that validates a message and verifies its origin a receiver can keep as evidence a third party can use to resolve disputes. It depends on the message a secret parameter only available to the sender It should be u easy to compute (by one person only) u easy to verify u difficult to forge

Digital Signatures17 Digital Signature Cryptographic checksum Identifies sender Provides integrity check for data Can be checked by third party

Digital Signatures18 Hand-Written Signatures Intrinsic to signer Same on all documents Physically attached to message Beware plastic cards. Digital Signatures Use of secret parameter Message dependent.

Digital Signatures19 Principle of Digital Signatures There is a (secret) number which: Only one person can use Is used to identify that person ‘Anyone’ can verify that it has been used NB:Anyone who knows the value of a number can use that number.

Digital Signatures20 Attacks on Digital Signature Schemes To impersonate A, I must either obtain A’s private key substitute my public key for A’s NB: Similar attacks if A is receiving secret data encrypted with A’s public key

Digital Signatures21 Obtaining a Private Key  Mathematical attacks  Physical attacks NB: It may be sufficient to obtain a device which contains the key. Knowledge of actual value is not needed.

Digital Signatures22 Certification Authority AIM : To guarantee the authenticity of public keys. METHOD : The Certification Authority guarantees the authenticity by signing a certificate containing user’s identity and public key with its secret key. REQUIREMENT : All users must have an authentic copy of the Certification Authority’s public key.

Digital Signatures23 Certification Process Verifies credentials Creates Certificate Receives (and checks) Certificate Presents Public Key and credentials Generates Key Set Distribution Centre Owner

Digital Signatures24 How Does it Work? The Certificate can accompany all Fred’s messages The recipient must directly or indirectly: Trust the CA Validate the certificate The CA certifies that Fred Piper’s public key is……….. Electronically signed by the CA

Digital Signatures25 User Authentication Certificates Ownership of certificate does not establish identity Need protocols establishing use of corresponding secret keys

Digital Signatures26 WARNING Identity Theft You ‘are’ your private key You ‘are’ the private key corresponding to the public key in your certificiate

Digital Signatures27 Certification Authorities Problems/Questions Who generates users’ keys? How is identity established? How can certificates be cancelled? Any others?

Digital Signatures28 Fundamental Requirement Internal infrastructure to support secure technological implementation

Digital Signatures29 Is everything OK? Announcement in Microsoft Security Bulletin MS “ VeriSign Inc recently advised Microsoft that on January it issued two VeriSign Class 3 code- signing digital certificates to an individual who fraudulently claimed to be a Microsoft employee.”

Digital Signatures30 How to Create a Digital Signature Using RSA MESSAGE HASHING FUNCTION HASH OF MESSAGE Sign using Private Key SIGNATURE - SIGNED HASH OF MESSAGE

Digital Signatures31 How to Verify a Digital Signature Using RSA HASH OF MESSAGE Verify the Received Signature Re-hash the Received Message Verify using Public Key Message Hashing Function HASH OF MESSAGE Message Signature Message with Appended Signature If hashes are equal, signature is authentic

Digital Signatures32 Requirements for Hash Function h (H1)condenses message M of arbitrary length into a fixed length ‘digest’ h(M) (H2)is one-way (H3)is collision free - it is computationally infeasible to construct messages M, M ' with h(M) = h(M ' ) H3 implies a restriction on the size of h(M).

Digital Signatures33 Diffie Hellman Key Establishment Protocol General Idea: Use Public System A and B exchange public keys: P A and P B There is a publicly known function f which has 2 numbers as input and one number as output. A computes f (S A, P B ) where S A is A’s private key B computes f (S B, P A ) where S B is B’s private key f is chosen so that f (S A, P B ) = f (S B, P A ) So A and B now share a (secret) number

Digital Signatures34 D-H Man in the Middle Attack A B Fraudster F The Fraudster has agreed keys with both A and B A and B believe they have agreed a common key