Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
a. A password changing program will reject passwords that are less than five
characters long or that are found in a dictionary.
Policy: Require strong passwords for improved authentication and confidentiality.
Mechanism: Program augmentation to track password length and compare for entries in
an online dictionary.
b. Only students in a computer science class will be given accounts on the
departments computer system.
Policy: Ensure computer available and reduce chance of confidentiality or integrity
failures by restricting computer access to those that really need the access.
Mechanism: Procedural by mailing account information to student address. And/or use
class roster to create accounts and recheck accounts after last drop date.
c. The login program will disallow logins of any students who enter their
passwords incorrectly three times.
Policy: Discourage invalid login attempts to prevent system attacks.
Mechanism: Augment login program or wrap login program to track failed
authentication attempts and disable the account on the third failed try.
d. The permissions of the file containing Carols homework will prevent
Robert from cheating and copying it.
Policy: No collaboration on homework.
Mechanism: OS specific file controls.
e. When the World Wide Web traffic climbs to more than 80% of the
networks capacity, systems will disallow any further communications to
or from Web servers.
Policy: Ensure network availability for critical traffic.
Mechanism: Use scripts or more sophisticated quality of service mechanism to throttle
back HTTP traffic (on the well known HTTP ports).
f. Annie, a systems analyst, will be able to detect a student using a program
to scan her system for vulnerabilities.
Policy: Non-authorized personal shall not conduct system scans. Such scans will be
assumed to be preludes to a system attack.
Mechanism: Host Intrusion Detection systems that look for classing scanning patterns.
g. A program used to submit homework will turn itself off just after the due
date.
Delete_all_rights(p,q,s)
Delete read in A[q,s]
Delete write in A[q,s]
Delete execute in A[q,s]
Delete append in A[q,s]
Delete list in A[q,s]
Delete modify in A[q,s]
Delete own in A[q,s]
b. Modify your command so that the deletion can only occur if p has modify
rights over s.
Delete_all_rights(p,q,s)
If modify in A[p,s] then
Delete read in A[q,s]
Delete write in A[q,s]
Delete execute in A[q,s]
Delete append in A[q,s]
Delete list in A[q,s]
Delete modify in A[q,s]
Delete own in A[q,s]
c. Modify your command so that the deletion can only occur if p has modify
rights over s and q does not have own rights over s.
The trick is that testing not is not allowed. Similarly, else is not allowed. You can use
a trick of creating a temporary subject or object. Strictly, speaking this would be
implemented as a sequence of commands, since each command has only one conditional
clause.
Delete_all_rights(p,q,s)
Create subject tmp
Enter read in A[tmp,s]
If own in A[q,s] then
Delete read from A[tmp,s]
If modify in A[p,s] and read in A[tmp,s] then
Delete read in A[q,s]
Delete write in A[q,s]
Delete execute in A[q,s]
Delete append in A[q,s]
Delete list in A[q,s]
Delete modify in A[q,s]
Delete own in A[q,s]
Destroy subject tmp