Network Security Chapter 8.

Slides:



Advertisements
Similar presentations
Internet and Intranet Protocols and Applications Lecture 9a: Secure Sockets Layer (SSL) March, 2004 Arthur Goldberg Computer Science Department New York.
Advertisements

SSL CS772 Fall Secure Socket layer Design Goals: SSLv2) SSL should work well with the main web protocols such as HTTP. Confidentiality is the top.
Network Security Chapter 8. Cryptography Introduction to Cryptography Substitution Ciphers Transposition Ciphers One-Time Pads Two Fundamental Cryptographic.
EEC 693/793 Special Topics in Electrical Engineering Secure and Dependable Computing Lecture 6 Wenbing Zhao Department of Electrical and Computer Engineering.
Principles of Information Security, 2nd edition1 Cryptography.
Lesson Title: Introduction to Cryptography Dale R. Thompson Computer Science and Computer Engineering Dept. University of Arkansas
EEC 693/793 Special Topics in Electrical Engineering Secure and Dependable Computing Lecture 6 Wenbing Zhao Department of Electrical and Computer Engineering.
Cryptographic Technologies
EEC-484/584 Computer Networks Lecture 16 Wenbing Zhao
Network Security Chapter 8. Cryptography Introduction to Cryptography Substitution Ciphers Transposition Ciphers One-Time Pads Two Fundamental Cryptographic.
EEC-484/584 Computer Networks Lecture 16 Wenbing Zhao
EECC694 - Shaaban #1 lec #16 Spring Properties of Secure Network Communication Secrecy: Only the sender and intended receiver should be able.
Security Outline Encryption Algorithms Authentication Protocols Message Integrity Protocols Key Distribution Firewalls.
TCP/IP Protocol Suite 1 Chapter 28 Upon completion you will be able to: Security Differentiate between two categories of cryptography schemes Understand.
Chapter 8 Network Security 4/17/2017
Network Security. Contents Security Requirements and Attacks Confidentiality with Conventional Encryption Message Authentication and Hash Functions Public-Key.
Network Security Chapter
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 Network Security Chapter 8.
Network Security Chapter Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011.
Network Security Chapter 8
Network Security Chapter Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011.
Computer Networks NYUS FCSIT Spring 2008 Milos STOLIC, Bs.C. Teaching Assistant
Network Security. An Introduction to Cryptography The encryption model (for a symmetric-key cipher).
ECE453 – Introduction to Computer Networks Lecture 18 – Network Security (I)
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Network Security (A Very Brief Introduction)
1 Lecture #22: Network Security. 2 A classic lesson The chain is only as strong as its weakest link!
Network Security. Information secrecy-only specified parties know the information exchanged. Provided by criptography. Information integrity-the information.
每时每刻 可信安全 1The DES algorithm is an example of what type of cryptography? A Secret Key B Two-key C Asymmetric Key D Public Key A.
Cryptography Wei Wu. Internet Threat Model Client Network Not trusted!!
Network Security David Lazăr.
Chapter 7: Cryptographic Systems
Information and Network Security Rudra Dutta CSC 401- Fall 2011, Section 001.
Network Security Chapter 8 12/13/ Cryptography Introduction to Cryptography Substitution Ciphers Transposition Ciphers One-Time Pads Two Fundamental.
INFORMATION SECURITY MANAGEMENT P ROTECTION M ECHANISMS - C RYPTOGRAPHY.
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.
INFORMATION SECURITY MANAGEMENT P ROTECTION M ECHANISMS - C RYPTOGRAPHY.
Network Security Chapter 8 Institute of Information Science and Technology. Chengdu University YiYong 2008 年 2 月 25 日.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
Network security Cryptographic Principles
Network Security Chapter 8
Chapter 5 Network Security Protocols in Practice Part I
Reviews Rocky K. C. Chang 20 April 2007.
Basics of Cryptography
Security Outline Encryption Algorithms Authentication Protocols
Opracowanie językowe dr inż. J. Jarnicki
Cryptography and Network Security
Network Security.
Secure Sockets Layer (SSL)
What is network security?
Chapter 8 Network Security.
Chapter 9 Security 9.1 The security environment
Chapters 14,15 Security.
Encryption
Network Security Chapter 8
Cryptography and Network Security
Message Security, User Authentication, and Key Management
EEC 688/788 Secure and Dependable Computing
Chapter 7 STRENGTH OF ENCRYPTION & Public Key Infrastructure
Chapter 8 Network Security.
PART VII Security.
SSL (Secure Socket Layer)
The Secure Sockets Layer (SSL) Protocol
Encryption INST 346, Section 0201 April 3, 2018.
Chapters 14,15 Security.
Public-Key, Digital Signatures, Management, Security
DISTRIBUTED SYSTEMS Principles and Paradigms Second Edition ANDREW S
Chapter 3 - Public-Key Cryptography & Authentication
Chapter 29 Cryptography and Network Security
Cryptography and Network Security
Presentation transcript:

