Pre-exam 3 Review. Fall Paul Krzyzanowski Distributed Systems

Size: px
Start display at page:

Download "Pre-exam 3 Review. Fall Paul Krzyzanowski Distributed Systems"

Transcription

1 Pre-exam 3 Review Fall 2012

2 Questions from Exam 3 Fall 2011

3 Question 1 If Alice has Bob s digital certificate, how can she send a message securely to Bob? The certificate contains Bob s public key. Encrypt the message with Bob s public key and send it to Bob.

4 Question 2 Bob needs to authenticate Alice by validating that she has the right password. Without using encryption, how can Bob authenticate Alice on an insecure network? Since the network is insecure, sending a hash of the password is insufficient since the intruder would be able to capture and reuse this data? CHAP protocol. Bob sends Alice a nonce (bunch of bits). Alice generates a hash on a message containing the nonce and the password. Bob has the password and the nonce and can validate the hash.

5 Question 3 Explain the fundamental difference between network file systems (e.g., NFS, SMB) and cluster file systems employing a shared disk infrastructure. Note: these are the file systems we looked at when we discussed clusters and using shared disks. Network FS: file system based interaction Cluster FS: block-level interaction. Each node has the full implementation of the file system. Need to control mutual exclusion via a DLM (distributed lock manager).

6 Question 4 Explain the difference between BigTable s and Amazon Dynamo s presentation of versions to client processes. BigTable: Chronological version history store past n versions Dynamo: Stores out-of-sync versions on different nodes either causally ordered or concurrent updates. Application-based reconciliation.

7 Question 5 You have millions of files of user comments to various blog articles. Each file contains {original-article-id, this-article-id (ID of this response article), author-id (the author of the response), date, and message}. You want to create a list of authors with a per-author count of the number of unique articles that the author commented on. Explain how you use Map- Reduce to compute this. Specifically, explain what the map function does, what data the reduce gets, and what the reduce function does. (1) Map: parse out {author-id, original-article-id}. Write these pairs to the intermediate files. (2) Reduce gets: each call gets author ID and a list of all original-article-ids (3) Reduce does: (a) sort original article IDs, (b) remove duplicates, (b) generate a count of unique original article IDs, (c) output author-id & count.

8 Question 6 Which of the following is not a responsibility of a map worker in the MapReduce framework: (a) Generate (key, value) pairs. (b) Target (key, value) data for one of R reduce workers. (c) Partition original data into shards. (d) Discard data of no interest. The master (coordinator) assigns workload to the map workers. Map workers partition intermediate (key, value) pairs.

9 Question 7 BigTable data is: (a) Sorted by row keys. (b) Sorted by column keys. (c) Unsorted and assigned to a node by a hash function of the row key. (d) Unsorted and assigned to a node by a hash function of the row and column keys.

10 Question 8 BigTable does not use Chubby to: (a) Discover tablet servers. (b) Store BigTable schema information. (c) Ensure there is only one master server running. (d) Forward client requests to the proper tablet server.

11 Question 9 Which of the following is not a property of Chubby? (a) A distributed lock service that manages leases for resources. (b) Uses active replication for fault tolerance. (c) Uses Paxos to ensure consistency among servers. (d) Uses load balancing across all replicas to respond to multiple client requests

12 Question 10 Which of the following does not help with key explosion? (a) Public key cryptography. (b) Symmetric cryptography. (c) Diffie-Hellman algorithm. (d) Trusted third party.

13 Question 11 If it takes you one minute to test all combinations of a 32-bit key, approximately how long will it take you to test all combinations of a 64- bit key? (a) 2 minutes. (b) 8 minutes. (c) 32 minutes. (d) 4 billion minutes 2 32 times more = 2 32 * 1 minute = 4,294,967,296 minutes

14 Question 12 The Diffie-Hellman algorithm is useful for: (a) Establishing a common key. (b) Encrypting data. (c) Signing data. (d) All of the above.

15 Question 13 An X.509 digital certificate stores the certificate owner s: (a) Public key. (b) Private key. (c) Public, private key pair. (d) Digital signature. It contains the certificate issuer s signature.

16 Question 14 What is inside a Kerberos sealed envelope (ticket)? (a) The session key. (b) A challenge message. (c) The requestor s digital certificate. (d) A handle to a Kerberos authentication structure within the Kerberos authentication server.

17 Question 15 CAPTCHA (Completely Automated Public Turing Test to tell Computers and Humans Apart) relies on: (a) A user answering a series of questions correctly. (b) A user knowing one of several shared secrets. (c) An inability to develop good character recognition algorithms. (d) Detecting varying degrees of randomness in responses to challenges.

18 Question 16 A user s OpenID Identity Provider is: (a) Selected explicitly by the user during the authentication process. (b) Located by contacting an OpenID registry. (c) Stored with the user s preference on each site on which the user has an account. (d) Identified in the user s login name. The login name is in the form pxk.pip.verisignlabs.com The provider is pip.verisignlabs.com

19 Question 17 Which protocol does is not suited for authenticating a user on an insecure network? (a) PAP (Password Authentication Protocol). (b) CHAP (Challenge Handshake Authentication Protocol). (c) S/Key. (d) Public key authentication.

20 Question 18 A hybrid cryptosystem is one where: (a) A private key is used for key exchange and a public key is used for data encryption. (b) A public key algorithm is used for key exchange and a symmetric algorithm for data encryption. (c) Two layers of encryption are used on the data for greater security. (d) Data flowing from the client to the server is encrypted with a different algorithm than data from the client to the server.

21 Question 19 An OAuth request token is: (a) Created by the service provider to provide the consumer site with a list of services that it offers. (b) Created by the user in order to authenticate with the consumer (client). (c) Sent by a consumer site to invoke services on a remote service (provider). [an access token is used for this] (d) Used by a consumer site to identify what access is being requested from a provider.

22 Question 20 The main design goal of Google Cluster Architecture was: (a) Maximize processor performance to achieve high performance computing. (b) Be efficient in terms of energy consumption and hardware costs. (c) Create virtual clusters from a set of machines dedicated to a specific set of tasks. (d) Maximize fault tolerance to ensure reliable service

23 Question 21 At least how much physical redundancy is required for a system to be k-fault tolerant against Byzantine faults? (a) k components. (b) 2k components. (c) k+1 components. (d) 2k+1 components. (k+1) good components to overrule k failed components. Total = 2k+1.

24 Question What are the minimum screening router capabilities that are needed to disallow any access from the outside network to the FTP service on one of your machines? (a) Stateless inspection. (b) Stateful inspection. (c) Deep packet inspection. (d) Application proxy.

25 Question 23 What are the minimum screening router capabilities that are needed to ensure that HTTP requests with headers containing binary data are dropped? (a) Stateless inspection. (b) Stateful inspection. (c) Deep packet inspection. (d) Application proxy.

26 Question 24 A web server should be placed in the: (a) External network (Internet). (b) DMZ (perimeter) network. (c) Internal network. (d) Private network.

