Chapter 16 Security Introduction to CS 1 st Semester, 2012 Sanghyun Park.

Slides:



Advertisements
Similar presentations
Public Key Infrastructure and Applications
Advertisements

Digital Signatures and Hash Functions. Digital Signatures.
Cryptographic Security CS5204 – Operating Systems1.
Authentication and Digital Signatures CSCI 5857: Encoding and Encryption.
Department of Information Engineering1 Major Concerns in Electronic Commerce Authentication –there must be proof of identity of the parties in an electronic.
ECOMMERCE TECHNOLOGY SUMMER 2002 COPYRIGHT © 2002 MICHAEL I. SHAMOS Cryptographic Security.
Dr Alejandra Flores-Mosri Message Authentication Internet Management & Security 06 Learning outcomes At the end of this session, you should be able to:
BY MUKTADIUR RAHMAN MAY 06, 2010 INTERODUCTION TO CRYPTOGRAPHY.
ECOMMERCE TECHNOLOGY FALL 2003 COPYRIGHT © 2003 MICHAEL I. SHAMOS Cryptography.
Chapter 29 Internet Security
McGraw-Hill©The McGraw-Hill Companies, Inc., Security PART VII.
WS Algorithmentheorie 03 – Randomized Algorithms (Public Key Cryptosystems) Prof. Dr. Th. Ottmann.
WS Algorithmentheorie 03 – Randomized Algorithms (Public Key Cryptosystems) Prof. Dr. Th. Ottmann.
TCP/IP Protocol Suite 1 Chapter 28 Upon completion you will be able to: Security Differentiate between two categories of cryptography schemes Understand.
Network Security – Part 2 V.T. Raja, Ph.D., Oregon State University.
CSE 597E Fall 2001 PennState University1 Digital Signature Schemes Presented By: Munaiza Matin.
E- Business Digital Signature Varna Free University Prof. Teodora Bakardjieva.
Overview of Digital Signatures Introduction To Networks and Communications (CS 555) Presented by Bharath Kongara.
Cryptographic Security Cryptographic Mechanisms 1Mesbah Islam– Operating Systems.
Encryption is a way to transform a message so that only the sender and recipient can read, see or understand it. The mechanism is based on the use of.
Digital Signature Xiaoyan Guo/ Xiaohang Luo/
13.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 13 Digital Signature.
Secure Systems Research Group - FAU Patterns for Digital Signature using hashing Presented by Keiko Hashizume.
Chapter 13 Digital Signature
Chapter 31 Network Security
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 Cryptography Cryptography is a collection of mathematical techniques to ensure confidentiality of information Cryptography is a collection of mathematical.
©Brooks/Cole, 2003 Chapter 16 Security. ©Brooks/Cole, 2003 Define four aspects of security in a network: privacy, authentication, integrity, and nonrepudiation.
MT311 Java Application Development and Programming Languages Li Tak Sing ( 李德成 )
1 Cryptography Basics. 2 Cryptography Basic terminologies Symmetric key encryption Asymmetric key encryption Public Key Infrastructure Digital Certificates.
16.2 Digital Signatures By: John Barton. What is a Digital Signature? The idea comes from the idea of signing a document by its author (authenticating.
Tonga Institute of Higher Education Design and Analysis of Algorithms IT 254 Lecture 9: Cryptography.
Pretty Good Privacy by Philip Zimmerman presented by: Chris Ward.
1 Introduction to Security and Cryptology Enterprise Systems DT211 Denis Manley.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Network Security (A Very Brief Introduction)
.Net Security and Performance -has security slowed down the application By Krishnan Ganesh Madras.
AQA Computing A2 © Nelson Thornes 2009 Section Unit 3 Section 6.4: Internet Security Digital Signatures and Certificates.
_______________________________________________________________________________________________________________ E-Commerce: Fundamentals and Applications1.
Information Security Fundamentals Major Information Security Problems and Solutions Department of Computer Science Southern Illinois University Edwardsville.
Security.  is one of the most widely used and regarded network services  currently message contents are not secure may be inspected either.
Dr. L. Christofi1 Local & Metropolitan Area Networks ACOE322 Lecture 8 Network Security.
Cryptography, Authentication and 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
Introduction1-1 Data Communications and Computer Networks Chapter 6 CS 3830 Lecture 31 Omar Meqdadi Department of Computer Science and Software Engineering.
ITIS 1210 Introduction to Web-Based Information Systems Chapter 50 Cryptography, Privacy, and Digital Certificates.
Internet Security. Four Issues of Internet Security Authenticity: Is the sender of a message who they claim to be? Privacy: Are the contents of a message.
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.
Advanced Database Course (ESED5204) Eng. Hanan Alyazji University of Palestine Software Engineering Department.
Facilities for Secure Communication The Internet is insecure The Internet is a shared collection of networks. Unfortunately, that makes it insecure An.
Privacy versus Authentication Confidentiality (Privacy) –Interceptors cannot read messages Authentication: proving the sender’s identity –The Problem of.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 14 Network Security: Firewalls and VPNs.
31.1 Chapter 31 Network Security Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Digital Signatures, Message Digest and Authentication Week-9.
Lecture 2: Introduction to Cryptography
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 29 Internet Security.
©Brooks/Cole, 2003 Chapter 16 Security. ©Brooks/Cole, 2003 Define four aspects of security in a network: privacy, authentication, integrity, and nonrepudiation.
Cryptographic Security Aveek Chakraborty CS5204 – Operating Systems1.
Secure Instant Messenger in Android Name: Shamik Roy Chowdhury.
CS480 Cryptography and Information Security Huiping Guo Department of Computer Science California State University, Los Angeles 14. Digital signature.
Unit 3 Section 6.4: Internet Security
Computer Communication & Networks
NET 311 Information Security
PART VII Security.
Chapter 3 - Public-Key Cryptography & Authentication
Presentation transcript:

Chapter 16 Security Introduction to CS 1 st Semester, 2012 Sanghyun Park

Outline  Introduction  Aspects of Security  Privacy  Digital Signature

Introduction  With the growth of the ______, more and more data are being exchanged, and those data need to be _______  For example, when we shop on the Internet, we expect that the information we send to the vendor is kept secret  Also, when we receive a message, we sometimes need to ___________ the sender  In this chapter, we touch on the subject of security  There are four aspects of security

Aspects of Security (1/2) Security PrivacyAuthentication Integrity Nonrepudiation

Aspects of Security (2/2)  Privacy: Only the ______ and the ________ are able to understand the contents of the message  Authentication: The receiver needs to be sure of the sender’s _______  Integrity: The contents of the message need to be _________ during transmission  Nonrepudiation: A system needs to prove that the sender _______ sent the message

Privacy  Privacy can be achieved using ________________ methods  The data are encrypted at the sender site and decrypted at the receiver site  Two categories of encryption/decryption methods in use today are _______ key and _______ key

Privacy with Secret Key Encryption  The simplest way to encrypt data is to use a _____ key  The sender uses this key and an ________ algorithm to encrypt data; the receiver uses the _____ key and the corresponding algorithm to decrypt the data  The _____ key is used in encryption and decryption  However, the encryption and decryption algorithms are the _______ of each other

Data Encryption Standard (DES) (1/2)  We use very sophisticated encryption algorithm; the most common is called data encryption standard (DES)  DES encrypts and decrypts at the ___ level  The data are first transformed into a string of ___, and then broken into _______ of 64 bits  Each segment is then encrypted using a 56-bit key

Data Encryption Standard (DES) (2/2)  The secret key algorithms are very _______; they take less time to encrypt or decrypt compared with the ______ key algorithms  Therefore they are very good candidates for ____ messages  Each pair of users must have a secret key  The _________ of the keys between two parties can be difficult

Privacy with Public Key Encryption  There are two keys: a private key and a public key  The private key is kept by the _______  The public key is announced to the ______  When user A wants to send a message to user B, A uses the _____ key of B to encrypt the message; When the message is received by B, B uses its _______ key to decrypt the message

RSA: Basic Idea  The most common public-key algorithm is named after its inventors, Rivest-Shamir-Adleman (RSA) encryption  The private key is a pair of numbers ( N, d ); the public key is also a pair of numbers ( N, e )  The sender uses the following algorithm to encrypt the message: C = _________  The receiver uses the following algorithm to decrypt the message: P = _________  A major concept of the RSA algorithm is the use of very ______ numbers for d and e  In practice, the trial-and-error approach to breaking the code takes a _____ time (e.g. several months) even with the fastest computers available today

RSA: Example

RSA: Choosing Public and Private Keys  One question is how to choose the three numbers N, d, and e for encryption and decryption to work  The inventors of the RSA algorithm mathematically proved that using the following procedure guarantees that the algorithm will work  Choose two large ______ numbers, p and q  Compute N = p x q  Choose e (less than N ) such that e and ( p- 1)( q -1) are relative _______ (having no common factor other than 1)  Choose d such that ( e x d ) mod [( p -1)( q -1)] is equal to ___

Privacy Using The Combination (1/2)  We can combine the advantage of the secret key algorithm (_________) and the advantage of the public key algorithm (easy ___________ of keys)  The procedure is as follows:  The sender chooses a ______ key; this secret key is called the one-session key; it is used only _____  The sender uses the ______ key of the receiver to encrypt the secret key and sends the encrypted secret key to the receiver  The receiver uses the _______ key to decrypt the secret key  The sender uses the ______ key to encrypt the actual message

Privacy Using The Combination (2/2)

Digital Signature  The other three aspects of security (integrity, authentication, and nonrepudiation) can be achieved using the ______ of a document by its ______  Digital signature is a digital code that can be attached to an electronically transmitted message and that uniquely _______ the sender  Digital signature must be _________  Digital signature can be done in two ways: signing the ______ document or signing a ______ of the document

Signing The Whole Document (1/3)  We can use _____ key encryption to sign the whole document  The sender uses his ______ key (not the public key of the receiver) to encrypt the message  The receiver uses the _____ key of the sender (not his private key) to decrypt the message  The private key is used for encryption and the public key is used for decryption

Signing The Whole Document (2/3)  This method does not provide ______; anybody can use the ______ key of the sender to read the message. We need another level of encryption

Signing The Whole Document (3/3)  The integrity of the message is preserved because, if an intruder intercepts and changes the message, the decrypted message would be _________  The message can be authenticated because, if an intruder sends a message encrypted by his own private key, the message is then not decrypted correctly by the public key of the _____ author  Although the sender can deny sending the message, he must reveal (in court) his private key. If we encrypt and decrypt the ________ message, we get the _____ message

Signing The Digest  It is very ________ to use public key encryption to sign the whole document  To make the process more efficient, we can let the sender sign a _______ of the document  The sender makes a _________ of the document and signs it (encrypts it with his private key)  The receiver then checks the signature of the miniature (decrypts it with the sender’s _______ key)

Creating a Digest of The Message  Use a _____ function to create a digest of the message  The digest is of fixed size (usually 128 bits)  The two most common hash functions are Message Digest 5 (MD5) and Secure Hash Algorithm 1 (SHA-1)  The hash function has two properties to succeed  Hashing should be _________

Sender Site  After the digest has been created, it is encrypted (signed) using the sender’s ______ key  The encrypted digest is ______ to the original message and sent to the receiver

Receiver Site (1/2)  ________ the message and the encrypted digest  Apply the same hash function to the message to create a ______ digest  Decrypt the _______ digest using the public key of the sender  It the two digests are the _____, it is obvious that all three aspects of security are _________

Receiver Site (2/2)

Three Aspects of Security Under The Method of Signing The Digest  If the received message creates a ______ of the digest, the message has not been changed  The digest comes from the true sender, so the message also comes from the true sender  The sender cannot deny the message because he cannot deny the digest; the only message that can create that digest is the received message  This method does not provide ______; We need another level of encryption