Network Security Chapter 8

Some people who cause security problems and why. Network Security Some people who cause security problems and why.

Cryptography Introduction Substitution ciphers Transposition ciphers One-time pads Fundamental cryptographic principles

The encryption model (for a symmetric-key cipher). Introduction The encryption model (for a symmetric-key cipher).

Monoalphabetic substitution Substitution Ciphers Monoalphabetic substitution

Transposition Ciphers A transposition cipher

One-Time Pads (1) The use of a one-time pad for encryption and the possibility of getting any possible plaintext from the ciphertext by the use of some other pad.

An example of quantum cryptography One-Time Pads (2) An example of quantum cryptography

Fundamental Cryptographic Principles Messages must contain some redundancy Some method is needed to foil replay attacks

Symmetric-key Algorithms (1) Basic elements of product ciphers. (a) P-box. (b) S-box. (c) Product.

Symmetric-key Algorithms (2) Data encryption standard Advanced encryption standard Cipher modes Other ciphers Cryptanalysis

Data Encryption Standard (1) The data encryption standard. (a) General outline. (b) Detail of one iteration. The circled + means exclusive OR.

Data Encryption Standard (2) (a) Triple encryption using DES. (b) Decryption

Advanced Encryption Standard (1) Algorithm symmetric block cipher. Full design must be public. Key lengths of 128, 192, and 256 bits supported. Software and hardware implementations possible. Algorithm public or licensed on nondiscriminatory terms.

Advanced Encryption Standard (2) . . . An outline of Rijndael

Advanced Encryption Standard (3) . . . An outline of Rijndael

Advanced Encryption Standard (4) Creating of the state and rk arrays

The plaintext of a file encrypted as 16 DES blocks. Cipher Modes (1) The plaintext of a file encrypted as 16 DES blocks.

Cipher block chaining. (a) Encryption. (b) Decryption Cipher Modes (2) Cipher block chaining. (a) Encryption. (b) Decryption

Cipher feedback mode. (a) Encryption. (b) Decryption Cipher Modes (3) Cipher feedback mode. (a) Encryption. (b) Decryption

A stream cipher. (a) Encryption. (b) Decryption Cipher Modes (4) A stream cipher. (a) Encryption. (b) Decryption

Encryption using counter mode Cipher Modes (5) Encryption using counter mode

Some common symmetric-key cryptographic algorithms Other Ciphers Some common symmetric-key cryptographic algorithms

Public-key Algorithms RSA Authors: Rivest, Shamir, Adleman Other Public-Key Algorithms

RSA (1) Method Summary Choose two large primes, p and q Compute n = p × q and z = ( p − 1) × (q − 1). Choose number relatively prime to z call it d. Find e such that e × d = 1 mod z.

An example of the RSA algorithm

Digital Signatures (1) Required Conditions: Receiver can verify claimed identity of sender. Sender cannot later repudiate contents of message. Receiver cannot have concocted message himself.

Digital Signatures (2) Symmetric-key signatures Public-key signatures Message digests The birthday attack

Symmetric-key Signatures Digital signatures with Big Brother

Public-Key Signatures (1) Digital signatures using public-key cryptography.

Public-Key Signatures (2) Criticisms of DSS: Too secret Too slow Too new Too insecure

Message Digests (1) Message Digest properties Given P, easy to compute MD(P). Given MD(P), effectively impossible to find P. Given P no one can find P′ such that MD(P′) = MD(P). Change to input of even 1 bit produces very different output.

Digital signatures using message digests

Use of SHA-1 and RSA for signing nonsecret messages Message Digests (3) Use of SHA-1 and RSA for signing nonsecret messages

Message Digests (4) A message padded out to a multiple of 512 bits. The output variables. The word array.

Management of Public Keys (1) A way for Trudy to subvert public-key encryption

