| # | date | topic | notes |
|---|---|---|---|
| 1. | Thu, Sep 28 | Introduction; what is computer security | |
| Fri, Sep 29 | Discussion: to be arranged | ||
| 2. | Tue, Oct 3 | Robust programming | |
| 3. | Thu, Oct 5 | Robust programming, security in programming | |
| Fri, Oct 6 | Discussion: to be arranged | ||
| 4. | Tue, Oct 10 | Security in programming, vulnerabilities analysis | homework 1 due |
| 5. | Thu, Oct 12 | Models of vulnerabilities, penetration testing | |
| 6. | Fri, Oct 13 | Discussion: Security policies | |
| Tue, Oct 17 | no class (SANS Network Security) | ||
| Thu, Oct 19 | no class (SANS Network Security) | ||
| 7. | Fri, Oct 20 | Discussion: Auditing and analyzing attacks | |
| 8. | Tue, Oct 24 | Confidentiality and integrity policies | homework 2 due |
| 9. | Thu, Oct 26 | Integrity policies | |
| Fri, Oct 27 | Discussion: to be arranged | ||
| 10. | Tue, Oct 31 | Basic Cryptography | |
| 11. | Thu, Nov 2 | Key management and cipher techniques | |
| Fri, Nov 3 | Discussion: to be arranged | ||
| 12. | Tue, Nov 7 | Authentication | homework 3 due |
| 13. | Thu, Nov 9 | midterm | |
| Fri, Nov. 10 | no class (Veterans Day): | ||
| 14. | Tue, Nov. 14 | Identity | |
| 15. | Thu, Nov. 16 | Access control mechanisms | |
| Fri, Nov. 17 | Discussion: to be arranged | ||
| 16. | Tue, Nov 21 | Access control mechanisms (con't) | homework 4 due |
| Thu, Nov 23 | no class (Thanksgiving) | ||
| Fri, Nov 24 | Discussion: no class (Thanksgiving) | ||
| 17. | Tue, Nov 29 | Assurance I: specification, design, implementation | |
| 18. | Thu, Dec 1 | Assurance II: testing, proving correctness | |
| Fri, Dec 2 | Discussion: to be arranged | ||
| 19. | Tue, Dec 5 | Malicious logic | |
| 20. | Thu, Dec 7 | Intrusion detection | homework 5 due |
| Fri, Dec 8 | Discussion: to be arranged | ||
| Tue, Dec 12 | final exam | 8:00 AM to 10:00 AM |
![]() |
Matt Bishop Office: 3059 Engineering Unit II Phone: +1 (530) 752-8060 Fax: +1 (530) 752-4767 Email: bishop@cs.ucdavis.edu | Copyright Matt Bishop, 2000. All federal and state copyrights reserved for all original material presented in this course through any medium, including lecture or print. |