Cyber Attacks and Cryptography Overview

Slides:



Advertisements
Similar presentations
Spring 2000CS 4611 Security Outline Encryption Algorithms Authentication Protocols Message Integrity Protocols Key Distribution Firewalls.
Advertisements

1 Network Security Outline Encryption Algorithms Authentication Protocols Message Integrity Protocols Key Distribution Firewalls.
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,
1 Cryptography and Network Security Third Edition by William Stallings Lecturer: Dr. Saleem Al_Zoubi.
Client/Server Computing Model of computing in which very powerful personal computers (clients) are connected in a network with one or more server computers.
Security Overview Hofstra University University College for Continuing Education - Advanced Java Programming Lecturer: Engin Yalt May 24, 2006.
1 資訊安全 Network Security Instructor: 孫宏民 Room: EECS 6402, Tel: , Fax :
Spring 2002CS 4611 Security Outline Encryption Algorithms Authentication Protocols Message Integrity Protocols Key Distribution Firewalls.
Wireless Security In wireless networks. Security and Assurance - Goals Integrity Modified only in acceptable ways Modified only by authorized people Modified.
BY MUKTADIUR RAHMAN MAY 06, 2010 INTERODUCTION TO CRYPTOGRAPHY.
Cryptography1 CPSC 3730 Cryptography Chapter 10 Key Management.
8-1 What is network security? Confidentiality: only sender, intended receiver should “understand” message contents m sender encrypts message m receiver.
Spring 2003CS 4611 Security Outline Encryption Algorithms Authentication Protocols Message Integrity Protocols Key Distribution Firewalls.
Applied Cryptography for Network Security
TCP/IP Protocol Suite 1 Chapter 28 Upon completion you will be able to: Security Differentiate between two categories of cryptography schemes Understand.
1 CS 194: Distributed Systems Security Scott Shenker and Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences.
Cryptography and Network Security Chapter 10. Chapter 10 – Key Management; Other Public Key Cryptosystems No Singhalese, whether man or woman, would venture.
CSE 597E Fall 2001 PennState University1 Digital Signature Schemes Presented By: Munaiza Matin.
Network Security Sorina Persa Group 3250 Group 3250.
Cryptographic Security Cryptographic Mechanisms 1Mesbah Islam– Operating Systems.
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.
CS5204 – Fall Cryptographic Security Presenter: Hamid Al-Hamadi October 13, 2009.
1 Introduction to Security and Cryptology Enterprise Systems DT211 Denis Manley.
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)
IT 221: Introduction to Information Security Principles Lecture 6:Digital Signatures and Authentication Protocols For Educational Purposes Only Revised:
E-Commerce Security Technologies : Theft of credit card numbers Denial of service attacks (System not availability ) Consumer privacy (Confidentiality.
Network Security. Security Threats 8Intercept 8Interrupt 8Modification 8Fabrication.
Dr. L. Christofi1 Local & Metropolitan Area Networks ACOE322 Lecture 8 Network Security.
Cryptography, Authentication and Digital Signatures
E-Commerce Security Professor: Morteza Anvari Student: Xiaoli Li Student ID: March 10, 2001.
CSCE 201 Introduction to Information Security Fall 2010 Data Protection.
Códigos y Criptografía Francisco Rodríguez Henríquez Security Attacks: Active and Passive Active Masquerade (impersonation) Replay Modification of message.
CSCD 218 : DATA COMMUNICATIONS AND NETWORKING 1
10. Key Management. Contents Key Management  Public-key distribution  Secret-key distribution via public-key cryptography.
CS526: Information Security Prof. Sam Wagstaff September 16, 2003 Cryptography Basics.
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.
BASIC CRYPTOGRAPHIC CONCEPTS. Public Key Cryptography  Uses two keys for every simplex logical communication link.  Public key  Private key  The use.
Network Security Lecture 23 Presented by: Dr. Munam Ali Shah.
Chapter 16 Security Introduction to CS 1 st Semester, 2012 Sanghyun Park.
Information Security By:-H.M.Patel. Information security There are three aspects of information security Security service Security mechanism Security.
Cryptography and Network Security Chapter 13 Fourth Edition by William Stallings.
Chapter 3 (B) – Key Management; Other Public Key Cryptosystems.
Lecture 3 Basic Security Concepts cont.. Homework 1. Score: 10 points Due: September 12, :00 am via dropbox Last day to submit with 4%/day penalty:
Lecture 16: Security CDK4: Chapter 7 CDK5: Chapter 11 TvS: Chapter 9.
Security Many secure IT systems are like a house with a locked front door but with a side window open -somebody.
1 Chapter 10: Key Management in Public key cryptosystems Fourth Edition by William Stallings Lecture slides by Lawrie Brown (Modified by Prof. M. Singhal,
K. Salah1 Cryptography Module I. K. Salah2 Cryptographic Protocols  Messages should be transmitted to destination  Only the recipient should see it.
Ch 13 Trustworthiness Myungchul Kim
Protocol Analysis. CSCE Farkas 2 Cryptographic Protocols Two or more parties Communication over insecure network Cryptography used to achieve goal.
Network Security Introduction
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.
Network Security Celia Li Computer Science and Engineering York University.
Lecture 9 Overview. Digital Signature Properties CS 450/650 Lecture 9: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.
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.
Cryptographic Security Aveek Chakraborty CS5204 – Operating Systems1.
Introduction (Pendahuluan)  Information Security  Criptography.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
Fourth Edition by William Stallings Lecture slides by Lawrie Brown
Basics of Cryptography
Security Outline Encryption Algorithms Authentication Protocols
Protocol Analysis.
Cryptography.
Presentation transcript:

Cyber Attacks and Cryptography Overview

concepts wrt. the Internet? Security Objectives Confidentiality Integrity Availability Authentication Non-repudiation How can we define these concepts wrt. the Internet? Internet Security - Farkas

Internet Security - Farkas Types of Attacks (1) Interruption – an asset is destroyed, unavailable or unusable (availability) Interception – unauthorized party gains access to an asset (confidentiality) Modification – unauthorized party tampers with asset (integrity) Fabrication – unauthorized party inserts counterfeit object into the system (authenticity) Denial – person denies taking an action (authenticity) Internet Security - Farkas

Internet Security - Farkas Types of Attacks (2) Passive attacks: Eavesdropping Monitoring Active attacks: Masquerade – one entity pretends to be a different entity Replay – passive capture of information and its retransmission Modification of messages – legitimate message is altered Denial of service – prevents normal use of resources Internet Security - Farkas

Internet Security - Farkas Protection Protection at storage Inactive (e.g., databases storage, file system) During processing (e.g., DBMS access, application access) Protection during transmission Level of protection (e.g., content vs. header info) Aim of protection (e.g., confidentiality, integrity, privacy, etc.) Internet Security - Farkas

Basic Defense Mechanisms Usable security! Identification and Authentication Authorization Cryptography Hardware, software security Tampering avoidance Information leakage prevention Input validation Network-protection: communication, firewall, IDS, etc. Internet Security - Farkas

Attacks Against Communication Channels Internet Security - Farkas

Insecure communications Sender Recipient Insecure channel Confidential Encryption: confidential communication Internet Security - Farkas

Internet Security - Farkas Encryption Does it support? Confidentiality Integrity Availability Authentication (pair-wise, third party) Non-repudiation Internet Security - Farkas

Internet Security - Farkas Terminology Plaintext (cleartext): a message in its original form Ciphertext (cyphertext): an encrypted message Encryption: transformation of a message to hide its meaning Cipher: cryptographic algorithm. A mathematical function used for encryption (encryption algorithm) and decryption (decryption algorithm). Internet Security - Farkas

Internet Security - Farkas Terminology Decryption: recovering meaning from ciphertext Cryptography: art and science of keeping messages secure Cryptanalysis: art and science of breaking ciphertext Cryptology: study of both cryptography and cryptanalysis Internet Security - Farkas

Internet Security - Farkas Continue from 08/29 Internet Security - Farkas

Internet Security - Farkas Encryption and Decryption Plaintext Ciphertext Plaintext Encryption Decryption Internet Security - Farkas

Conventional (Secret Key) Cryptosystem Plaintext Ciphertext Plaintext Encryption Decryption Sender Recipient K C=E(K,M) M=D(K,C) K needs secure channel Internet Security - Farkas

Internet Security - Farkas Public Key Cryptosystem Recipient’s public Key (Kpub) Recipient’s private Key (Kpriv) Plaintext Ciphertext Plaintext Encryption Decryption Sender Recipient C=E(Kpub,M) M=D(Kpriv,C) Kpub needs reliable channel Internet Security - Farkas

Summary: Secret-Key Encryption Single, secret key Key distribution problem of secret key systems Establish key before communication Need n(n-1)/2 keys with n different parties Do NOT provide electronic signatures Faster than public-key encryption Internet Security - Farkas

Summary: Public Key Encryption Supports confidentiality and authentication Need reliable channel for key distribution 2n keys for n users (public, private pairs) Digital certificate PKI Internet Security - Farkas

Simple secret key distribution KE-S ||ID-S 2. E KE-S(Ksession) Sender Recipient Vulnerable to active attack! HOW? Internet Security - Farkas

With confidentiality and authentication E KE-R[N1||ID-S] 2. E KE-S[N1||N2] 3. E KE-R[N2-1] 4. E KE-R E KD-S(Ksession) Sender Recipient What are the basic requirements for this protocol to be correct? Internet Security - Farkas

Internet Security - Farkas What is a Protocol? Internet Security - Farkas

Internet Security - Farkas Protocol Sequence of interactions between entities to achieve a certain end Types of protocols: Diplomatic Communication Graduation Security Etc. What is TCP/IP? Internet Security - Farkas

Internet Security - Farkas Reading Assignment Recommended Reading: P.Y.A. Ryan, S.A. Schneider, M.H. Goldsmith, G. Lowe and A.W. Roscoe, The Modelling and Analysis of Security Protocols: the CSP Approach, Section 0. Introduction, pages: 1 – 37, http://www.computing.surrey.ac.uk/personal/st/S.Schneider/books/MASP.pdf Internet Security - Farkas

Internet Security - Farkas Security Protocols Cryptographic protocols Services: secrecy, integrity, authentication, key exchange, non-repudiation, etc. Components: communicating parties (nodes), trusted third party, encryption algorithms, hash functions, timestamps, nonce, etc. Internet Security - Farkas

Security Properties – Secrecy Non-interference: Intruder should not be able to deduce anything about the legitimate users’ activities Message confidentiality: intruder cannot derive the plaintext of messages passed between two legitimate nodes Internet Security - Farkas

Security Properties – Authentication of Origin Verify Who sent the message? Who sent the message to whom? Who sent the message to whom and how many times? Internet Security - Farkas

Security Properties – Entity Authentication Similar to authentication of origin but has timeliness Repeated form of origin authentication Internet Security - Farkas

Security Properties – Integrity Data cannot be corrupted Content of output messages match the content of the input message Internet Security - Farkas

Security Properties – Authenticated Key-Exchange I’m calling from your utilities company. We need your SSN, billing address, and … Share a secret key with another person and know for sure who this other person is Internet Security - Farkas

Security Properties – Non-repudiation Legitimate participants Against possible cheating Signature-type mechanism Internet Security - Farkas

Security Properties – Fairness Legitimate participants Prevents one of the participants to gain advantage over another by halting the protocol part-way through Internet Security - Farkas

Security Properties – Anonymity Over some sets of events Shuffling the events will not change an observer’s view Occurrence of events? Accountability Internet Security - Farkas

Security Properties – Availability To be able to achieve the goals Internet Security - Farkas

More Examples of Crypto protocols Read on your own Internet Security - Farkas

Diffie-Hellman Key Exchange Proposed in 1976 First public key algorithm Allows group of users to agree on secret key over insecure channel Cannot be used to encrypt and decrypt messages Internet Security - Farkas

Diffie-Hellman Key Exchange Protocol for A and B want to agree on shared secret key: A and B agree on two large numbers n and g, such that 1<g<n A chooses random x and computes X=gx mod n and sends X to B B chooses random y and computes Y=gy mod n and sends Y A computes k= Yx mod n B computer k’= Xy mod n Note: k =k’= gyx mod n Internet Security - Farkas

Diffie-Hellman Key Exchange Requires no prior communication between A and B Security depends on difficulty of computing x given X=gx mod n Choices for g and n are critical: both n and (n-1)/2 should be prime, n should be large Susceptible to intruder in the middle attack (active intruder) Internet Security - Farkas

Intruder in the Middle Attack John Rose Hi Rose, I’m John. Hi Rose, I’m John. Hi John, I’m Rose. Hi John, I’m Rose. Intruder and John Uses Diffie-Hellman To agree on key K. Intruder and Rose Uses Diffie-Hellman To agree on key K’. K and K’ may be the same Internet Security - Farkas

Asymmetric-Key Exchange Without server Broadcasting Publicly available directory With server Public key distribution center Certificates Internet Security - Farkas

Internet Security - Farkas Public announcement KE-J.S. KE-J.S. KE-J.S. KE-J.S. John Smith KE-J.S. KE-J.S. Bad: Uncontrolled distribution  easy to forge Internet Security - Farkas

Publicly available directory Better but not Good enough  Directory could Be compromised Public Key Directory KE-J.S. KE-M.R.. John Smith Mary Rose Internet Security - Farkas

Internet Security - Farkas Public-key authority Public-Key Authority 1. Request || Time1 4. Request || Time2 2. EKD-Auth[KE-R||Request||Time1] 5. EKD-Auth[KE-S||Request||Time2] 3. EKE-R(ID-S||N1) Sender 6. EKE-S(N1||N2) Recipient 7. EKE-R(N2) Internet Security - Farkas

Public-key certificates Authority KE-R KE-S C-S=EKD-CAuth[Time1,ID-S,KE-S] CR=EKD-CAuth[Time2,ID-R,KE-R] 1. C-S Sender 2. C-R Recipient Internet Security - Farkas

Internet Security - Farkas Certificates Guarantees the validity of the information Establishing trust Public key and user identity are bound together, then signed by someone trusted Need: digital signature Internet Security - Farkas

Internet Security - Farkas Digital Signature Need the same effect as a real signature Un-forgeable Authentic Non-alterable Not reusable Internet Security - Farkas

Internet Security - Farkas Digital signature Direct digital signature: public-key cryptography based Arbitrated digital signature: Conventional encryption: Arbiter sees message Arbiter does not see message Public-key based Internet Security - Farkas

Digital Signatures in RSA Insecure channel Sign Verify Plaintext Plaintext Signed plaintext Decryption Alg. Encryption Alg. Recipient Sender S’s private key S’s public key (need reliable channel) Internet Security - Farkas

Internet Security - Farkas Non-repudiation Requires notarized signature, involving a third party Large system: hierarchies of notarization Internet Security - Farkas

Next Class TCP/IP Overview Internet Security - Farkas