27 Question 25 A dual-homed host is a machine that: (a) Migrates between two locations, such as work and home. (b) Runs at least two virtual machines. (c) Has at least two user accounts. (d) Has two network connections and two IP addresses

28 Question 26 TCP/IP achieves fault tolerance via: (a) Time redundancy. (b) Information redundancy. (c) Physical redundancy. (d) It does not aim to achieve fault tolerance

29 Question 27 Cascading failover is the case when: (a) One failure triggers another failure. (b) An application can start from a checkpointed state. [warm restart] (c) A failover machine fails. (d) Workload on a failed machine needs to be split among several surviving nodes. [multidirectional failover]

30 Question 28 A system-area network such as Myrinet or Infiniband is favored for high performance clustering because it: (a) Has lower latency than using IP-based protocols over Ethernet. (b) Is a high bandwidth interconnect. (c) Is designed to be highly reliable. (d) All of the above. If you are not sure about (c), but know (a) and (b) must be true, that will steer you to (d).

31 Question 29 Unlike regular hashing, consistent hashing is a hashing technique that: (a) Always generates the same value when given the same input data. (b) Generates a fixed-length result. (c) Does not cause hash values for most keys to change if the number of slots changes. (d) Allows one to retrieve the original data by applying an inverse hash function.

32 Question A hash function is a form of a one-way function. [True] [False] 31. For Alice to log in using S/Key authentication, she needs to be able to compute a one-way function to generate the next valid password. [True] [False] S/Key uses one-way functions to compute the list of one-time passwords that are then given to the user. The user never has to compute anything. 32. The OpenID protocol designates the use of public key cryptography for user authentication. [True] [False] OpenID does not define the use of any specific user authentication protocol that s up to the implementation.

33 Question The goal of OAuth is to allow users to grant web sites restricted access to other web services. [True] [False] 34. A weakness in CHAP authentication is that if an intruder sees both the challenge and the response, it is easy to figure out the shared secret. [True] [False] No. An intruder will see the challenge and the response but the response is a one way function (e.g., hash) of the challenge and secret. Knowing the response does not enable one to compute the inverse function and find the secret. 35. RSA s SecurID is a challenge-response authentication system. [True] [False] No. There is no challenge issued to the user. It s a one-time password system that generates a time-varying password that is a function of the user s PIN, time of day, and shared secret (stored on the card and on the server).

34 Question BigTable uses a coordinator; Dynamo does not. [True] [False] 37. BigTable replicas are eventually consistent; Dynamo replicas are strictly consistent. [True] [False] OpenID does not define the use of any specific user authentication protocol that s up to the implementation. 38. OAuth does everything OpenID does and more. [True] [False] OAuth is designed for decentralized authorization (allowing or denying access to web services). OpenID is designed as a service for decentralized authentication (having a user prove his/her identity). OpenID gives you one login for multiple web sites. OAuth lets you allow one website to access data from another site.

35 Question A heartbeat network is useful for distinguishing failed machines versus failed networks. [True] [False] 40. A shared-nothing cluster architecture does not need a distributed lock manager (DLM). [True] [False]

36 Exam 3 Spring 2009 Question 1 What are the three factors of authentication? 1. Something you know (e.g., password) 2. Something you have (e.g., access card, key) 3. Something you are (e.g., fingerprint)

37 Exam 3 Spring 2009 Question 2 When you request a service via Kerberos, you are presented with a ticket. What does this ticket contain and how is it used? The ticket contains the session key that you will use for communicating with the service but it is encrypted with the service s secret key so you can t see it. You pass it to the service. Because the service can decrypt the ticket, it knows that Kerberos (a trusted party) must have created it.

38 Exam 3 Spring 2009 Question 3 How would you check that a digital certificate is valid? Specifically, explain how you ensure that it (a) has not been modified and (b) is really issued by the party that claims to have created it? a) The certificate is signed. To check that it has not been modified, generate a hash of all the data in the certificate except the signature. Decrypt the signature using the provider s public key. If the decrypted signature matches your hash then the data has not been modified b) The certificate really is issued by the provider if part (a) worked because decrypting the signature with the provider s public key worked it means the provider s private key was used to encrypt the hash. To really ensure it s validity, you need to have the provider s public key in a certificate from a trusted source.

39 Exam 3 Spring 2009 Question 5 Is the following statement true or false? Explain and defend your position. Application proxies were once useful but have been rendered obsolete with the introduction of SPI (stateful packet inspection) firewalls as successors to packet filters. False. Packet filters and application proxies serve two different purposes. Packet filters do NOT validate the application protocol. For example, a packet filter can disallow all HTTP traffic to a set of machines (drop packets going to port 80). It cannot discover that the request contains a mangled URL that is an attempt to exploit a security hole or that an message contains a virus. BTW, What SPI adds to simple packet inspection is the ability to track state for example, knowing that a TCP connection has been established or allowing certain ports to be accepted because a connection has been established on other ports.

40 Exam 3 Spring 2009 Question 8 Define each of the following terms. 8. DMZ The Demilitarized Zone is a subnet that exposes services to the internet. It is separate from the internal local area network and can communicate with both the Internet and internal network.

41 Exam 3 Spring 2009 Questions 9-10 Define each of the following terms. 9. Tunnel Refers to encapsulating an entire packet as data (payload) inside another packet. Most often used in a VPN to get Intranet packets from one LAN to another over a public network the entire IP packet is sent as data via an IP packet over the Internet. This way, local addressing can still be used within those packets and each machine does not have to be uniquely addressable on the Internet. 10. Heartbeat Network Software and/or hardware mechanisms designed to allow machines to test (ping) other machines periodically to ensure that they are up and functioning

42 Exam 3 Spring 2009 Questions Define each of the following terms. 11. Warm failover An application restart where the restarted application resumes from a previous checkpoint instead of starting from the beginning. 12. Distributed Lock Manager (DLM) In clustering, mutual exclusion control to allow multiple machines to coordinate access to a single shared disk. 13. Cascading failover The case where an application failed-over (was restarted) to another machine but then had to fail over to yet another system because that machine died.

43 Exam 3 Fall 2006: Question 4 The Diffie-Hellman algorithm is not an encryption algorithm. What is it good for? It allows two parties to establish a common key that no other two parties can compute.

44 Spring 2007: Question 1 (a) How is a nonce used for authentication in publickey cryptography? Give a simple example of Alice authenticating Bob. The idea is: Prove that the other person has the private key. Alice: generate nonce. send it to Bob. Bob: receive nonce; encrypt with his private key. send encrypted result back to Alice. Alice: receive message from Bob. decrypt with Bob s public key. If decryption matches the nonce, Bob has the private key.

45 Spring 2007: Question 1 (b) How is a nonce used for authentication in symmetric cryptography? Give a simple example of Alice authenticating Bob. Prove that the other person has the shared key. Alice: generate nonce. send it to Bob. Bob: receive nonce; encrypt with the key. send encrypted result back to Alice. Alice: receive message from Bob. decrypt with the key. If decryption matches the nonce, Bob also has the key.

