UT CS 361  CS 361 Midterm Sample Questions (8 pages)
Previewing pages 1, 2, 3 of 8 page document View the full content.CS 361 Midterm Sample Questions
Previewing pages 1, 2, 3 of actual document.
View the full content.View Full Document
CS 361 Midterm Sample Questions
0 0 214 views
Exam
 Pages:
 8
 School:
 University of Texas at Austin
 Course:
 Cs 361  Introduction to Computer Security
Introduction to Computer Security Documents

Foundations of Computer Security
7 pages

Foundations of Computer Security
6 pages

Lecture 25  The Chinese Wall Policy
2 pages

5 pages

Attacks on Cryptographic Protocols
6 pages

Lecture 3 Security as Risk Management
2 pages

2 pages

Lecture 3: Security as Risk Management
7 pages

Lecture 58: Cryptographic Protocols: Abstract View
2 pages

Foundations of Computer Security Lecture 1: Introduction
3 pages

Lecture 70: PGP Key Management II
9 pages

2 pages

Lecture 69: PGP Key ManagemenT
2 pages

9 pages

2 pages

Lecture 43 Transposition Ciphers
6 pages

2 pages

Foundations of Computer Security
6 pages

Lecture 53: Digital Signatures
6 pages

2 pages

8 pages

Cryptographic Protocols: Abstract View
5 pages

8 pages

Lecture 46: Advanced Encryption Standard
3 pages

5 pages

Lecture 73  Intrusion Detection
2 pages

2 pages

22 pages

11 pages

Lecture 46: Advanced Encryption Standard
9 pages

7 pages

7 pages

Lecture 11: Access Control Policies
7 pages

Lecture 16: Detecting Covert Channels
7 pages

6 pages

7 pages

Attacks on Cryptographic Protocols
2 pages

9 pages

7 pages

2 pages

2 pages

3 pages

8 pages

Foundations of Computer Security Lecture 33 Entropy II
2 pages

Lecture 62 The OtwayRees Protocol
2 pages

Lecture 79: Security Target Example
5 pages

Lecture 2: Why Security is Hard
9 pages

2 pages

8 pages

Foundations of Computer Security
11 pages

Lecture 34  Fundamental Theorems
7 pages

Lecture 56: Cryptographic Protocols
2 pages

Lecture 77 The Common Criteria
2 pages

2 pages

Lecture 61 Attacks on NeedhamSchroeder
7 pages

7 pages

Lecture 65: The BAN Logic: NeedhamSchroeder
2 pages

Lecture 26: RoleBased Access Control
7 pages

6 pages

Lecture 52: DiffieHellman Key Exchange
6 pages

Lecture 10: Tranquility and BLP
2 pages

3 pages

6 pages

7 pages

3 pages

6 pages
Sign up for free to view:
 This document and 3 million+ documents and flashcards
 High quality study guides, lecture notes, practice exams
 Course Packets handpicked by editors offering a comprehensive review of your courses
 Better Grades Guaranteed
Unformatted text preview:
CS 361 Midterm Sample Questions Instructor Dr Bill Young Name Read all questions carefully Answer all questions in the space provided You may use scratch paper to do your work but only answers recorded on the test paper will be graded Be as concise as possible Note the questions on this sample are all questions asked on past midterms but this sample is longer than an hour test CS361 Midterm Sample 1 1 10 points Suppose you have a secure system with three subjects and three objects with levels as listed below Type Object Object Object Subject Subject Subject Name Obj1 Obj2 Obj3 Subj1 Subj2 Subj3 Level H A B L B L A B L A B H L A B C Here H dominates L You wish to implement a Bell and LaPadula model of security for this system Fill in the access rights R and or W permitted by the model for each subject object pair in the access matrix below Obj1 Obj2 Obj3 Subj1 Subj2 Subj3 2 10 points Assume you have a six sided die that is lopsided in such a way that it rolls each of 1 2 or 3 twice as often as each of 4 5 or 6 You wish to send the results of a series of rolls over a transmission channel Compute the entropy of this language Please write down the appropriate sum you don t have to compute a numeric answer You might also be asked to show an encoding that is better than the naive encoding and prove that it is better CS361 Midterm Sample 2 3 10 points Imagine a Bell and LaPadula like secure system with the following five operations READ s o if the subject and object exist and L s L o the subject obtains the current value of the object otherwise do nothing WRITE s o v if the subject and object exist and L s L o the object gets value v otherwise do nothing CREATE s o add a new object with the given name a level equal to the subject s level and an initial value of 0 If an object of that name exists do nothing DESTROY s o eliminate the designated object from the state assuming that the object exists and the subject has WRITE access to it Otherwise do nothing RUN s the named
View Full Document