28 Pages

notes07

Course: CPE 5002, Fall 2009
School: Allan Hancock College
Rating:
 
 
 
 
 

Word Count: 1510

Document Preview

at Security the Transport Layer Lecture 6 SSL/TLS s SSL was developed by Phil Karlton & Netscape. The standards community wanted their own version free from any patents/restrictions s Thus was born TLS, which is very similar to SSL IETF changed the name to avoid showing bias and add a few things E.g: TLS defines additional alert codes TLS MAC covers compression version field in addition to what...

Register Now

Unformatted Document Excerpt

Coursehero >> California >> Allan Hancock College >> CPE 5002

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
at Security the Transport Layer Lecture 6 SSL/TLS s SSL was developed by Phil Karlton & Netscape. The standards community wanted their own version free from any patents/restrictions s Thus was born TLS, which is very similar to SSL IETF changed the name to avoid showing bias and add a few things E.g: TLS defines additional alert codes TLS MAC covers compression version field in addition to what SSL MAC covers TLS v1.0 is very similar to SSL v3.1 Information and Nework Security 2 SSL HTTP NNTP FTP Telnet Etc. Other Apps SSL/TLS TCP/IP Information and Nework Security 3 Digital certificates and the CA s Public key cryptography avoids the problem of key distributions but it has its weakness: the public key is public and anyone can forge a public key announcement s Solution: public-key certificate: <a public key and user ID of the key owner>, the whole thing, is signed by a trusted third party (TTP) The TTP is a certificate authority (CA) A user can present her public key to the CA in a secure manner and obtain a certificate The user can then publish her public key Anyone needs this user's public key can obtain the certificate and verify that it is valid by the way of the attached trusted signature Information and Nework Security 4 Client/Server Mutual Authentication Establish trust with intended recipients s Signed Digital Certificates s Server authenticates Client (optional) Client authenticates Server Information and Nework Security 5 Secure Sockets Layer (SSL) s s s SSL is designed to run in user-level process no need to change the OS (not like IPSec that runs in superuser-level process) SSL uses TCP only (not UDP), hence it is simple and it does not have to worry about timing out and retransmitting lost data (TCP does that for SSL) Applications based on TCP needs to change (even minimum) to work with SSL Information and Nework Security 6 Secure Sockets Layer (SSL) s The primary goal of the SSL Protocol is To provide privacy and reliability between two communicating applications. Allows client/server applications to communicate in a way that is designed to prevent eavesdropping, tampering, or message forgery (Many applications at Application Layer are based on client/server model) Information and Nework Security 7 SSL Secure Client/Server Communication SSL Server authentication allows clients to confirm a server's identity s SSL client authentication allows server to confirm a client's identity (optional) s SSL provides confidentiality and integrity s Sent information is encrypted Integrity check is carried out to detect tampering Information and Nework Security 8 SSL Secure Client/Server Communication s To allow Secure Client/Server Communication to happen using SSL: The peer's identity can be authenticated using certificates [basically using asymmetric (private key cryptography like DES), and public key, cryptography (e.g., RSA, DSS, etc.)]. Encryption is used after an initial handshake to define a secret key. Secret key cryptography is used for data encryption (e.g., DES, RC4, etc.) Integrity check is done using a keyed MAC: Secure hash functions (e.g., SHA, MD5, etc.) are used for MAC computations. Information and Nework Security 9 SSL Main Functions s Negotiates and employs essential functions for secure transactions Mutual Authentication Data Encryption Data Integrity Information and Nework Security 10 SSL Structure Application Layer (http imap etc) ChangeCipher Alert Handshake Record Layer TCP/IP } SSL/TLS Information and Nework Security 11 Cipher Suite s For public-key, secret key encryption and certificate verification we need public-key algorithm Secret key encryption algorithm message digest (hash) algorithm (MD5, SHA-1, etc) s s s s This collection is called a cipher suite SSL supports many different cipher suites Client and server must decide on which one to use The client offers a choice; the server picks one 12 Information and Nework Security SSL Protocols s s SSL consists of two protocol layers (The Record Layer and its above layer which consists of ChangeCipherSpec protocol , Alert protocol and Handshake protocol.) The SSL record protocol: takes an application message to be transmitted, fragments the data into manageable blocks, optionally compresses the data, applies MAC, encrypts, adds a header and transmits the resulting unit in TCP segment 13 Information and Nework Security SSL Other Protocols s The Handshake protocol negotiates all options of the session (most important) The handshake protocol involves using SSL record protocol to exchange a series of messages between an SSL-enabled server and an SSL-enabled client s s The ChangeCipherSpec protocol indicates the channel is ready for secure communications The Alert protocol indicates errors or other caution conditions have occurred in the connection 14 Information and Nework Security The Changecipherspec Structure The change cipher spec message is sent by both the client and server to notify the receiving party that subsequent records will be protected under the newly negotiated CipherSpec and keys s struct { enum { change_cipher_spec(1), (255) } type; } ChangeCipherSpec; Information and Nework Security 15 Alert Message Structure s The Alert protocol specifies and conveys the status of transmitted messages struct { AlertLevel level; AlertDescription } description; Alert; Information and Nework Security 16 Handshake Protocol s The TLS Handshake Protocol involves the following steps: Exchange hello messages to agree on algorithms, exchange random values, and check for session resumption. Exchange the necessary cryptographic parameters to allow the client and server to agree on a premaster secret. Exchange certificates and cryptographic information to allow the client and server to authenticate themselves. Generate a master secret from the premaster secret and exchanged random values. Provide security parameters to the record layer. Allow the client and server to verify that their peer has calculated the same security parameters and that the handshake occurred without tampering by an attacker. Information and Nework Security 17 ClientHello Message Structure struct { ProtocolVersion client_version; Random random; SessionID session_id; CipherSuite cipher_suites; CompressionMethod_list compression_methods; } ClientHello; Information and Nework Security 18 ServerHello Message Structure struct { ProtocolVersion server_version; Random random; SessionID session_id; CipherSuite cipher_suite; CompressionMethod_list compression_method; } ServerHello; Information and Nework Security 19 Message Flow of full Handshake Client ClientHello --------> ServerHello Certificate* ServerKeyExchange* CertificateRequest* ServerHelloDone Server <-------Certificate* ClientKeyExchange CertificateVerify* [ChangeCipherSpec] Finished --------> [ChangeCipherSpec] <-------Finished Application Data <-------> Application Data * Indicates optional or situationdependent messages that are not Borrowed from rft2246 always sent. Information and Nework Security 20 Client/Server Server client1 message new thread s1 to serve client1 main thread message new thread s2 to serve client2 client2 Information and Nework Security 21 Client/Server Socket Connection Client A #1 accept Original socket Newly returned socket #2 Newly returned socket Client B Server Information and Nework Security 22 Client/Server with TCP and Socket Client must contact server server process must first be running server must have created socket (door) that welcomes client's contact Client contacts server by: creating client-local TCP socket specifying IP address, port number of server process When client creates socket: client TCP establishes connection to server TCP When contacted by client, server TCP creates new socket for server process to communicate with client allows server to talk with multiple clients Information and Nework Security 23 TCP socket programming flow Client socket() connect() write() Connection establishment TCP threeway handshake Data (request) socket() well-known port bind() listen() accept() Server read() Block until connection from client Process requests read() close() Information and Nework Security Data (reply) Endoffile notification write() read() close() 24 SSL Applications Simple Demo /*We can use SSL to build secure Internet application The purpose of this simple program is to show you how to connect to a secure website using SSL and Java Secure Socket Extension */ //TestSSL.java class public class TestS...

