CS 194-1, Fall 2005 Computer Security

---

People

Instructors:
  Anthony Joseph (675 Soda Hall)
  Doug Tygar (531 Soda Hall)
  Umesh Vazirani (671 Soda Hall)
  David Wagner (629 Soda Hall)

TAs:
  Paul Huang (pbhuang@cs.berkeley.edu)
  Jeff Kalvass (jeff@sims.berkeley.edu)
  Rusty Sears (sears@cs.berkeley.edu)
  Ivan Tam (ivan@sims.berkeley.edu)

Lectures:
  MWF, 11-12pm, 277 Cory

Sections:
  104. Th 12:00-1:00, 320 Soda
  101. Th 1:00-2:00, 320 Soda
  102. Th 2:00-3:00, 320 Soda
  103. Th 3:00-4:00, 320 Soda

Office Hours:
  Joseph: Mondays and Tuesdays 1-2 pm in 675 Soda
  Tygar: Mondays 1-2pm by appointment
  Vazirani: Mondays 3-4pm in 671 Soda
  Wagner: Wednesdays 1-2pm in 629 Soda
  Huang: Tuesdays 2-4pm in 511 Soda
  Kalvass: Wednesdays 4-6pm in 511 Soda
  Sears: Wednesdays 12-2pm in 551 Soda
  Tam: Wednesdays 2-4pm in 551 Soda

Web page: http://www.cs161.org/

---

Announcements

• Project 2 code can be found at cs161-fa05-project2-1.0.tar.gz and Design Document at DesignDoc.pdf.
• Homework 3 submission instruction: in the directory with your exploit1.c and exploit2.c type "submit hw3" to turn in your code for part 3.
• Please check the course newsgroup, ucb.class.cs161, for announcements.

---

Quick links: Lectures.

---

Course Overview

This course will cover the most important features of computer security, including topics such as cryptography, operating systems security, network security, and language-based security. After completing this course, students will be able to analyze, design, and build secure systems of moderate complexity.

List of course topics (tentative):

• Introduction to computer security. Basic concepts, threat models, common security goals.
• Cryptography and cryptographic protocols, including encryption, authentication, message authentication codes, hash functions, one-way functions, public-key cryptography, secure channels, zero knowledge in practice, cryptographic protocols and their integration into distributed systems, and other applications.
• Operating system security: memory protection, access control, authorization, authenticating users, enforcement of security, security evaluation, trusted devices, digital rights management.
• Network security. Firewalls, intrusion detection systems, viruses and worms, web security. Case studies: DNS, IPSec.
• Software security. Secure software engineering, defensive programming, buffer overruns and other implementation flaws. Language-based security: analysis of code for security errors, safe languages, and sandboxing techniques.
• Advanced topics and case studies, to be chosen according to instructor and student interest. (Possible examples: privacy, mobile code, digital rights management and copy protection, trusted devices, denial of service and availability, network based attacks, security and the law, electronic voting, quantum cryptography, penetration analysis, ethics, full disclosure.)

---

Assignments, Projects, and Exams

All homeworks are due on Friday at 11am in drop box #2 (in the slot labeled CS161/Fall 2005) in 283 Soda. The deadlines will be enforced strictly. Late homework will be accepted only in extraordinary circumstances, and may in any case be penalized. The lowest homework grade will be dropped.

Homeworks:

• Homework 1 [ps hw1] [pdf hw1] (due 9/23); solutions [solutions pdf hw1].
• Homework 2 [ps hw2] [pdf hw2] (due 10/14); solutions [solutions ps hw2] [solutions pdf hw2].
• Homework 3 [ps hw3] [pdf hw3] (due 12/2); solutions [solutions ps hw3] [solutions pdf hw3].

There will be two programming projects.

• Project 1 (due 10/31)
  • Project Description [ps proj1] [pdf proj1]
  • Code: Project 1 Code tarball
  • Sample Design Document: [html]
  • FAQ: FAQs
  • CVS: Setup Instructions
  • Notes on Object Serialization: [ps serialization] [pdf serialization]
  • Deter: Tutorial
  • Usernames and Passwords: File
  • Project 1 Submission: Instructions
• Project 2 (due 12/9)
  • Project 2 Description [pdf proj2]
  • Code: Project 2 Code tarball. (Removed from online archive.)
  • Design Document: [pdf design doc] (Removed from online archive.)

Exams:

• Midterm 1 (Oct 7) [ps mt1] [pdf mt1]; solutions [solutions ps mt1] [solutions pdf mt1].
• Midterm 2 (Nov 9, held in class) [ps mt2] [pdf mt2]; solutions [solutions ps mt2] [solutions pdf mt2].
• Final Exam (Tue Dec 13, 12:30-3:30pm, 1 Leconte) [ps final] [pdf final]; solutions [solutions ps final] [solutions pdf final].

---

Lectures

The following schedule is tentative and subject to change.

Readings from the textbooks are indicated as follows: P&P 1.2 denotes Pfleeger & Pfleeger, Chapter 1.2; A 1.2 denotes Anderson, Chapter 1.2. Optional readings are in parentheses.

---

Section Notes

• 9/22, 1pm section [html]

---

Textbooks

