Computer Systems Security (Winter 2016): Difference between revisions
No edit summary |
|||
(37 intermediate revisions by 10 users not shown) | |||
Line 17: | Line 17: | ||
* Dan Boneh ran an excellent course at Stanford in Spring 2015 on [https://crypto.stanford.edu/cs155/ Computer and Network Security]. This course has many interesting readings that we will not be covering. Also, the assignments are very good sources for hacking opportunities. | * Dan Boneh ran an excellent course at Stanford in Spring 2015 on [https://crypto.stanford.edu/cs155/ Computer and Network Security]. This course has many interesting readings that we will not be covering. Also, the assignments are very good sources for hacking opportunities. | ||
* The assignments from the Winter 2015 run of COMP 4108 [https:// | * The assignments from the Winter 2015 run of COMP 4108 [https://ccsl.carleton.ca/~dmccarney/COMP4108/ are available]. They are a reasonable start for several hacking opportunities. | ||
==Lectures and Exams== | ==Lectures and Exams== | ||
Line 120: | Line 119: | ||
</td> | </td> | ||
<td> | <td> | ||
<p>[[SystemsSec 2016W Lecture 9| | <p>[[SystemsSec 2016W Lecture 9|Defensive Security Technologies / Hacking Opportunities]] | ||
</p> | </p> | ||
</td> | </td> | ||
Line 130: | Line 129: | ||
</td> | </td> | ||
<td> | <td> | ||
<p>[[SystemsSec 2016W Lecture 10| | <p>[[SystemsSec 2016W Lecture 10|Security Research, Hashes, and Secure Protocols]] | ||
</p> | </p> | ||
</td> | </td> | ||
Line 140: | Line 139: | ||
</td> | </td> | ||
<td> | <td> | ||
<p>[[SystemsSec 2016W Lecture 11| | <p>[[SystemsSec 2016W Lecture 11|Modeling a potential attack/ Midterm FAQ]] | ||
</p> | </p> | ||
</td> | </td> | ||
Line 170: | Line 169: | ||
</td> | </td> | ||
<td> | <td> | ||
<p>[[SystemsSec 2016W Lecture 13| | <p>[[SystemsSec 2016W Lecture 13|Buffer Overflow/Memory Corruption Attacks]] | ||
</p> | </p> | ||
</td> | </td> | ||
<td><p></p></td></tr> | <td><p>Aleph One (aka Elias Levy), [http://www.phrack.com/issues/49/14.html#article Smashing The Stack For Fun And Profit] (Phrack 49, 1996)</p></td></tr> | ||
<tr> | <tr> | ||
<td> | <td> | ||
Line 180: | Line 179: | ||
</td> | </td> | ||
<td> | <td> | ||
<p>[[SystemsSec 2016W Lecture 14| | <p>[[SystemsSec 2016W Lecture 14|Buffer Overflow/Memory Corruption Defenses]] | ||
</p> | </p> | ||
</td> | </td> | ||
<td><p></p></td></tr> | <td> | ||
<p>Wikipedia, [https://en.wikipedia.org/wiki/Buffer_overflow_protection Buffer Overflow Protection]<br> | |||
Crispin Cowan et al., [https://www.usenix.org/legacy/publications/library/proceedings/sec98/cowan.html StackGuard: Automatic Adaptive Detection and Prevention of Buffer-Overflow Attacks] (USENIX Security, 1998)</p> | |||
</td> | |||
</tr> | |||
<tr> | <tr> | ||
<td> | <td> | ||
Line 190: | Line 193: | ||
</td> | </td> | ||
<td> | <td> | ||
<p>[[SystemsSec 2016W Lecture 15| | <p>[[SystemsSec 2016W Lecture 15|Bypassing ASLR and Buffer Overflow Exploits using return-into-libc]] | ||
</p> | </p> | ||
</td> | </td> | ||
<td><p></p></td></tr> | <td><p>Hovav Shacham et al., [http://dx.doi.org/10.1145/1030083.1030124 On the effectiveness of address-space randomization] (ACM CCS, 2004) [http://dl.acm.org.proxy.library.carleton.ca/ft_gateway.cfm?id=1030124&ftid=285463&dwn=1&CFID=588127386&CFTOKEN=74533951 (proxy)]<br> | ||
Hovav Shachem [http://dx.doi.org/10.1145/1315245.1315313 The geometry of innocent flesh on the bone: return-into-libc without function calls (on the x86)] (ACM CCS 2007) [http://dl.acm.org.proxy.library.carleton.ca/ft_gateway.cfm?id=1315313&ftid=476749&dwn=1&CFID=588127386&CFTOKEN=74533951 (proxy)]</p></td></tr> | |||
<tr> | <tr> | ||
<td> | <td> | ||
Line 200: | Line 204: | ||
</td> | </td> | ||
<td> | <td> | ||
<p>[[SystemsSec 2016W Lecture 16| | <p>[[SystemsSec 2016W Lecture 16|Network Firewalls]] | ||
</p> | </p> | ||
</td> | </td> | ||
<td><p></p></td></tr> | <td><p>Bellovin and Cheswick, [http://dx.doi.org/10.1109/35.312843 Network Firewalls] (IEEE Communications Magazine, 1994) [http://ieeexplore.ieee.org.proxy.library.carleton.ca/stamp/stamp.jsp?tp=&arnumber=312843 (proxy)]</p></td></tr> | ||
<tr> | <tr> | ||
<td> | <td> | ||
Line 213: | Line 217: | ||
</p> | </p> | ||
</td> | </td> | ||
<td><p></p></td></tr> | <td><p>Dingledine, Mathewson, and Syverson, [https://www.usenix.org/legacy/events/sec04/tech/dingledine.html Tor: The Second-Generation Onion Router] (USENIX Security 2004)<br>Albert Kwon et al., [https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/kwon Circuit Fingerprinting Attacks: Passive Deanonymization of Tor Hidden Services] (USENIX Security 2015)<br>(background)[https://www.torproject.org/about/overview.html.en Tor: Overview]</p></td></tr> | ||
<tr> | <tr> | ||
<td> | <td> | ||
Line 223: | Line 227: | ||
</p> | </p> | ||
</td> | </td> | ||
<td><p></p></td></tr> | <td><p>Blase Ur et al., [https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/ur Measuring Real-World Accuracies and Biases in Modeling Password Guessability] (USENIX Security 2015)<br> | ||
Nikolaos Karapanos et al., [https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/karapanos Sound-Proof: Usable Two-Factor Authentication Based on Ambient Sound] (USENIX Security 2015)</p></td></tr> | |||
<tr> | <tr> | ||
<td> | <td> | ||
Line 233: | Line 238: | ||
</p> | </p> | ||
</td> | </td> | ||
<td><p></p></td></tr> | <td><p>Giancarlo Pellegrino et al., [https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/pellegrino In the Compression Hornet’s Nest: A Security Study of Data Compression in Network Services] (USENIX Security 2015)<br>Ramya Jayaram Masti et al., [https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/masti Thermal Covert Channels on Multi-core Platforms] (USENIX Security 2015)</p></td></tr> | ||
<tr> | <tr> | ||
<td> | <td> | ||
Line 240: | Line 245: | ||
</td> | </td> | ||
<td> | <td> | ||
<p>[[SystemsSec 2016W Lecture 20| | <p>[[SystemsSec 2016W Lecture 20|DDoS and Pinning]] | ||
</p> | </p> | ||
</td> | </td> | ||
<td><p></p></td></tr> | <td><p>Seyed K. Fayaz et al., [https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/fayaz Bohatei: Flexible and Elastic DDoS Defense] (USENIX Security 2015)<br>Marten Oltrogge and Yasemin Acar, [https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/oltrogge To Pin or Not to Pin—Helping App Developers Bullet Proof Their TLS Connections] (USENIX Security 2015)</p></td></tr> | ||
<tr> | <tr> | ||
<td> | <td> | ||
Line 253: | Line 258: | ||
</p> | </p> | ||
</td> | </td> | ||
<td><p></p></td></tr> | <td><p>David A. Ramos and Dawson Engler, [https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/ramos Under-Constrained Symbolic Execution: Correctness Checking for Real Code] (USENIX Security 2015)<br>Nav Jagpal et al., [https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/jagpal Trends and Lessons from Three Years Fighting Malicious Extensions] (USENIX Security 2015)</p></td></tr> | ||
<tr> | <tr> | ||
<td> | <td> | ||
Line 260: | Line 265: | ||
</td> | </td> | ||
<td> | <td> | ||
<p>[[SystemsSec 2016W Lecture 22| | <p>[[SystemsSec 2016W Lecture 22|Cookie Integrity and XSSI]] | ||
</p> | </p> | ||
</td> | </td> | ||
<td><p></p></td></tr> | <td><p>Xiaofeng Zheng et al., [https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/zheng Cookies Lack Integrity: Real-World Implications] (USENIX Security 2015)<br>Sebastian Lekies et al., [https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/lekies The Unexpected Dangers of Dynamic JavaScript] (USENIX Security 2015)</p></td></tr> | ||
<tr> | <tr> | ||
<td> | <td> | ||
Line 270: | Line 275: | ||
</td> | </td> | ||
<td> | <td> | ||
<p>[[SystemsSec 2016W Lecture 23| | <p>[[SystemsSec 2016W Lecture 23|Boxify and Android Permissions]] | ||
</p> | </p> | ||
</td> | </td> | ||
<td><p></p></td></tr> | <td><p>Michael Backes et al., [https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/backes Boxify: Full-fledged App Sandboxing for Stock Android] (USENIX Security 2015)<br>Primal Wijesekera et al., [https://www.usenix.org/conference/usenixsecurity15/technical-sessions/presentation/wijesekera Android Permissions Remystified: A Field Study on Contextual Integrity] (USENIX Security 2015)</p></td></tr> | ||
<tr> | <tr> | ||
<td> | <td> | ||
Line 280: | Line 285: | ||
</td> | </td> | ||
<td> | <td> | ||
<p>[[SystemsSec 2016W Lecture 24| | <p>[[SystemsSec 2016W Lecture 24|Final Exam Review]] | ||
</p> | </p> | ||
</td> | </td> | ||
Line 286: | Line 291: | ||
<tr> | <tr> | ||
<td> | <td> | ||
<p> | <p>April 18, 10 AM-12 PM | ||
</p> | </p> | ||
</td> | </td> | ||
<td> | <td> | ||
<p> | <p>Last-Minute Study Session in LA B146 | ||
</p> | </p> | ||
</td> | </td> | ||
<td><p></p></td></tr> | <td><p></p></td></tr> | ||
<tr> | <tr> | ||
<td> | <td> | ||
<p> | <p>April 19, 9 AM | ||
</p> | </p> | ||
</td> | </td> | ||
<td> | <td> | ||
<p> | <p>Final Exam | ||
</p> | </p> | ||
</td> | </td> | ||
<td><p></p></td></tr> | |||
</table> | </table> | ||
Line 362: | Line 325: | ||
Use (nested) lists if appropriate for the notes; however, please have some text that isn't bulleted. Please try to make the notes even if you did not attend lecture; however, you don't need to cover every small bit of information that was covered. In particular the notes do not need to include digressions into topics only tangentially related to the course. Complete sentences are welcome but not required. | Use (nested) lists if appropriate for the notes; however, please have some text that isn't bulleted. Please try to make the notes even if you did not attend lecture; however, you don't need to cover every small bit of information that was covered. In particular the notes do not need to include digressions into topics only tangentially related to the course. Complete sentences are welcome but not required. | ||
==Security Reading Analysis Guidelines== | |||
A security reading analysis is a detailed analysis of a security research paper. In it you analyze the key arguments of the paper and give your informed opinion. | |||
Most security papers can be classified as attack or defense papers. You should analyze them differently. | |||
For attack papers: | |||
* What systems are vulnerable to the attack? | |||
* What is the nature of the vulnerability? | |||
* What is the the exploit? In particular, what is its technical core? | |||
* How reproducible is the exploit? | |||
* Are there likely to be many similar exploits, in the targeted system or other systems? | |||
* How difficult will it be mitigate/fix the vulnerability in targeted systems? | |||
For defense papers: | |||
* What is the security problem the paper addresses? In what kind of threat model(s) does the problem exist? | |||
* How significant is the problem? Specifically, to what degree do existing solutions not work sufficiently well? | |||
* What is the defense? How does it work? | |||
* To what degree will the defense potentially solve the targeted security problem? In particular, how difficult will it be for attackers to adapt to this defense? | |||
* What are the challenges facing deployment of the defense? Are they likely to be overcome? | |||
For both kinds of papers, you should give your reaction by addressing questions like the following: | |||
* Did you like the paper? | |||
* Was it easy to understand, or was it hard to read? | |||
* Did you learn much from the paper? | |||
* How surprised were you by the result? | |||
Your analysis should not cover the above questions separately (this would tend to make for a very wordy analysis); instead, use these questions as a guide in writing a short essay (1-2 pages) on the paper in question. | |||
Each analysis will be graded out of 10 as follows: | |||
* U: 3 for demonstrating understanding of the content (preferably without summarizing) | |||
* T: 3 for technical analysis (does it work) | |||
* C: 3 for contextual analysis (does it matter) | |||
* V: 1 for your viewpoint |
Latest revision as of 00:17, 19 April 2016
Course Outline
Here is the course outline.
Hacking Opportunities
The Hacking Opportunities page lists potential hacking opportunities that you can attempt for your hacking journal. If you attempt but do not successfully accomplish one of them, be sure to document what you tried. As you learn more, you may come back to them and try again.
Resources
Readings
- For the first part of the course we will be reading selections from Trent Jaeger's Operating Systems Security textbook. You can download the PDF through Carleton's library. In the reading assignments this text will be referred to as "Jaeger".
- An excellent but dated text on browser security is Michal Zalewski's Browser Security Handbook.
Other Courses
- Dan Boneh ran an excellent course at Stanford in Spring 2015 on Computer and Network Security. This course has many interesting readings that we will not be covering. Also, the assignments are very good sources for hacking opportunities.
- The assignments from the Winter 2015 run of COMP 4108 are available. They are a reasonable start for several hacking opportunities.
Lectures and Exams
Date |
Topic |
Readings |
---|---|---|
Jan. 7 |
Jaeger, Chapter 1 (Introduction) | |
Jan. 12 |
Jaeger, Chapter 2 (Access Control Fundamentals) | |
Jan. 14 |
Jaeger, Chapter 3 (Multics) and Chapter 4 (UNIX & Windows) | |
Jan. 19 |
Jaeger, Chapter 6 (Security Kernels) and Chapter 7 (Securing Commercial Operating Systems) | |
Jan. 21 |
Jaeger, Chapter 9 (LSM & SELinux) and Chapter 10 (Secure Capability Systems) | |
Jan. 26 |
Jaeger, Chapter 11 (Secure Virtual Machine Systems) and Chapter 12 (System Assurance) | |
Jan. 28 |
||
Feb. 2 |
||
Feb. 4 |
||
Feb. 9 |
||
Feb. 11 |
||
Feb. 23 |
||
Feb. 25 |
Midterm (in class) |
|
Mar. 1 |
Aleph One (aka Elias Levy), Smashing The Stack For Fun And Profit (Phrack 49, 1996) | |
Mar. 3 |
Wikipedia, Buffer Overflow Protection |
|
Mar. 8 |
Bypassing ASLR and Buffer Overflow Exploits using return-into-libc |
Hovav Shacham et al., On the effectiveness of address-space randomization (ACM CCS, 2004) (proxy) |
Mar. 10 |
Bellovin and Cheswick, Network Firewalls (IEEE Communications Magazine, 1994) (proxy) | |
Mar. 15 |
Dingledine, Mathewson, and Syverson, Tor: The Second-Generation Onion Router (USENIX Security 2004) | |
Mar. 17 |
Blase Ur et al., Measuring Real-World Accuracies and Biases in Modeling Password Guessability (USENIX Security 2015) | |
Mar. 22 |
Giancarlo Pellegrino et al., In the Compression Hornet’s Nest: A Security Study of Data Compression in Network Services (USENIX Security 2015) | |
Mar. 24 |
Seyed K. Fayaz et al., Bohatei: Flexible and Elastic DDoS Defense (USENIX Security 2015) | |
Mar. 29 |
David A. Ramos and Dawson Engler, Under-Constrained Symbolic Execution: Correctness Checking for Real Code (USENIX Security 2015) | |
Mar. 31 |
Xiaofeng Zheng et al., Cookies Lack Integrity: Real-World Implications (USENIX Security 2015) | |
Apr. 5 |
Michael Backes et al., Boxify: Full-fledged App Sandboxing for Stock Android (USENIX Security 2015) | |
April 7 |
||
April 18, 10 AM-12 PM |
Last-Minute Study Session in LA B146 |
|
April 19, 9 AM |
Final Exam |
Lecture Notes Guidelines
Part of your participation mark is doing notes for at least one of the lectures. Here are the guidelines for those notes.
The class TA Borke (BorkeObadaObieh at cmail.carleton.ca) will be handling course notes. Please contact her to schedule your class to take notes.
Borke or Anil will set you up with an account on this wiki. You'll enter your initial draft notes here and then work with Borke to make sure they are of sufficient quality. This may require a few rounds of revisions; however, if you follow the guidelines below it shouldn't be too bad.
You should plan on organizing your notes as follows:
- Organize them in at least the following sections: Topics & Readings and Notes.
- The Topics & Readings section lists the main topics covered in the class, e.g. "buffer overflows". Please use an unordered bulleted list (using *'s in wiki markup). In this section also list readings relevant to the lecture that were mentioned in class.
- Put your notes in the Notes section.
Use (nested) lists if appropriate for the notes; however, please have some text that isn't bulleted. Please try to make the notes even if you did not attend lecture; however, you don't need to cover every small bit of information that was covered. In particular the notes do not need to include digressions into topics only tangentially related to the course. Complete sentences are welcome but not required.
Security Reading Analysis Guidelines
A security reading analysis is a detailed analysis of a security research paper. In it you analyze the key arguments of the paper and give your informed opinion.
Most security papers can be classified as attack or defense papers. You should analyze them differently.
For attack papers:
- What systems are vulnerable to the attack?
- What is the nature of the vulnerability?
- What is the the exploit? In particular, what is its technical core?
- How reproducible is the exploit?
- Are there likely to be many similar exploits, in the targeted system or other systems?
- How difficult will it be mitigate/fix the vulnerability in targeted systems?
For defense papers:
- What is the security problem the paper addresses? In what kind of threat model(s) does the problem exist?
- How significant is the problem? Specifically, to what degree do existing solutions not work sufficiently well?
- What is the defense? How does it work?
- To what degree will the defense potentially solve the targeted security problem? In particular, how difficult will it be for attackers to adapt to this defense?
- What are the challenges facing deployment of the defense? Are they likely to be overcome?
For both kinds of papers, you should give your reaction by addressing questions like the following:
- Did you like the paper?
- Was it easy to understand, or was it hard to read?
- Did you learn much from the paper?
- How surprised were you by the result?
Your analysis should not cover the above questions separately (this would tend to make for a very wordy analysis); instead, use these questions as a guide in writing a short essay (1-2 pages) on the paper in question.
Each analysis will be graded out of 10 as follows:
- U: 3 for demonstrating understanding of the content (preferably without summarizing)
- T: 3 for technical analysis (does it work)
- C: 3 for contextual analysis (does it matter)
- V: 1 for your viewpoint