46 Spring 2007: Question 2 What is the purpose of a ticket (sealed envelope) in Kerberos? To send the session key securely to the other party.

47 Spring 2007: Question 3 How do you use an X.509 digital certificate to validate signed software? Hash the code H(M) Decrypt the signature with the public key in the certificate D K (E k [H(M)]) = H(M) where D K : decrypt with symmetric key K E k : encrypt with private key k Compare the decrypted signature with the hash If match we re convinced the code has not been modified. Code (M) Signature = E k [H(M)] Certificate (K, )

48 Spring 2007: Question 4 Northrup-Grumman developed a mobile electronic fingerprinting system for use by the UK police. A search of 6.6 million prints takes under five minutes. An index into a database of 6.6 million records generally takes only a few milliseconds. Why does the fingerprint search take so long? Fingerprint lookups would have to use statistical pattern matching - not a direct index. There s no unique number that s obtained from the biometric that you can index.

49 Fall 2007: Question 4 When you set up an environment with a DMZ, identify which classes of machines belong in the following networks? Any Internet-accessible servers will live in the DMZ. Any internal systems will be in the internal network. No machines will be directly on the internet. Type of machine Directly on Internet DMZ network Internal network Application proxies X Servers with no associated application proxies X Servers with associated application proxies X Generic user machines X

50 Spring #1 Explain how you use hash functions and public key cryptography to generate a digital signature for a document. Generate a hash of a message. Encrypt it with your private key.

51 Spring #2 You need to create a system where you need to validate a user s password. How can you create a publicly-readable password file? Software that verifies a password cannot employ any keys in validating a password against data in the file. Explain what is contained in the file and how the software validates the password. (Think about McCarthy s puzzle.) This is McCarthy s puzzle and is the way password files on Unix systems work. Instead of storing a password, the result of a one-way-function (e.g., a hash) on the password is stored. The publicly-readable password file contains a set of tuples: (user name, one-way-function-of-password). When a user enters a login name and password, the system will apply the one-way function on the password and compare it with the one in the file.

52 Fall #1d (slightly modified) How does a man-in-the-middle attack work? The man-in-the-middle masquerades as the server to the client. The client sends authentication credentials to the Man in the Middle, who forwards them to the real server. Once the server authenticates the user, the Man in the Middle can use the connection. K M K A E M (S) E S (msg) MitM E A (S) E S (msg)

53 Fall #2a When does it make sense to encrypt something with a public key? For covert communication. Only the holder of the corresponding private key can read it.

54 Fall #2b When does it make sense to encrypt something with a private key? As a signature. Anyone can decrypt the message with the corresponding public key but they know the message must have been created by the owner of the key.

55 Fall #4 Explain the term demilitarized zone (DMZ) in network design. What kind of machines go into a DMZ? A screened (protected) subnet between the outside network (Internet) and the inside network. Machines offering services on the Internet.

56 Spring 2004 #1 What is a digital certificate? It s a signed public key. More precisely, it s some data (your name, address, and/or other information) and your public key. The entire message is signed by a trusted certification authority (CA). If you have the CA s public key, you can verify the signature.

57 Spring 2004 #1b Give an example of how you can authenticate someone with a digital certificate? Suppose you have Alice s certificate. How do you authenticate Alice? The certificate is just a public key. Once you ve validated its signature (convincing yourself it s not forged), you just need to prove the other party has the corresponding private key. Send Alice a nonce (a random number) and ask her to encrypt it with her private key. If you can decrypt what she sends back using the public key in her certificate, then you re convinced that she really does have the corresponding private key.

58 Spring 2004 #2 Why can t you copy a digital signature from one document and attach it to another? A digital signature is a hash of the message (document) that is encrypted with the signer s private key. You cannot regenerate the signature using the hash of the new document because you need the signer s private key for that. If you can find/create another document that has the exact same hash then the signatures will be the same. This should be practically impossible for a good hash function.

59 Spring 2004 #3a What is a session key? A session key is a throw-away key - a key that is created for a communication session and discarded after the session. For symmetric algorithms, the key is just a random number.

60 Spring 2004 #3b How is it created, shared, and used in a hybrid cryptosystem? It is created by picking a random number. It is shared by encrypting it with the recipient s public key. Only the recipient will be able to decrypt it with the corresponding private key. Once both sides have it, then all encryption is performed using the session key and a symmetric algorithm.

61 Spring 2004 #4 Prove that a hash can never be collision-free for an arbitrary set of inputs. A hash is a fixed-length quantity, n bits long. This means that it can uniquely identify any one of 2 n values. If you hash 2 n +1 inputs, at least one of them will have to result in a duplicate value.

62 Spring 2004 #6 What is a network tunnel? It s the encapsulation of a network messages within another network message. It s the underlying component of a virtual private network (VPN) and allows you to send all packets destined to the remote subnet to one IP address (the external address of the remote router). The router will then extract the enveloped packets and route them on the internal network.

63 Fall 2005 #4 What problem were digital certificates created to solve? To allow people to pass public keys around that could be authenticated.

64 The End

Distributed Systems Exam 3 Review. Paul Krzyzanowski. Rutgers University. Fall 2016

Distributed Systems Exam 3 Review. Paul Krzyzanowski. Rutgers University. Fall 2016 Distributed Systems 2015 Exam 3 Review Paul Krzyzanowski Rutgers University Fall 2016 2013-2016 Paul Krzyzanowski 1 2015 Question 1 What information does each node need to store for a three-dimensional

More information

CS /29/17. Paul Krzyzanowski 1. Fall 2016: Question 2. Distributed Systems. Fall 2016: Question 2 (cont.) Fall 2016: Question 3

CS /29/17. Paul Krzyzanowski 1. Fall 2016: Question 2. Distributed Systems. Fall 2016: Question 2 (cont.) Fall 2016: Question 3 Fall 2016: Question 2 You have access to a file of class enrollment lists. Each line contains {course_number, student_id}. Distributed Systems 2017 Pre-exam 3 review Selected questions from past exams

More information

Distributed Systems. Fall 2017 Exam 3 Review. Paul Krzyzanowski. Rutgers University. Fall 2017

Distributed Systems. Fall 2017 Exam 3 Review. Paul Krzyzanowski. Rutgers University. Fall 2017 Distributed Systems Fall 2017 Exam 3 Review Paul Krzyzanowski Rutgers University Fall 2017 December 11, 2017 CS 417 2017 Paul Krzyzanowski 1 Question 1 The core task of the user s map function within a

More information

Distributed Systems. 25. Authentication Paul Krzyzanowski. Rutgers University. Fall 2018

Distributed Systems. 25. Authentication Paul Krzyzanowski. Rutgers University. Fall 2018 Distributed Systems 25. Authentication Paul Krzyzanowski Rutgers University Fall 2018 2018 Paul Krzyzanowski 1 Authentication For a user (or process): Establish & verify identity Then decide whether to

More information

CS November 2018

CS November 2018 Authentication Distributed Systems 25. Authentication For a user (or process): Establish & verify identity Then decide whether to allow access to resources (= authorization) Paul Krzyzanowski Rutgers University

