(Note 6.915 was the temporary name for 6.857)6.915 is a new course in Network and Computer Security offered by the EECS Department. It meets on Tuesdays and Thursdays, 2:30-4:00, in Room 36-153.
6.915 is an upper-level undergraduate, first-year graduate course on network and computer security. It fits within the Computer Systems and Architecture Engineering Concentration. The prerequisites are 6.033, and either 6.046 or 18.063.
Topics covered will include the following:
One of the requirements for the class was to write a term paper. You can follow a link to the 6.915 Term Papers Page
Handout 1: Course Information.
Handout 2: Course Outline.
Reading: MIT Guide to Lock Picking
Handout 3: Problem Set 1.
Handout 4: Problem Set 2.
Handout 5: Following reading material:
Handout 6: Reading material.
Handout 7: Problem Set 3.
Handout 8: Following reading material:
Handout 9: Problem Set 1 Solutions.
Handout 10: Problem Set 2 Solutions.
Handout 11: Following reading material:
Handout 12: Problem Set 4
Handout 13: Following reading material:
Handout 14: Problem Set 5
Handout 15: Following reading material:
Handout 16: An article that appeared on the New York Times on October 11, 1995. Also the Lecture 11: Secure sharing of information. Access control. Discretionary versus mandatory access control. Access control lists. Capabilities.
Handout 17: Following reading material:
Handout 18: Problem Set 6.
Handout 19: Following reading material:
Handout 20: Problem Set 3 Solutions.
Handout 22: Following reading material:
Handout 23: Problem Set 4 Solutions.
Handout 24: Problem Set 5 Solutions.
Handout 25: The paper Collusion-Secure Fingerprinting for Digital Data. by Dan Boneh and James Shaw.
Handout 26: Problem Set 7
Handout 27: The paper iKP -- A Family of Secure Electronic Payment Protocols by M.Bellare, J.Garay, R.Hauser, A.Herzberg, H.Krawczyk, M.Steiner, G.Tsudik, M.Waidner.
Handout 28: The papers
Handout 29: Problem Set 8
Handout 30: Reading material.
Handout 31: The paper Untraceable off-line cash in wallets with observers by Stefan Brands.
Handout 32: Problem Set 9
Handout 33: The paper Security Without Identification: Transaction Systems to Make Big Brother Obsolete by David Chaum.
Handout 34: Problem Set 6 Solutions
Handout 35: The paper Network Firewalls by Steve Bellovin and William Cheswick
Handout 36: The paper Security Flaws in the HotJava Web Browser by Drew Dean and Dan S. Wallach
Handout 37: Problem Set 7 Solutions
Handout 38: The paper A receipt--free election scheme tolerating a dynamic coercer by Rosario Gennaro.
Handout 39: Problem Set 8 Solutions
Handout 40: The paper Kerberos: An Authentication Service for Computer Networks by B. Clifford Neuman and Theodore Ts'o
Reading Material: Internet Request for Comment RFC1510
Handout 41: The paper Cryptanalysis of Diffie-Hellman, RSA, DSS and other systems using timing attacks by Paul Kocher
Handout 42: Problem Set 9 Solutions
Students are required to scribe notes for each lecture. These notes are available by clicking on the lecture number link.
LaTeX Help: Click on this link to get some documentation on how to get started with LaTeX to write class notes.