Date |
Topic |
Readings |
Mar. 31 |
Security and Crypto Basics I |
|
Apr. 2 |
Security and Crypto Basics II |
|
Apr. 9 |
Crypto Failures |
Assigned:
Recommended:
-
The Matter of Heartbleed. Durumeric, Kasten, Adrian, Halderman, Bailey, Li, Weaver, Amann, Beekman, Payer, Paxson. IMC. 2014.
-
Why Information Security is Hard - An Economic Perspective. Anderson. ACSAC. 2001.
-
Cryptanalysis of the Windows Random Number Generator. Dorrendorf, Gutterman, Pinkas. CCS. 2007.
-
The Most Dangerous Code in the World. Georgiev, Iyengar, Jana, Anubhai, Boneh, Shmatikov. CCS. 2012.
|
Apr. 10 |
TLS and HTTPS |
Assigned:
Recommended:
|
Apr. 14 |
Passwords |
Assigned:
Recommended:
|
Apr. 16 |
Usable Security |
Assigned:
Recommended:
-
The psychology of security for the home computer user. Howe, Ray, Roberts, Urbanska, Byrne. Oakland. 2012.
-
Alice in warningland: a large-scale field study of browser security warning effectiveness. Akhawe, Felt. Usenix Security. 2013.
-
Why (Special Agent) Johnny (Still) Can't Encrypt: A Security Analysis of the APCO Project 25 Two-Way Radio System. Clark, Goodspeed, Metzger, Wasserman, Xu, Blaze. Usenix Security. 2011.
|
Apr. 21 |
Web Security |
Assigned:
Recommended:
|
Apr. 23 |
Isolation |
Assigned:
-
Native client: A sandbox for portable, untrusted x86 native code. Yee, Sehr, Dardyk, Chen, Muth, Ormandy, Okasaka, Narula, Fullagar. Oakland. 2009.
-
Capsicum: practical capabilities for UNIX. Watson, Anderson, Laurie, Kennaway. Usenix Security. 2010.
Recommended:
|
Apr. 28 |
Trusted Computing |
Assigned:
Recommended:
-
Reflections on trusting trust. Thompson. Communications of the ACM. 1984.
-
The ten page introduction to trusted computing. Martin, Others. Computing Laboratory, Oxford University Oxford. 2008.
-
TrInc: Small Trusted Hardware for Large Distributed Systems. Levin, Douceur, Lorch, Moscibroda. NSDI. 2009.
-
Logical attestation: an authorization architecture for trustworthy computing. Sirer, de Bruijn, Reynolds, Shieh, Walsh, Williams, Schneider. SOSP. 2011.
|
Apr. 30 |
BFT |
Assigned:
|
May. 5 |
Untrusted Cloud I |
Assigned:
Recommended:
|
May. 7 |
Untrusted Cloud II |
Assigned:
Recommended:
|
May. 12 |
Untrusted Cloud III |
Assigned:
|
May. 14 |
Verifiable Computation I |
Assigned:
Recommended:
-
Making argument systems for outsourced computation practical (sometimes). Setty, McPherson, Blumberg, Walfish. NDSS. 2012.
-
Taking proof-based verified computation a few steps closer to practicality. Setty, Vu, Panpalia, Braun. Usenix Security. 2012.
-
Resolving the conflict between generality and plausibility in verified computation. Setty, Braun, Vu, Blumberg, Parno, Walfish. EuroSys. 2013.
|
May. 21 |
Verifiable Computation II |
Assigned:
Recommended:
|
May. 22 |
Privacy and Web Advertising |
Assigned:
Recommended:
|
May. 26 |
Anonymity and Anticensorship |
Assigned:
Recommended:
-
The parrot is dead: Observing unobservable network communications. Houmansadr, Brubaker, Shmatikov. Oakland. 2013.
-
A Critical Evaluation of Website Fingerprinting Attacks. Juarez, Afroz, Acar, Diaz, Greenstadt, Berkeley. CCS. 2014.
-
Dissent: Accountable Anonymous Group Messaging. Corrigan-Gibbs, Ford. CCS. 2010.
-
Proactively Accountable Anonymous Messaging in Verdict. Corrigan-Gibbs, Wolinsky, Ford. Usenix Security. 2013.
|
May. 28 |
Cryptocurrencies |
Assigned:
Recommended:
|
Jun. 2 |
Vulnerabilities in Cloud-Hosted VMs |
Assigned:
Recommended:
|
Jun. 4 |
Secure Deletion |
Assigned:
-
Vanish: Increasing data privacy with self-destructing data. Geambasu, Kohno, Levy, Levy. Usenix Security. 2009.
-
Defeating Vanish with Low-Cost Sybil Attacks Against Large DHTs. Wolchok, Hofmann, Heninger, Felten, Halderman, Rossbach, Waters, Witchel. NDSS. 2010.
Recommended:
-
SoK: Secure data deletion. Reardon, Basin, Capkun. Oakland. 2013.
-
Shredding your garbage: Reducing data lifetime through secure deallocation. Chow, Pfaff, Garfinkel, Rosenblum. Usenix Security. 2005.
-
Eternal Sunshine of the Spotless Machine: Protecting Privacy with Ephemeral Channels.. Dunn, Lee, Jana, Kim, Silberstein, Xu, Shmatikov, Witchel. OSDI. 2012.
|