More information

Operating Systems Design Exam 3 Review: Spring Paul Krzyzanowski

Operating Systems Design Exam 3 Review: Spring Paul Krzyzanowski Operating Systems Design Exam 3 Review: Spring 2012 Paul Krzyzanowski pxk@cs.rutgers.edu 1 Question 1 An Ethernet device driver implements the: (a) Data Link layer. (b) Network layer. (c) Transport layer.

More information

Operating Systems Design Exam 3 Review: Spring 2011

Operating Systems Design Exam 3 Review: Spring 2011 Operating Systems Design Exam 3 Review: Spring 2011 Paul Krzyzanowski pxk@cs.rutgers.edu 1 1. Why does an IP driver need to use ARP, the address resolution protocol? IP is a logical network. An IP address

More information

Operating Systems. Week 13 Recitation: Exam 3 Preview Review of Exam 3, Spring Paul Krzyzanowski. Rutgers University.

Operating Systems. Week 13 Recitation: Exam 3 Preview Review of Exam 3, Spring Paul Krzyzanowski. Rutgers University. Operating Systems Week 13 Recitation: Exam 3 Preview Review of Exam 3, Spring 2014 Paul Krzyzanowski Rutgers University Spring 2015 April 22, 2015 2015 Paul Krzyzanowski 1 Question 1 A weakness of using

More information

CS 416: Operating Systems Design April 22, 2015

CS 416: Operating Systems Design April 22, 2015 Question 1 A weakness of using NAND flash memory for use as a file system is: (a) Stored data wears out over time, requiring periodic refreshing. Operating Systems Week 13 Recitation: Exam 3 Preview Review

More information

Security: Focus of Control. Authentication

Security: Focus of Control. Authentication Security: Focus of Control Three approaches for protection against security threats a) Protection against invalid operations b) Protection against unauthorized invocations c) Protection against unauthorized

More information

Security: Focus of Control

Security: Focus of Control Security: Focus of Control Three approaches for protection against security threats a) Protection against invalid operations b) Protection against unauthorized invocations c) Protection against unauthorized

More information

CS /29/18. Paul Krzyzanowski 1. Question 1 (Bigtable) Distributed Systems 2018 Pre-exam 3 review Selected questions from past exams

CS /29/18. Paul Krzyzanowski 1. Question 1 (Bigtable) Distributed Systems 2018 Pre-exam 3 review Selected questions from past exams Question 1 (Bigtable) What is an SSTable in Bigtable? Distributed Systems 2018 Pre-exam 3 review Selected questions from past exams It is the internal file format used to store Bigtable data. It maps keys

More information

Computer Security. 08r. Pre-exam 2 Last-minute Review Cryptography. Paul Krzyzanowski. Rutgers University. Spring 2018

Computer Security. 08r. Pre-exam 2 Last-minute Review Cryptography. Paul Krzyzanowski. Rutgers University. Spring 2018 Computer Security 08r. Pre-exam 2 Last-minute Review Cryptography Paul Krzyzanowski Rutgers University Spring 2018 March 26, 2018 CS 419 2018 Paul Krzyzanowski 1 Cryptographic Systems March 26, 2018 CS

More information

Distributed Systems Pre-exam 3 review Selected questions from past exams. David Domingo Paul Krzyzanowski Rutgers University Fall 2018

Distributed Systems Pre-exam 3 review Selected questions from past exams. David Domingo Paul Krzyzanowski Rutgers University Fall 2018 Distributed Systems 2018 Pre-exam 3 review Selected questions from past exams David Domingo Paul Krzyzanowski Rutgers University Fall 2018 November 28, 2018 1 Question 1 (Bigtable) What is an SSTable in

More information

CS Computer Networks 1: Authentication

CS Computer Networks 1: Authentication CS 3251- Computer Networks 1: Authentication Professor Patrick Traynor 4/14/11 Lecture 25 Announcements Homework 3 is due next class. Submit via T-Square or in person. Project 3 has been graded. Scores

More information

(2½ hours) Total Marks: 75

(2½ hours) Total Marks: 75 (2½ hours) Total Marks: 75 N. B.: (1) All questions are compulsory. (2) Makesuitable assumptions wherever necessary and state the assumptions made. (3) Answers to the same question must be written together.

More information

Distributed Systems. 26. Cryptographic Systems: An Introduction. Paul Krzyzanowski. Rutgers University. Fall 2015

Distributed Systems. 26. Cryptographic Systems: An Introduction. Paul Krzyzanowski. Rutgers University. Fall 2015 Distributed Systems 26. Cryptographic Systems: An Introduction Paul Krzyzanowski Rutgers University Fall 2015 1 Cryptography Security Cryptography may be a component of a secure system Adding cryptography

More information

Issues. Separation of. Distributed system security. Security services. Security policies. Security mechanism

Issues. Separation of. Distributed system security. Security services. Security policies. Security mechanism Module 9 - Security Issues Separation of Security policies Precise definition of which entities in the system can take what actions Security mechanism Means of enforcing that policy Distributed system

More information

Lecture 33. Firewalls. Firewall Locations in the Network. Castle and Moat Analogy. Firewall Types. Firewall: Illustration. Security April 15, 2005

Lecture 33. Firewalls. Firewall Locations in the Network. Castle and Moat Analogy. Firewall Types. Firewall: Illustration. Security April 15, 2005 Firewalls Lecture 33 Security April 15, 2005 Idea: separate local network from the Internet Trusted hosts and networks Intranet Firewall DMZ Router Demilitarized Zone: publicly accessible servers and networks

More information

Computer Networks. Wenzhong Li. Nanjing University

Computer Networks. Wenzhong Li. Nanjing University Computer Networks Wenzhong Li Nanjing University 1 Chapter 7. Network Security Network Attacks Cryptographic Technologies Message Integrity and Authentication Key Distribution Firewalls Transport Layer

More information

Computer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ

Computer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ Computer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ Chapter 8 Network Security Computer Networking: A Top Down Approach, 5 th edition. Jim Kurose, Keith Ross Addison-Wesley, April 2009.

More information

Indicate whether the statement is true or false.

Indicate whether the statement is true or false. Indicate whether the statement is true or false. 1. Packet-filtering firewalls scan network data packets looking for compliance with the rules of the firewall s database or violations of those rules. 2.

More information

Chapter 9: Key Management

Chapter 9: Key Management Chapter 9: Key Management Session and Interchange Keys Key Exchange Cryptographic Key Infrastructure Storing and Revoking Keys Digital Signatures Slide #9-1 Overview Key exchange Session vs. interchange

More information

L13. Reviews. Rocky K. C. Chang, April 10, 2015

L13. Reviews. Rocky K. C. Chang, April 10, 2015 L13. Reviews Rocky K. C. Chang, April 10, 2015 1 Foci of this course Understand the 3 fundamental cryptographic functions and how they are used in network security. Understand the main elements in securing

More information

Fundamentals of Network Security v1.1 Scope and Sequence