The required textbook is Security in Computing (Charles P. Pfleeger, Shari Lawrence Pfleeger, 3rd ed., Prentice Hall, 2003). We will also provide lecture notes for most of the lectures.

The book Security Engineering (Ross Anderson, Wiley, 2001) is optional. It provides extra reading and background.

Note that you should not view the availability of lecture notes as a substitute for attending class: our discussion in class may deviate somewhat from the written material, and you should take your own notes as well.

---

Prerequisites

You must have taken CS 61C (Machine Structures). Also, you must have taken either Math 55 or CS 70 (Discrete Mathematics).

---

Grading Summary

Your final grade will be computed from five categories:

• 35% Projects
• 40% Exams (10% per midterm, 20% for the final)
• 15% Homework
• 10% Class participation

---

Collaboration and Academic Integrity Policy

Homeworks are to be done individually, on your own (not in groups). Projects will be done in groups. The mechanics of project groups will be announced later in the semester.

For homeworks, you must always write up the solutions on your own. Similarly, you may use references to help solve homework problems, but you must write up the solution on your own and cite your sources. You may not share written work or programs with anyone else. You may not receive help on homework assignments from students who have taken the course in previous years, and you may not review homework solutions from previous years.

In writing up your homework you are allowed to consult the instructors, TAs, assigned texts, posted notes, and any materials cited by them. If you do so, you are required to cite your source(s). Simply copying an answer is not sufficient; you are expected to write it up in your own words, and you must be able to explain it if you are asked to do so. Your answers may refer to course material and to homeworks from earlier in the semester. You are not permitted to consult others in the class; you are not permitted to "Google for the answer" to homework questions.

Copying solutions or code, in whole or in part, from other students or any other source without acknowledgment constitutes cheating. Any student found to be cheating in this class will automatically receive an F grade and will also be referred to the Office of Student Conduct.

You should never read another student's solution or partial solution, nor have it in your possession, either electronically or on paper. You should write your homework solution strictly by yourself.

Presenting another person's work as your own constitutes cheating, whether that person is a friend, an unknown student in this class or a previous semester's class, a solution set from .

Copying solutions or code, in whole or in part, from other students or any other source without acknowledgment constitutes cheating. Any student found to be cheating in this class will automatically receive an F grade and will also be referred to the Office of Student Conduct.

You should never read another student's solution or partial solution, nor have it in your possession, either electronically or on paper. You should write your homework solution strictly by yourself.

Presenting another person's work as your own constitutes cheating, whether that person is a friend, an unknown student in this class or a previous semester's class, a solution set from a previous semester of this course, or an anonymous person on the Web who happens to have solved the problem you've been asked to solve. Everything you turn in must be your own doing, and it is your responsibility to make it clear to the graders that it really is your own work. The following activities are specifically forbidden in all graded course work:

• Possession (or theft) of another student's solution or partial solution in any form (electronic, handwritten, or printed).
• Giving a solution or partial solution to another student, even with the explicit understanding that it will not be copied.
• Working together with anyone else to develop a solution that is subsequently turned in (either by you or by the other person).
• Looking up solution sets from previous semesters and presenting that solution, or any part of it, as your own.

Academic dishonesty has no place in a university; it wastes our time and yours, and it is unfair to the majority of students.

In our experience, nobody begins the semester with the intention of cheating. Students who cheat do so because they fall behind gradually and then panic. Some students get into this situation because they are afraid of an unpleasant conversation with a professor if they admit to not understanding something. We would much rather deal with your misunderstanding early than deal with its consequences later. Even if you are convinced that you are the only person in the class that doesn't understand the material, and that it is entirely your fault for having fallen behind, please overcome your feeling of guilt and ask for help as soon as you need it. Remember that the other students in the class are working under similar constraints--they are taking multiple classes and are often holding down outside employment. Don't hesitate to ask us for help--helping you learn the material is what we're paid to do, after all!

Warning

From time to time, we may discuss vulnerabilities in widely-deployed computer systems. This is not intended as an invitation to go exploit those vulnerabilities. It is important that we be able to discuss real-world experience candidly; students are expected to behave responsibly.

Berkeley policy is very clear: you may not break into machines that are not your own; you may not attempt to attack or subvert system security. Breaking into other people's systems is inappropriate, and the existence of a security hole is no excuse.

Unethical or inappropriate actions may result in failing the course and being referred for further discipline.

---

Contact information

If you have a question, your best option is to post a message to the ucb.class.cs161 newsgroup. The staff (instructor and TAs) will check the newsgroup regularly. When using the newsgroup, please do not post answers to homework questions before the homework is due.

If your question is personal or not of interest to other students, you may send email to cs161@cory.eecs.berkeley.edu. Email to cs161@cory is forwarded to the instructor and all TAs. We prefer that you use the cs161@cory address, rather than emailing directly the instructor and/or your TA. If you wish to talk with one of us individually, you are welcome to come to our office hours. If the office hours are not convenient, you may make an appointment with any of us by email.

The instructor and TAs may post announcements, clarifications, etc. to the class newsgroup. Hence you should read the newsgroup regularly whether you post questions to it or not. If you've never done this before, there is online information about how to access UCB newsgroups (see also here for more).

---

Mail inquiries to cs161@cory.eecs.berkeley.edu.