Management of Public Keys (2) Certificates X.509 Public key infrastructures

A possible certificate and its signed hash Certificates A possible certificate and its signed hash

The basic fields of an X.509 certificate

Public Key Infrastructures (a) A hierarchical PKI. (b) A chain of certificates.

Communication Security IPsec Firewalls Virtual private networks Wireless security

The IPsec authentication header in transport mode for IPv4.

(a) ESP in transport mode. (b) ESP in tunnel mode. IPsec (2) (a) ESP in transport mode. (b) ESP in tunnel mode.

A firewall protecting an internal network IPsec (3) A firewall protecting an internal network

Virtual Private Networks (1) A virtual private network

Virtual Private Networks (2) Topology as seen from the inside

The 802.11i key setup handshake Wireless Security The 802.11i key setup handshake

Authentication Protocols Shared secret key Establishing a shared key: the Diffie-Hellman key exchange Key distribution center Kerberos Public-key cryptography

Shared Secret Key (1) Notation for discussing protocols A, B are the identities of Alice and Bob. Ri’s are the challenges, where the subscript identifies the challenger. Ki are keys, where i indicates the owner. KS is the session key.

Two-way authentication using a challenge-response protocol. Shared Secret Key (2) Two-way authentication using a challenge-response protocol.

A shortened two-way authentication protocol Shared Secret Key (3) A shortened two-way authentication protocol

Shared Secret Key (4) The reflection attack.

Shared Secret Key (5) General design rules Have initiator prove who she is before responder Initiator, responder use different keys Draw challenges from different sets Make protocol resistant to attacks involving second parallel session

A reflection attack on the protocol of Fig. 8-32 Shared Secret Key (6) A reflection attack on the protocol of Fig. 8-32

Authentication using HMACs Shared Secret Key (7) Authentication using HMACs

The Diffie-Hellman Key Exchange (1)

The Diffie-Hellman Key Exchange (2) The man-in-the-middle attack

Key Distribution Center (1) A first attempt at an authentication protocol using a KDC.

Key Distribution Center (2) The Needham-Schroeder authentication protocol

Key Distribution Center (3) The Otway-Rees authentication protocol (slightly simplified).

The operation of Kerberos V5

Public-Key Cryptography Mutual authentication using public-key cryptography

Email Security PGP—Pretty Good Privacy S/MIME

PGP—Pretty Good Privacy (1) PGP in operation for sending a message

PGP—Pretty Good Privacy (2) Casual (384 bits): Can be broken easily today. Commercial (512 bits): b Breakable by three-letter organizations. Military (1024 bits): Not breakable by anyone on earth. Alien (2048 bits): Unbreakable by anyone on other planets

PGP—Pretty Good Privacy (3) A PGP message

Web Security Threats Secure naming SSL—the Secure Sockets Layer Mobile code security

Secure Naming (1) Normal situation

An attack based on breaking into DNS and modifying Bob’s record. Secure Naming (2) An attack based on breaking into DNS and modifying Bob’s record.

How Trudy spoofs Alice’s ISP. Secure Naming (3) How Trudy spoofs Alice’s ISP.

Secure Naming (4) DNSsec fundamental services: Proof of where the data originated. Public key distribution. Transaction and request authentication.

Secure Naming (5) An example RRSet for bob.com. The KEY record is Bob’s public key. The SIG record is the top-level com server’s signed hash of the A and KEY records to verify their authenticity.

SSL—The Secure Sockets Layer (1) Secure connection includes … Parameter negotiation between client and server. Authentication of the server by client. Secret communication. Data integrity protection.

SSL—The Secure Sockets Layer (2) Layers (and protocols) for a home user browsing with SSL.

SSL—The Secure Sockets Layer (3) A simplified version of the SSL connection establishment subprotocol.

SSL—The Secure Sockets Layer (4) Data transmission using SSL

Applets can be interpreted by a Web browser Mobile Code Security Applets can be interpreted by a Web browser

Social Issues Privacy Freedom of speech Copyright

How Alice uses 3 remailers to send Bob a message Privacy How Alice uses 3 remailers to send Bob a message

Freedom of Speech (1) Possible banned material: Inappropriate for children Hate aimed at various groups Information about democracy History that contradicts government position Manuals for potentially illegal activities

Freedom of Speech (2) Three zebras and a tree. Three zebras, a tree, and the complete text of five plays by William Shakespeare.

End Chapter 8