Fundamentals of Network Security v1.1 Scope and Sequence Fundamentals of Network Security v1.1 Scope and Sequence Last Updated: September 9, 2003 This document is exclusive property of Cisco Systems, Inc. Permission is granted to print and copy this document

More information

CSC/ECE 774 Advanced Network Security

CSC/ECE 774 Advanced Network Security Computer Science CSC/ECE 774 Advanced Network Security Topic 2. Network Security Primitives CSC/ECE 774 Dr. Peng Ning 1 Outline Absolute basics Encryption/Decryption; Digital signatures; D-H key exchange;

More information

Computer Security. 08. Authentication. Paul Krzyzanowski. Rutgers University. Spring 2018

Computer Security. 08. Authentication. Paul Krzyzanowski. Rutgers University. Spring 2018 Computer Security 08. Authentication Paul Krzyzanowski Rutgers University Spring 2018 1 Authentication Identification: who are you? Authentication: prove it Authorization: you can do it Protocols such

More information

CPSC 467b: Cryptography and Computer Security

CPSC 467b: Cryptography and Computer Security CPSC 467b: Cryptography and Computer Security Michael J. Fischer Lecture 24 April 16, 2012 CPSC 467b, Lecture 24 1/33 Kerberos Secure Shell (SSH) Transport Layer Security (TLS) Digital Rights Management

More information

Firewalls Network Security: Firewalls and Virtual Private Networks CS 239 Computer Software March 3, 2003

Firewalls Network Security: Firewalls and Virtual Private Networks CS 239 Computer Software March 3, 2003 Firewalls Network Security: Firewalls and Virtual Private Networks CS 239 Computer Software March 3, 2003 A system or combination of systems that enforces a boundary between two or more networks - NCSA

More information

Lecture 9a: Secure Sockets Layer (SSL) March, 2004

Lecture 9a: Secure Sockets Layer (SSL) March, 2004 Internet and Intranet Protocols and Applications Lecture 9a: Secure Sockets Layer (SSL) March, 2004 Arthur Goldberg Computer Science Department New York University artg@cs.nyu.edu Security Achieved by

More information

Computer Security. 10. Exam 2 Review. Paul Krzyzanowski. Rutgers University. Spring 2017

Computer Security. 10. Exam 2 Review. Paul Krzyzanowski. Rutgers University. Spring 2017 Computer Security 10. Exam 2 Review Paul Krzyzanowski Rutgers University Spring 2017 March 23, 2018 CS 419 2017 Paul Krzyzanowski 1 Question 1(a) Suppose you come across some old text in the form GEPPQ

More information

Int ernet w orking. Internet Security. Literature: Forouzan: TCP/IP Protocol Suite : Ch 28

Int ernet w orking. Internet Security. Literature: Forouzan: TCP/IP Protocol Suite : Ch 28 Int ernet w orking Internet Security Literature: Forouzan: TCP/IP Protocol Suite : Ch 28 Internet Security Internet security is difficult Internet protocols were not originally designed for security The

More information

Computer Security 4/12/19

Computer Security 4/12/19 Authentication Computer Security 09. Authentication Identification: who are you? Authentication: prove it Authorization: you can do it Paul Krzyzanowski Protocols such as Kerberos combine all three Rutgers

More information

CTS2134 Introduction to Networking. Module 08: Network Security

CTS2134 Introduction to Networking. Module 08: Network Security CTS2134 Introduction to Networking Module 08: Network Security Denial of Service (DoS) DoS (Denial of Service) attack impacts system availability by flooding the target system with traffic or by exploiting

More information

Cryptographic Checksums

Cryptographic Checksums Cryptographic Checksums Mathematical function to generate a set of k bits from a set of n bits (where k n). k is smaller then n except in unusual circumstances Example: ASCII parity bit ASCII has 7 bits;

More information

User Authentication. Modified By: Dr. Ramzi Saifan

User Authentication. Modified By: Dr. Ramzi Saifan User Authentication Modified By: Dr. Ramzi Saifan Authentication Verifying the identity of another entity Computer authenticating to another computer Person authenticating to a local/remote computer Important

More information

Cryptography and Network Security Chapter 14

Cryptography and Network Security Chapter 14 Cryptography and Network Security Chapter 14 Fifth Edition by William Stallings Lecture slides by Lawrie Brown Chapter 14 Key Management and Distribution No Singhalese, whether man or woman, would venture

More information

Data Communication Prof.A.Pal Dept of Computer Science & Engineering Indian Institute of Technology, Kharagpur Lecture - 40 Secured Communication - II

Data Communication Prof.A.Pal Dept of Computer Science & Engineering Indian Institute of Technology, Kharagpur Lecture - 40 Secured Communication - II Data Communication Prof.A.Pal Dept of Computer Science & Engineering Indian Institute of Technology, Kharagpur Lecture - 40 Secured Communication - II Hello and welcome to today's lecture on secured communication.

More information

0/41. Alice Who? Authentication Protocols. Andreas Zeller/Stephan Neuhaus. Lehrstuhl Softwaretechnik Universität des Saarlandes, Saarbrücken

0/41. Alice Who? Authentication Protocols. Andreas Zeller/Stephan Neuhaus. Lehrstuhl Softwaretechnik Universität des Saarlandes, Saarbrücken 0/41 Alice Who? Authentication Protocols Andreas Zeller/Stephan Neuhaus Lehrstuhl Softwaretechnik Universität des Saarlandes, Saarbrücken The Menu 1/41 Simple Authentication Protocols The Menu 1/41 Simple

More information

Computer Security 3/20/18

Computer Security 3/20/18 Authentication Identification: who are you? Authentication: prove it Computer Security 08. Authentication Authorization: you can do it Protocols such as Kerberos combine all three Paul Krzyzanowski Rutgers

More information

Encryption. INST 346, Section 0201 April 3, 2018

Encryption. INST 346, Section 0201 April 3, 2018 Encryption INST 346, Section 0201 April 3, 2018 Goals for Today Symmetric Key Encryption Public Key Encryption Certificate Authorities Secure Sockets Layer Simple encryption scheme substitution cipher:

More information

CSC 774 Network Security

CSC 774 Network Security CSC 774 Network Security Topic 2. Review of Cryptographic Techniques CSC 774 Dr. Peng Ning 1 Outline Encryption/Decryption Digital signatures Hash functions Pseudo random functions Key exchange/agreement/distribution

More information

Spring 2010: CS419 Computer Security

Spring 2010: CS419 Computer Security Spring 2010: CS419 Computer Security Vinod Ganapathy Lecture 7 Topic: Key exchange protocols Material: Class handout (lecture7_handout.pdf) Chapter 2 in Anderson's book. Today s agenda Key exchange basics

More information

Lecture 30. Cryptography. Symmetric Key Cryptography. Key Exchange. Advanced Encryption Standard (AES) DES. Security April 11, 2005

