• CS 166 --- Information Security
• Department of Computer Science
• San Jose State University
• Fall 2009 semester

• Name: Mark Stamp
• Office: MQH 216
• Office hours: Friday 11:00am--3:00pm, or by appointment
• Phone: 408-924-5094
• email: stamp@cs.sjsu.edu
  • Email is the best way to contact me
  • Please put "CS166" at the beginning of the subject line
• Greensheet: http://www.cs.sjsu.edu/faculty/stamp/CS166/syllabus/syllabusSpr09.html
• Who am I?
• Furlough days:
  • Tuesday, September 8
  • Tuesday, September 22
  • Tuesday, November 24

• PowerPoint slides, errata, and resources for the textbook are available here.

• Approximate schedule (3 hours equals 1 week of class time):
  • Introduction
    • Chapter 1 (1 hour)
  • Crypto
    • Chapter 2: Crypto Basics (3 hours)
    • Chapter 3: Symmetric Key Crypto (4 hours)
    • Chapter 4: Public Key Crypto (4 hours)
    • Chapter 5: Hash Functions and Other Topics (4 hours)
  • Access Control
    • Chapter 7: Authentication (4 hours)
    • Chapter 8: Authorization (2 hour)
  • Protocols
    • Chapter 9: Simple Authentication Protocols (4 hours)
    • Chapter 10: Real-World Security Protocols (5 hours)
  • Software
    • Chapter 11: Software Flaws and Malware (4 hours)
    • Chapter 12: Insecurity in Software (4 hours)
    • Chapter 13: Operating Systems and Security (4 hours)
  
  
• Note: Due to time constraints, we will omit much of Chapter 8 and various parts of the last three chapters.
  
  
• Other useful security books:
  • Network Security: Private Communication in a Public World, second edition, Charlie Kaufman, Radia Perlman and Mike Speciner, Prentice Hall, 2002, ISBN: 0-13-046019-2. This book has limited, but good, coverage of cryptography and excellent coverage of selected security protocols.
  • Security Engineering: A Guide to Building Dependable Distributed Systems, Ross Anderson, John Wiley & Sons, Inc., 2001, ISBN: 0-471-38922-6; see Ross Anderson's Security Engineering website http://www.cl.cam.ac.uk/~rja14/book.html for lots of interesting security information, and errata for his book. This book consists primarily of case studies illustrating security failures. The emphasis is on human factors, not technical issues.
  • Security in Computing, third edition, Charles P. Pfleeger and Shari Lawrence Pfleeger, Prentice Hall, 2003, ISBN: 0-13-035548-8. The strength of this book is its coverage of software security issues. In particular, operating systems and some aspects of secure software engineering are covered well. The book also has some dated, but reasonably good information on viruses.
  • Applied Cryptography: Protocols, Algorithms and Source Code in C, Second Edition, Bruce Schneier, John Wiley & Sons, Inc., 1995 (2nd edition), ISBN: 0-471-11709-9. This is a standard reference for real-world cryptography.
  • Computer Security, Dieter Gollmann, John Wiley & Sons, Inc., 1999, ISBN: 0471978442. This book is not particularly easy to read but I do recommend Chapter 8, How Things Go Wrong.
  • Counter Hack Reloaded: A Step-by-Step Guide to Computer Attacks and Effective Defenses, 2nd editions, Ed Skoudis and Tom Liston Prentice Hall, 2005, ISBN: 0131481045. There are many books that claim to provide information on how hackers operate and how to foil attacks, but this is by far the best of the bunch.

1. Test 1, 100 points. Date: Tuesday, October 6.
2. Test 2, 100 points. Date: Tuesday, November 17.
3. Homework, quizzes, class participation, and other work as assigned, 100 points.
4. Final, 100 points.
   • Section 01, Monday, December 14 at 9:45am
   • Section 02, Wednesday, December 16 at 9:45am
   • The official finals schedule is here: http://info.sjsu.edu/web-dbgen/narr/soc-fall/rec-227.html
5. Semester grade will be computed as a weighted average of the 4 major scores listed above.
6. No make-up tests or quizzes will be given and no late homework (or other work) will be accepted.
7. Nominal Grading Scale:
   
   

   Percentage	Grade
   92 and above	A
   90 - 91	A-
   88 - 89	B+
   82 - 87	B
   80 - 81	B-
   78 - 79	C+
   72 - 77	C
   70 - 71	C-
   68 - 69	D+
   62 - 67	D
   60 - 61	D-
   59 and below	F

     CS166HMK assignmentnumber yourlastname last4digitofyourstudentnumber 

• Assignment 1: Due Thursday, September 3
  Solve the following problems from the problem set found here: 4, 10, 14, 17, 21 The PowerPoint slides mentioned in problem 21 can be found here and the video is here.
  
  
• Assignment 2: Due Thursday, September 10
  Chapter 2, Problems 1, 3, 8, 10, 14, 19, 26
  
  
• Assignment 3: Due Thursday, September 17
  Chapter 3, Problems 3, 4, 6, 16, 17, 18, 35, 36. The files you need for problem 35 can be found here and here.
  
  
• Assignment 4: Due Thursday, September 24
  Chapter 4, Problems 3, 5, 7, 11, 14, 15, 19, 24
  
  
• Assignment 5: Due Thursday, October 1
  Chapter 5, Problems 8, 9, 10, 14, 19, 21, 37. The files you need for problem 37 can be found here.
  
  
• Assignment 6: Due Thursday, October 22
  Chapter 7, Problems 6, 11, 13, 20, 25, 27, 31, 34, 36. For problem 31, you can view the video clip here.
  
  
• Assignment 7: Due Thursday, October 29
  Chapter 8, Problems 3, 5, 13, 15, 20
  Chapter 9, Problems 4, 18, 24, 25
  
  
• Assignment 8: Due Tuesday, November 10
  Chapter 9, Problems 12, 20, 23, 28, 31, 38
  
  
• Assignment 9: Due TBD
  
  
  
• Assignment 10: Due TBD
  
  
  
• Assignment 11: Due TBD
  
  
  

• No disruptive or annoying talking
• Turn off cell phones
• Class begins on time
• Class is not over until I say it's over
• Etc.

• Speaker: Priti Desai
• Title: Towards An Undetectable Computer Virus
• Date: Thursday, November 12
• Time: 3:00pm
• Location: MH225
• Abstract:
  Metamorphic viruses modify their own code to produce viral copies which are syntactically different from their parents. The viral copies have the same functionality as the parent but may have different signatures. This makes signature-based virus scanners unreliable for detecting metamorphic viruses. But statistical pattern analysis tool such as Hidden Markov Models (HMMs) can detect metamorphic viruses. Virus writers use many different code obfuscation techniques to generate metamorphic viruses. In this project we develop a metamorphic engine using code obfuscation techniques. Our metamorphic engine is designed to produce highly diverse morphed copies of the base virus. We show that commercial virus scanners cannot detect metamorphic viruses produced by our engine. We then proceed to determine whether HMMs can detect metamorphic viruses generated by our engine.