Textbooks related to the document above:
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Allan Hancock College - FIT - 3105
FIT3105 CryptobasedidentificationLecture6Outline Theimportanceofcryptobased identification. Secretkeycryptobasedidentification. Publickeycryptobasedidentification. Performanceofcryptobased identification. Challengesofcryptobasedidentification
Allan Hancock College - CPE - 5002
Cryptosystems, Hash Functions and Digital Signatures- Lecture 4 -OutlineWhy public key cryptography ? s General principles of public key cryptography s The RSA public key cryptosystem s One way hash functions s Digital signaturesInformation an
Allan Hancock College - FIT - 3105
Introduction to cryptography for authentication and identification systems- FIT3105 -Lecture 2 &amp; 3Outline Why study crypto-based authentication and identification systems? The importance of cryptography for authentication and identification The
Allan Hancock College - CPE - 5002
CPE5002/CSE5210 Advanced Network Security- Advanced Cryptography and Information Security-Lecture 12OutlinesBackground Group FieldsPrinciple of public key systems Discrete Logarithm Problem (DLP)sElliptic Curve Cryptography EC wit
Allan Hancock College - CPE - 5002
Email Security, Web Security and Malicious ProgramsLecture 9Email BasissEmail Infrastructure Allows a user to send a message to one or more recipients Using either single email address or a distribution list If a distribution list is used th
East Los Angeles College - NDOS - 0449
a t h o p BoneisNotJustMinerals h y s i o l o g y04/24/09 OSTEOPOROSIS 1PTheSecretsofitsStrengthBone:ItisaMixtureof ProteinsandMineralsP a t h o p h y s i o l o g y04/24/09TakeawallasanexampleYouneedcementto holdthestonestogether
Allan Hancock College - CPE - 5002
Introduction to AuthenticationLecture 7Forms of authenticationsBasic authentication Using passwordssAuthentication based on secret key Using private keys and Key distribution centresAuthentication based on public key Using public-key
Allan Hancock College - FIT - 3105
FIT3105 Strong authentication with kerberos and digital certificates Lecture 7Outline The reasons for strong authentication Basic authentication model Stronger authentication model Kerberos authentication model Authentication using digital ce
Allan Hancock College - FIT - 3105
Outline FIT3105 Crypto-based identificationLecture 6 The importance of crypto-based crypto-identification. Secret key crypto based identification. Public key crypto based identification. Performance of crypto-based cryptoidentification. Chal
Allan Hancock College - IMS - 2603
Tutorial Paper Reading: Week 9 Metadata Reading Title: &quot;The Semantic Web&quot; Authors: Tim Berners-Lee, James Hendler, Ora Lassila The Tim Berners-Lee, James Hendler and Ora Lassila's article, &quot;The Sematic Web&quot; discusses Berners-Lee's theory on the Seman
Allan Hancock College - IMS - 2603
The need of classificationClassification has delivered important meanings in our life. In general, the definition of classification simply means the grouping together of alike things according to common qualities or characteristics. Classification
Allan Hancock College - IMS - 2603
Issue Management: The need for it in organizations todayFirstly lets understand exactly what an issue is. In order to do that we need to take a step back. An issue can be absolutely anything that creates concern or influences a decision to be made.
Allan Hancock College - IMS - 2603
Reading IMS2603 Information Management in OrganisationsTag list: Bibliographic http:/www.itsmarc.com/crs/Bib1468.htm Library of Congress MARC Standards http:/www.loc.gov/marc/Lecture 17 MaRC as Metadatawww.sims.monash.edu.auwww.sims.monash.edu.
Allan Hancock College - IMS - 5401
IMS5401 Web-based Systems DevelopmentTopic 1: Introduction to Webbased Systemswww.monash.edu.auAgenda1. Unit administration 2. Introductions 3. Why study web-based systems? 4. The unit 5. Web evolution 6. Keeping it all in context: A cautionar
Allan Hancock College - IMS - 5048
IMS5048 Information Continuum Semester 2, 2005Tutorial 7 The following quotes are taken from an article by Keller et al which appeared in First Monday in 2003. They all relate to the role of libraries in an increasingly digital world that is current
Allan Hancock College - IMS - 5042
Ends and Means in Planning* By Edward C. Banfield * Reprinted from the International Social Science Journal Vol. XI, No.3, 1959, with the permission of UNESCO The word planning is given a bewildering variety of meanings. To some it means socialism. T
Allan Hancock College - IMS - 5042
Digitised by Monash University LibraryCOMMONWEALTH OF AUSTRALIACopyright Regulations 1969 WARNINGThis material has been reproduced and communicated to you by or on behalf of Monash University pursuant to Part VB of the Copyright Act 1968 (the Act
Allan Hancock College - IMS - 5042
Allan Hancock College - IMS - 5042
Allan Hancock College - IMS - 5042
Allan Hancock College - IMS - 5042
IMS5042 Information Systems Strategic PlanningWeek 7: Elements of IS planning Theory: 4. Business Process Re-engineeringCopyright 2002 Monash UniversityAgenda1. Introduction to BPR (Hammer version) 2. Doing BPR (Hammer version) 3. BPR after Ham
Allan Hancock College - IMS - 1001
IMS1001 Information Systems 1 CSE1204 Information Systems 1Communication and documentation: Oral communication PresentationsTypes of Oral CommunicationqPrepared speeches - planned prior to the event, tends to be highly structured (or should b
Allan Hancock College - IMS - 1907
IMS1907 Tutorial 3, Summer Semester, 2004/5IMS1907 Database Systems Tutorial 3 Database Systems Development MS Access Relationships, Joins and FormsTutorial Objectives At the end of this tutorials you should: understand the activities associa
Allan Hancock College - CSE - 1402
User Commands man(1)NNNNAAAAMMMMEEEE man - format and display the on-line manual pages manpath - determine user's search path for man pagesSSSSYYYYNNNNOOOOPPPPSSSSIIIISSSS man [-acd
Allan Hancock College - CSE - 1303
Abramson, Professor David 51183Abrantes, Ms Jo 59182Albrecht, Dr David 55526Allison, Dr Lloyd 55205Arnold, Mr David 55194Atkinson, Dr Peter 53243Arslanov, Dr Asat 5520
Allan Hancock College - CSE - 2307
31.1 0.0 0.01.0 2.01 0.0-4.5 2.2 24 .00009143 0.0 0.0 0.0 .8762 .00007156 0.0 0.0 .7943 .8143 .00009504 0.0 .8017 .6123 .7165 .000071234 0.0 .00009143 0.0 0.0 .00007156 .8762 0.0 0.0 .8143 .7943 .00009504 0.0 .6123 .8017 .7165 .0
Allan Hancock College - CSE - 1301
78901234 Edward Campbell 6767890123 Sophie Lee 7556789012 Jonathan O'Donnell 8034567899 Nathan Bird 8312345678 Debbie Sugarman 8545678901 Melanie Jones 8712345680 Ashley Judd 9034567890 David Jones 9323456789 Tim Smith 93
Allan Hancock College - CSE - 1301
34567899 Nathan Bird 8378901234 Edward Campbell 6734567890 David Jones 9345678901 Melanie Jones 8712345680 Ashley Judd 9067890123 Sophie Lee 7556789012 Jonathan O'Donnell 8023456789 Tim Smith 9312345678 Debbie Sugarman 85
Allan Hancock College - CSE - 1301
12345680 Ashley Judd 9034567890 David Jones 9312345678 Debbie Sugarman 8578901234 Edward Campbell 6756789012 Jonathan O'Donnell 8045678901 Melanie Jones 8734567899 Nathan Bird 8367890123 Sophie Lee 7523456789 Tim Smith 93
Allan Hancock College - TPRP - 2009509
Published in Gazette 5.2.2009 p 543South AustraliaTobacco Products Regulation (Exemption) Proclamation 2009under section 71 of the Tobacco Products Regulation Act 19971Short titleThis proclamation may be cited as the Tobacco Products Regulati
East Los Angeles College - ELEC - 3035
ELEC 3035, Lecture 8: Polynomial approach to pole placement Ivan Markovsky1. Review of the state space approach 2. Polynomial approach and the Diophantine equation 3. ExampleELEC 3035 (Part I, Lecture 8)Polynomial approach to pole placement1
East Los Angeles College - ELEC - 3035
ELEC 3035, Lecture 8: Polynomial approach to pole placement Ivan MarkovskyReview of the state space pole placement approach (A, B, C, D) (Ac , Bc , Cc , Dc )1. State feedback pole placement: compute the controller gain K 2. Pole placement observe
East Los Angeles College - ELEC - 3035
ELEC 3035: Tutorial on autonomous dynamical systemsLecturer: Ivan Markovsky1. Prediction using a model (a) State space approach Given a state space representation of a discrete-time autonomous system B(A,C) of order n and a nite, T n samples long
Allan Hancock College - CSE - 1303
Hash TablesCSE1303 Part A Data Structures and Algorithms2/7/02 CSE1303 Part A 1Overview Information Retrieval Review: Binary Search Trees Hashing. Applications. Example. Hash Functions.2/7/02CSE1303 Part A2Example: Bibliography R.
Allan Hancock College - CSE - 1303
CSE1303 Part A, Summer Semester, 2002Practical Session 5: Binary Search TreesSchool of Computer Science and Software Engineering Clayton Campus, Monash University CSE1303 Part A Summer Semester, 2002Practical Session 5: Binary Search TreesAim
Allan Hancock College - CSE - 1303
r A{Rd rAr{ r Arhrh r W g Wr r ~ (Eh WARo Wo m{9WAr hr{mr A{ RWA{ r2odA rRh hrAd r7 A hgo9#{r rA# H{ d hgo9#{r ~W r hhrmr Arh r rh rAhh{ Wrhr h{ A R r #hr Rr R m %
Allan Hancock College - CSE - 1303
Computer Science Monash UniversityCSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A13 Binary Search Trees (Information Retrieval)Kymberly FergussonOverview Binary Search Trees. Hash Tables.2Recall - Binary Searc
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Additional Explanations Lecture 7 - Nodes A node is simply like an element in an array, except it is created dynamically by the program as it is running (in the heap). It is a structure that contains da
Allan Hancock College - CSE - 1303
CSE1303 Lecture 51/2/03 10:41:08 AMComputer Science Monash UniversityCSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A6 Dynamic MemoryKymberly FergussonOverview Virtual Memory What is Dynamic Memory ? How to
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A2 Pointers (Revision)Kymberly FergussonOverview Revision of Pointers Pointers and structs Basic Pointer Arithmetic Pointers and Arrays2Pointer Operations Pointers
Allan Hancock College - CSE - 1303
Computer Science Monash UniversityOverview CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A11 RecursionKymberly Fergusson Unary Recursion Binary Recursion Examples Features Stacks Disadvantages Advantages2Wha
Allan Hancock College - CSE - 1303
Computer Science Monash UniversityCSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A15 Hash Tables: Collision ResolutionKymberly FergussonOverview Hash Tables Collisions Linear Probing Problems with Linear Probing
Allan Hancock College - CSE - 1303
Computer Science Monash UniversityCSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A12 Binary TreesKymberly FergussonOverview Trees. Terminology. Traversal of Binary Trees. Expression Trees. Binary Search Trees.
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A4 Basic Data Structures Continued (Queues)Kymberly FergussonBasic Data Structures Stacks Queues Lists2Overview What is a Queue? Queue Operations. Application
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A7 Nodes and Linked StructuresKymberly FergussonOverview of Topic Review List Implementations. Nodes. Linked Stacks. Linked Queues Linked Lists. Other List Operation
Allan Hancock College - CSE - 1303
Computer Science Monash UniversityCSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A5 Basic Data Structures Continued (Lists)Kymberly FergussonBasic Data TypesStackLast-In, First-Out (LIFO) initialize, push, pop, st
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A2 Pointers (Revision)Kymberly FergussonOverview Revision of Pointers Pointers and structs Basic Pointer Arithmetic Pointers and Arrays2Pointers A pointer is a da
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A9 Linked ListsKymberly FergussonOverview Operations for Lists. Implementation of Linked Lists. Double Linked Lists.2List Operations Go to a position in the l
Allan Hancock College - CSE - 1303
Introductionto computersystemsLectureB01LecturenotessectionB0124/04/09 CSE1303PartBlecturenotes 1Inthislecture Outlineofcourse Bits whatabitisandwhatitdoes Memory howbitsareusedtostoreinformation24/04/09CSE1303PartBlecturenotes2Ou
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A15 Hash Tables: Collision ResolutionKymberly FergussonOverview Hash Tables Collisions Linear Probing Problems with Linear Probing Chaining2Hashinghash table0 1
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A1 Welcome &amp; RevisionKymberly Fergusson1Overview Important Information. Overview of the course. Review.2Information Part A Lecture Notes. Available at Univers
Allan Hancock College - CSE - 1303
MattersofefficiencyLectureB16LecturenotessectionB1604/24/09 CSE1303PartBlecturenotes 1Lasttime Accessingfunctionparameters Returningfromfunctions Recursion04/24/09CSE1303PartBlecturenotes2Inthislecture Analysisoftranslation Writing
Allan Hancock College - CSE - 1303
Hardware ImplementationLectureB17LecturenotessectionB1704/24/09 CSE1303PartBlecturenotes 1Lasttime Analysisoftranslation WritingefficientC04/24/09CSE1303PartBlecturenotes2Inthislecture Gates Combinatoriallogic adder ALU Sequenti
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A17/18 RevisionKymberly FergussonLecture Overview Subject overview Topics covered this semester. Exam overview Types of questions found in Part A of the exam. Exam
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A8 Linked Stacks and Linked QueuesKymberly FergussonOverview Linked Stack. Push Pop Linked Queue. Append Serve2Linked StackTop of the StackNULL pointer3#i
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A14 Hash TablesKymberly FergussonOverview Information Retrieval Review: Binary Search Trees Hashing. Applications. Example. Hash Functions.2Example: Bibliography
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A16 Advanced SortingKymberly FergussonOverview Divide and Conquer Merge Sort Quick Sort2Divide and ConquerRecall: Binary SearchSearchSearchSearch3Divide a
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A6 Dynamic MemoryKymberly FergussonOverview Virtual Memory What is Dynamic Memory ? How to find the size of objects. Allocating memory. Deallocating memory.2Virtu
Allan Hancock College - CSE - 1303
SignedintegersLectureB03LecturenotessectionB0304/24/09 CSE1303PartBlecturenotes 1Lasttime Placevaluenumbersystems Bases binary(base2) hexadecimal(base16) octal(base8) Thinkinginbinary powersoftwo binary0to15 Converting fromandtobina
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Summer Semester 2003 Lecture A13 Binary Search Trees (Information Retrieval)Kymberly FergussonOverview Binary Search Trees. Hash Tables.2Recall - Binary Search TreeA Binary Tree such that: Eve
Allan Hancock College - CSE - 1303
CSE1303 Part A Data Structures and Algorithms Additional Explanations Lecture 7 - Nodes A node is simply like an element in an array, except it is created dynamically by the program as it is running (in the heap). It is a structure that contains da