Lecture 30. Cryptography. Symmetric Key Cryptography. Key Exchange. Advanced Encryption Standard (AES) DES. Security April 11, 2005 Lecture 30 Security April 11, 2005 Cryptography K A ciphertext Figure 7.3 goes here K B symmetric-key crypto: sender, receiver keys identical public-key crypto: encrypt key public, decrypt key secret Symmetric

More information

Radius, LDAP, Radius, Kerberos used in Authenticating Users

Radius, LDAP, Radius, Kerberos used in Authenticating Users CSCD 303 Lecture 5 Fall 2018 Radius, LDAP, Radius, Kerberos used in Authenticating Users Kerberos Authentication and Authorization Previously Said that identification, authentication and authorization

More information

Security & Privacy. Web Architecture and Information Management [./] Spring 2009 INFO (CCN 42509) Contents. Erik Wilde, UC Berkeley School of

Security & Privacy. Web Architecture and Information Management [./] Spring 2009 INFO (CCN 42509) Contents. Erik Wilde, UC Berkeley School of Contents Security & Privacy Contents Web Architecture and Information Management [./] Spring 2009 INFO 190-02 (CCN 42509) Erik Wilde, UC Berkeley School of Information Abstract 1 Security Concepts Identification

More information

Kurose & Ross, Chapters (5 th ed.)

Kurose & Ross, Chapters (5 th ed.) Kurose & Ross, Chapters 8.2-8.3 (5 th ed.) Slides adapted from: J. Kurose & K. Ross \ Computer Networking: A Top Down Approach (5 th ed.) Addison-Wesley, April 2009. Copyright 1996-2010, J.F Kurose and

More information

Firewalls, Tunnels, and Network Intrusion Detection

Firewalls, Tunnels, and Network Intrusion Detection Firewalls, Tunnels, and Network Intrusion Detection 1 Firewalls A firewall is an integrated collection of security measures designed to prevent unauthorized electronic access to a networked computer system.

More information

Network Security and Cryptography. December Sample Exam Marking Scheme

Network Security and Cryptography. December Sample Exam Marking Scheme Network Security and Cryptography December 2015 Sample Exam Marking Scheme This marking scheme has been prepared as a guide only to markers. This is not a set of model answers, or the exclusive answers

More information

AIT 682: Network and Systems Security

AIT 682: Network and Systems Security AIT 682: Network and Systems Security Final Exam Review Instructor: Dr. Kun Sun Topics covered by Final Topic before Midterm 10% Topic after Midterm 90% Date: 12/13/2017 7:30am 10:15am Place: the same

More information

CSE 565 Computer Security Fall 2018

CSE 565 Computer Security Fall 2018 CSE 565 Computer Security Fall 2018 Lecture 20: Intrusion Prevention Department of Computer Science and Engineering University at Buffalo 1 Lecture Overview Firewalls purpose types locations Network perimeter

More information

Message authentication. Why message authentication. Authentication primitives. and secure hashing. To prevent against:

Message authentication. Why message authentication. Authentication primitives. and secure hashing. To prevent against: Message authentication and secure hashing Why message authentication To prevent against: Masquerade/impersonation Modification of message content Modification of message sequence Acceptance of replayed/delayed

More information

Security issues: Encryption algorithms. Threats Methods of attack. Secret-key Public-key Hybrid protocols. CS550: Distributed OS.

Security issues: Encryption algorithms. Threats Methods of attack. Secret-key Public-key Hybrid protocols. CS550: Distributed OS. Security issues: Threats Methods of attack Encryption algorithms Secret-key Public-key Hybrid protocols Lecture 15 Page 2 1965-75 1975-89 1990-99 Current Platforms Multi-user timesharing computers Distributed

More information

4.1 DESIGN ISSUES OF TRANSPORT LAYER 4.2 DESIGN ISSUES OF SESSION LAYER 4.3 DESIFN ISSUES OF PRESENTATION LAYER 4.5 TCP WINDOW MANAGEMENT

4.1 DESIGN ISSUES OF TRANSPORT LAYER 4.2 DESIGN ISSUES OF SESSION LAYER 4.3 DESIFN ISSUES OF PRESENTATION LAYER 4.5 TCP WINDOW MANAGEMENT UNIT-4 4.1 DESIGN ISSUES OF TRANSPORT LAYER 4.2 DESIGN ISSUES OF SESSION LAYER 4.3 DESIFN ISSUES OF PRESENTATION LAYER 4.4 CONNECTION MANAGEMENT & THREE WAY HANDSHAKE 4.5 TCP WINDOW MANAGEMENT 4.6 REMOTE

More information

Distributed Systems Exam 1 Review Paul Krzyzanowski. Rutgers University. Fall 2016

Distributed Systems Exam 1 Review Paul Krzyzanowski. Rutgers University. Fall 2016 Distributed Systems 2015 Exam 1 Review Paul Krzyzanowski Rutgers University Fall 2016 1 Question 1 Why did the use of reference counting for remote objects prove to be impractical? Explain. It s not fault

More information

Handout 20 - Quiz 2 Solutions

Handout 20 - Quiz 2 Solutions Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.033 Computer Systems Engineering: Spring 2001 Handout 20 - Quiz 2 Solutions 20 Average: 81 Median: 83 Std.

More information

User Authentication. Modified By: Dr. Ramzi Saifan

User Authentication. Modified By: Dr. Ramzi Saifan User Authentication Modified By: Dr. Ramzi Saifan Authentication Verifying the identity of another entity Computer authenticating to another computer Person authenticating to a local/remote computer Important

More information

ח'/סיון/תשע "א. RSA: getting ready. Public Key Cryptography. Public key cryptography. Public key encryption algorithms

ח'/סיון/תשע א. RSA: getting ready. Public Key Cryptography. Public key cryptography. Public key encryption algorithms Public Key Cryptography Kurose & Ross, Chapters 8.28.3 (5 th ed.) Slides adapted from: J. Kurose & K. Ross \ Computer Networking: A Top Down Approach (5 th ed.) AddisonWesley, April 2009. Copyright 19962010,

More information

Distributed Systems Fall 2009 Final

Distributed Systems Fall 2009 Final 15-440 Distributed Systems Fall 2009 Final Name: Andrew: ID November 29, 2010 Please write your name and Andrew ID above before starting this exam. This exam has 10 pages, including this title page. Please

More information

Security Handshake Pitfalls

Security Handshake Pitfalls Security Handshake Pitfalls 1 Authentication Handshakes Secure communication almost always includes an initial authentication handshake: Authenticate each other Establish sessions keys This process may

More information

Authentication. Overview of Authentication systems. IT352 Network Security Najwa AlGhamdi

Authentication. Overview of Authentication systems. IT352 Network Security Najwa AlGhamdi Authentication Overview of Authentication systems 1 Approaches for Message Authentication Authentication is process of reliably verifying the identity of someone. Authentication Schemes 1. Password-based

More information

Linux Network Administration

Linux Network Administration Secure Remote Connections with OpenSSH Objective At the conclusion of this module, the student will be able to: Configure the ssh daemon start, stop, and restart sshd 17 January 2005 NETW 111 - SSH 2 SSH

