Computer Security 6, Exercises - Computer Science, Exercises of Computer Security

Computer Security 6, Exercises - Computer Science - Prof. David Wagner.pdf, University of California (CA) - UCLA, United States of America (USA), Prof. David Wagner, Computer Science, Computer Security, Firewalls and Network Threats, Zero-Knowledge Proofs, Firewall Deployments

Typology: Exercises

2010/2011

Uploaded on 10/30/2011

jokerxxx
jokerxxx 🇺🇸

4.3

(36)

330 documents

1 / 5

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CS 161 Computer Security
Fall 2005 Joseph/Tygar/Vazirani/Wagner MT 1
PRI NT your name: ,
(last) (first)
SIG N your name:
PRI NT your Unix account name:
PRI NT your TA’s name:
You may consult any books, notes, or other paper-based inanimate objects available to you. Calculators and
computers are not permitted. Please write your answers in the spaces provided in the test; in particular, we
will not grade anything on the back of an exam page unless we are clearly told on the front of the page to
look there.
Please be concise.
If you have questions, make a best guess and state your assumptions.
You have 50 minutes. There are 4 questions, of varying credit (100 points total). The questions are of
varying difficulty, so avoid spending too long on any one question.
Do not turn this page until your proctor tells you to do so.
Problem 1
Problem 2
Problem 3
Problem 4
Total
CS 161, Fall 2005, MT 1 1
pf3
pf4
pf5

Partial preview of the text

Download Computer Security 6, Exercises - Computer Science and more Exercises Computer Security in PDF only on Docsity!

CS 161 Computer Security

Fall 2005 Joseph/Tygar/Vazirani/Wagner MT 1

PRINT your name: , (last) (first)

SIGN your name:

PRINT your Unix account name:

PRINT your TA’s name:

You may consult any books, notes, or other paper-based inanimate objects available to you. Calculators and computers are not permitted. Please write your answers in the spaces provided in the test; in particular, we will not grade anything on the back of an exam page unless we are clearly told on the front of the page to look there.

Please be concise.

If you have questions, make a best guess and state your assumptions.

You have 50 minutes. There are 4 questions, of varying credit (100 points total). The questions are of varying difficulty, so avoid spending too long on any one question.

Do not turn this page until your proctor tells you to do so.

Problem 1

Problem 2

Problem 3

Problem 4

Total

Problem 1. [Firewalls and Network Threats] (30 points)

List and explain three network threats that a firewall does not protect against. (If a threat only applies to certain types of firewalls, then explain why this is the case.)

(a) Threat #

(b) Threat #

(c) Threat #

Problem 3. [Firewall Deployments] (20 points)

Explain the strengths and weaknesses of each of the following firewall deployment scenarios in defending servers, desktop machines, and laptops against network threats.

(a) A firewall at the network perimeter.

(b) Firewalls on every end host machine.

(c) A network perimeter firewall and firewalls on every end host machine.

Problem 4. [Classified Computing] (30 points)

(a) List two examples of covert channels, other than the three examples given in the lecture notes: existence of a file, system paging behavior, and system load. Explain how an adversary could take advantage of each of your examples.

  • Example #
  • Example #

(b) Two professors are running applications on a classified multi-user system. Professor Tygar is running the Quake game, and Professor Wagner is running a Top Secret application. Who should get higher priority on a multi-user machine? Explain your answer.

(c) Why is it difficult to implement systems supporting covert channel prevention that perform well? Ex- plain your answer.