More information

Module: Cryptographic Protocols. Professor Patrick McDaniel Spring CMPSC443 - Introduction to Computer and Network Security

Module: Cryptographic Protocols. Professor Patrick McDaniel Spring CMPSC443 - Introduction to Computer and Network Security CMPSC443 - Introduction to Computer and Network Security Module: Cryptographic Protocols Professor Patrick McDaniel Spring 2009 1 Key Distribution/Agreement Key Distribution is the process where we assign

More information

Computer Security. 10r. Recitation assignment & concept review. Paul Krzyzanowski. Rutgers University. Spring 2018

Computer Security. 10r. Recitation assignment & concept review. Paul Krzyzanowski. Rutgers University. Spring 2018 Computer Security 10r. Recitation assignment & concept review Paul Krzyzanowski Rutgers University Spring 2018 April 3, 2018 CS 419 2018 Paul Krzyzanowski 1 1. What is a necessary condition for perfect

More information

Distributed Systems Principles and Paradigms

Distributed Systems Principles and Paradigms Distributed Systems Principles and Paradigms Chapter 09 (version April 7, 2008) Maarten van Steen Vrije Universiteit Amsterdam, Faculty of Science Dept. Mathematics and Computer Science Room R4.20. Tel:

More information

Cryptography and Network Security

Cryptography and Network Security Cryptography and Network Security Spring 2012 http://users.abo.fi/ipetre/crypto/ Lecture 14: Folklore, Course summary, Exam requirements Ion Petre Department of IT, Åbo Akademi University 1 Folklore on

More information

CIS 6930/4930 Computer and Network Security. Final exam review

CIS 6930/4930 Computer and Network Security. Final exam review CIS 6930/4930 Computer and Network Security Final exam review About the Test This is an open book and open note exam. You are allowed to read your textbook and notes during the exam; You may bring your

More information

Distributed systems. Lecture 6: distributed transactions, elections, consensus and replication. Malte Schwarzkopf

Distributed systems. Lecture 6: distributed transactions, elections, consensus and replication. Malte Schwarzkopf Distributed systems Lecture 6: distributed transactions, elections, consensus and replication Malte Schwarzkopf Last time Saw how we can build ordered multicast Messages between processes in a group Need

More information

Cryptography (Overview)

Cryptography (Overview) Cryptography (Overview) Some history Caesar cipher, rot13 substitution ciphers, etc. Enigma (Turing) Modern secret key cryptography DES, AES Public key cryptography RSA, digital signatures Cryptography

More information

CSCI 667: Concepts of Computer Security. Lecture 9. Prof. Adwait Nadkarni

CSCI 667: Concepts of Computer Security. Lecture 9. Prof. Adwait Nadkarni CSCI 667: Concepts of Computer Security Lecture 9 Prof. Adwait Nadkarni 1 Derived from slides by William Enck, Micah Sherr, Patrick McDaniel, Peng Ning, and Vitaly Shmatikov Authentication Alice? Bob?

More information

Verteilte Systeme (Distributed Systems)

Verteilte Systeme (Distributed Systems) Verteilte Systeme (Distributed Systems) Lorenz Froihofer l.froihofer@infosys.tuwien.ac.at http://www.infosys.tuwien.ac.at/teaching/courses/ VerteilteSysteme/ Security Threats, mechanisms, design issues

More information

Chapter 8. User Authentication

Chapter 8. User Authentication Chapter 8. User Authentication This chapter describes how NetDefendOS implements user authentication. Overview, page 220 Authentication Setup, page 221 8.1. Overview In situations where individual users

More information

Lecture Nov. 21 st 2006 Dan Wendlandt ISP D ISP B ISP C ISP A. Bob. Alice. Denial-of-Service. Password Cracking. Traffic.

Lecture Nov. 21 st 2006 Dan Wendlandt ISP D ISP B ISP C ISP A. Bob. Alice. Denial-of-Service. Password Cracking. Traffic. 15-441 Lecture Nov. 21 st 2006 Dan Wendlandt Worms & Viruses Phishing End-host impersonation Denial-of-Service Route Hijacks Traffic modification Spyware Trojan Horse Password Cracking IP Spoofing DNS

More information

Test 2 Review. 1. (10 points) Timestamps and nonces are both used in security protocols to prevent replay attacks.

Test 2 Review. 1. (10 points) Timestamps and nonces are both used in security protocols to prevent replay attacks. Test 2 Review Name Student ID number Notation: {X} Bob Apply Bob s public key to X [Y ] Bob Apply Bob s private key to Y E(P, K) Encrypt P with symmetric key K D(C, K) Decrypt C with symmetric key K h(x)

More information

CSC 4900 Computer Networks: Security Protocols (2)

CSC 4900 Computer Networks: Security Protocols (2) CSC 4900 Computer Networks: Security Protocols (2) Professor Henry Carter Fall 2017 Chapter 8 roadmap 8.1 What is network security? 8.2 Principles of cryptography 8.3 Message Integrity 8.4 End point Authentication

More information

Authentication Handshakes

Authentication Handshakes AIT 682: Network and Systems Security Topic 6.2 Authentication Protocols Instructor: Dr. Kun Sun Authentication Handshakes Secure communication almost always includes an initial authentication handshake.

More information

SEEM4540 Open Systems for E-Commerce Lecture 03 Internet Security

SEEM4540 Open Systems for E-Commerce Lecture 03 Internet Security SEEM4540 Open Systems for E-Commerce Lecture 03 Internet Security Consider 2. Based on DNS, identified the IP address of www.cuhk.edu.hk is 137.189.11.73. 1. Go to http://www.cuhk.edu.hk 3. Forward the

More information

Lecture 6 - Cryptography

Lecture 6 - Cryptography Lecture 6 - Cryptography CMPSC 443 - Spring 2012 Introduction Computer and Network Security Professor Jaeger www.cse.psu.edu/~tjaeger/cse443-s12 Question Setup: Assume you and I donʼt know anything about

More information

CS 161 Computer Security

CS 161 Computer Security Popa & Wagner Spring 2016 CS 161 Computer Security Discussion 5 Week of February 19, 2017 Question 1 Diffie Hellman key exchange (15 min) Recall that in a Diffie-Hellman key exchange, there are values

More information

Test 2 Review. (b) Give one significant advantage of a nonce over a timestamp.

Test 2 Review. (b) Give one significant advantage of a nonce over a timestamp. Test 2 Review Name Student ID number Notation: {X} Bob Apply Bob s public key to X [Y ] Bob Apply Bob s private key to Y E(P, K) Encrypt P with symmetric key K D(C, K) Decrypt C with symmetric key K h(x)

More information

Data Security and Privacy. Topic 14: Authentication and Key Establishment

Data Security and Privacy. Topic 14: Authentication and Key Establishment Data Security and Privacy Topic 14: Authentication and Key Establishment 1 Announcements Mid-term Exam Tuesday March 6, during class 2 Need for Key Establishment Encrypt K (M) C = Encrypt K (M) M = Decrypt

More information

Key Management. Digital signatures: classical and public key Classic and Public Key exchange. Handwritten Signature

Key Management. Digital signatures: classical and public key Classic and Public Key exchange. Handwritten Signature Key Management Digital signatures: classical and public key Classic and Public Key exchange 1 Handwritten Signature Used everyday in a letter, on a check, sign a contract A signature on a signed paper

More information

The Internet community has developed application-specific security mechanisms in a number of application areas, including electronic mail (S/MIME,

The Internet community has developed application-specific security mechanisms in a number of application areas, including electronic mail (S/MIME, 1 The Internet community has developed application-specific security mechanisms in a number of application areas, including electronic mail (S/MIME, PGP), client/server (Kerberos), Web access (Secure Sockets

More information

14. Internet Security (J. Kurose)

14. Internet Security (J. Kurose) 14. Internet Security (J. Kurose) 1 Network security Foundations: what is security? cryptography authentication message integrity key distribution and certification Security in practice: application layer:

More information

Auditing IoT Communications with TLS-RaR

Auditing IoT Communications with TLS-RaR Auditing IoT Communications with TLS-RaR Judson Wilson, Henry Corrigan-Gibbs, Riad S. Wahby, Keith Winstein, Philip Levis, Dan Boneh Stanford University Auditing Standard Devices MITM Used for: security

More information

Cryptography & Key Exchange Protocols. Faculty of Computer Science & Engineering HCMC University of Technology

Cryptography & Key Exchange Protocols. Faculty of Computer Science & Engineering HCMC University of Technology Cryptography & Key Exchange Protocols Faculty of Computer Science & Engineering HCMC University of Technology Outline 1 Cryptography-related concepts 2 3 4 5 6 7 Key channel for symmetric cryptosystems

More information

CS 470 Spring Security. Mike Lam, Professor. a.k.a. Why on earth do Alice and Bob need to share so many secrets?!?

CS 470 Spring Security. Mike Lam, Professor. a.k.a. Why on earth do Alice and Bob need to share so many secrets?!? 50fb6be35f4c3105 9d4ed08fb86d8887 b746c452a9c9443b 15b22f450c76218e CS 470 Spring 2018 9df7031cdbff9d10 b700a92855f16328 5b757e66d2131841 62fedd7d9131e42e Mike Lam, Professor Security a.k.a. Why on earth

More information

Top-Down Network Design

Top-Down Network Design Top-Down Network Design Chapter Eight Developing Network Security Strategies Copyright 2010 Cisco Press & Priscilla Oppenheimer 1 Network Security Design The steps for security design are: 1. Identify

More information

CSC 474/574 Information Systems Security

CSC 474/574 Information Systems Security CSC 474/574 Information Systems Security Topic 3.3: Security Handshake Pitfalls CSC 474/574 Dr. Peng Ning 1 Authentication Handshakes Secure communication almost always includes an initial authentication

More information

MU2a Authentication, Authorization & Accounting Questions and Answers with Explainations

MU2a Authentication, Authorization & Accounting Questions and Answers with Explainations 98-367 MU2a Authentication, Authorization & Accounting Questions and Answers with Explainations Which are common symptoms of a virus infection? (Lesson 5 p 135-136) Poor system performance. Unusually low

More information

Application Note. Providing Secure Remote Access to Industrial Control Systems Using McAfee Firewall Enterprise (Sidewinder )

Application Note. Providing Secure Remote Access to Industrial Control Systems Using McAfee Firewall Enterprise (Sidewinder ) Application Note Providing Secure Remote Access to Industrial Control Systems Using McAfee Firewall Enterprise (Sidewinder ) This document describes how to configure McAfee Firewall Enterprise to provide

More information

key distribution requirements for public key algorithms asymmetric (or public) key algorithms

key distribution requirements for public key algorithms asymmetric (or public) key algorithms topics: cis3.2 electronic commerce 24 april 2006 lecture # 22 internet security (part 2) finish from last time: symmetric (single key) and asymmetric (public key) methods different cryptographic systems

More information

Internet security and privacy

Internet security and privacy Internet security and privacy IPsec 1 Layer 3 App. TCP/UDP IP L2 L1 2 Operating system layers App. TCP/UDP IP L2 L1 User process Kernel process Interface specific Socket API Device driver 3 IPsec Create

More information

CSE 3461/5461: Introduction to Computer Networking and Internet Technologies. Network Security. Presentation L

CSE 3461/5461: Introduction to Computer Networking and Internet Technologies. Network Security. Presentation L CS 3461/5461: Introduction to Computer Networking and Internet Technologies Network Security Study: 21.1 21.5 Kannan Srinivasan 11-27-2012 Security Attacks, Services and Mechanisms Security Attack: Any

More information

Distributed Systems. 27. Firewalls and Virtual Private Networks Paul Krzyzanowski. Rutgers University. Fall 2013

Distributed Systems. 27. Firewalls and Virtual Private Networks Paul Krzyzanowski. Rutgers University. Fall 2013 Distributed Systems 27. Firewalls and Virtual Private Networks Paul Krzyzanowski Rutgers University Fall 2013 November 25, 2013 2013 Paul Krzyzanowski 1 Network Security Goals Confidentiality: sensitive

More information

Introduction. Trusted Intermediaries. CSC/ECE 574 Computer and Network Security. Outline. CSC/ECE 574 Computer and Network Security.

Introduction. Trusted Intermediaries. CSC/ECE 574 Computer and Network Security. Outline. CSC/ECE 574 Computer and Network Security. Trusted Intermediaries CSC/ECE 574 Computer and Network Security Topic 7. Trusted Intermediaries Problem: authentication for large networks Solution #1 Key Distribution Center () Representative solution:

More information

Overview. SSL Cryptography Overview CHAPTER 1

Overview. SSL Cryptography Overview CHAPTER 1 CHAPTER 1 Secure Sockets Layer (SSL) is an application-level protocol that provides encryption technology for the Internet. SSL ensures the secure transmission of data between a client and a server through

More information

Numerics I N D E X. 3DES (Triple Data Encryption Standard), 48

Numerics I N D E X. 3DES (Triple Data Encryption Standard), 48 I N D E X Numerics A 3DES (Triple Data Encryption Standard), 48 Access Rights screen (VPN 3000 Series Concentrator), administration, 316 322 Action options, applying to filter rules, 273 adding filter

More information

Network Security and Cryptography. 2 September Marking Scheme

Network Security and Cryptography. 2 September Marking Scheme Network Security and Cryptography 2 September 2015 Marking Scheme This marking scheme has been prepared as a guide only to markers. This is not a set of model answers, or the exclusive answers to the questions,

More information

Authentication Part IV NOTE: Part IV includes all of Part III!

Authentication Part IV NOTE: Part IV includes all of Part III! Authentication Part IV NOTE: Part IV includes all of Part III! ECE 3894 Hardware-Oriented Security and Trust Spring 2018 Assoc. Prof. Vincent John Mooney III Georgia Institute of Technology NOTE: THE FOLLOWING

More information