- (18/5) Slides for Steven Van Acker's lecture on advanced web security are now up.
- (9/5) Notes from the course evaluation meeting with student representatives are now available.
- (4/5) A list that maps group numbers to email addresses has been posted to discussion group. Go ahead and exchange project report drafts with your opposing group by email before the deadline.
- (4/5) Project presentation schedule is now available (see below). Note that the presentation time is 7 minutes + 1 minute for questions. Groups with subsequent numbers are each others' "opponents". For example, groups 1 and 2 oppose each other and so on.
- (2/5) Slides for the web application security lecture have been updated.
- (23/3) The lab submission system is now online.
- (21/3) Slides for lecture 1 have been updated.
- (17/3) The student representatives for course evaluation are:
MPCSN nejads AT student.chalmers.se SOROUSH DASHTESTAN NEJAD MPALG fadeev AT student.chalmers.se ALEXEY FADEEV MPCSN noras AT student.chalmers.se NORÄS SALMAN TELTA sifr AT student.chalmers.se FREDRIK T SINKKONEN
- (14/3) Registration for the OWASP Gothenburg event on Static Code Analysis for the Masses on Mar 22 is open. First come, first served!
- (14/3) For the labs and the project, you need to work in groups of two. There will be an opportunity for group matching at the break of the first lecture. If you have difficulties finding a partner, please use the discussion group.
- (14/3) Course discussion group is up and running. Discussion of general questions, labs, and projects is welcome. Helping each other to find answers is encouraged, but of course without giving away solutions.
- (14/3/2016). First lecture: Monday, Mar 21.
Security specializationThis course is a part of the Chalmers and GU Security Specialization, a package of four courses in computer security.
Why language-based security?Traditionally, computer security has been largely enforced at the level of operating systems. However, operating-system security policies are low-level (such as access control policies, protecting particular files), while many attacks are high-level, or application-level (such as email worms that pass by access controls pretending to be executed on behalf of a mailer application). The key to defending against application-level attacks is application-level security. Because applications are typically specified and implemented in programming languages, this area is generally known as language-based security. A direct benefit of language-based security is the ability to naturally express security policies and enforcement mechanisms using the developed techniques of programming languages.
Who should study language-based security?You should have previously studied a course in programming languages (and of course basic programming skills are assumed) and basics of computer security. It is an advantage if you have studied courses such as semantics of programming languages and compiler construction.
You should be interested in some of the following:
- Obtaining a deeper understanding of programming language-based concepts for computer security.
- The design and implementation of security mechanisms.
- Computer science research in the area of programming languages and security.
What will you learn?After the course, you should be able to apply practical knowledge of security for modern programming languages. This includes the ability to identify application- and language-level security threats, design and argue for application- and language-level security policies, and design and argue for the security, clarity, usability, and efficiency of solutions, as well as implement such solutions in expressive programming languages. You should be able to demonstrate the critical knowledge of principles behind such application-level attacks as race conditions, buffer overruns, and code injections. You should be able to master the principles behind such language-based protection mechanisms as static security analysis, program transformation, and reference monitoring.
ContentThis course combines practical and cutting-edge research material. For the practical part, the dual perspective of attack vs. protection is threaded through the lectures, laboratory assignments, and projects. For the cutting-edge research part, the course's particular emphasis is on the use of formal, or semantic, models of program behaviour for specifying and enforcing security properties.
PrerequisitesKnowledge of the material covered in the courses Programming Languages and Computer Security is recommended although not required as a prerequisite.
Instructor and TAsInstructor: Andrei Sabelfeld, office 5476, voice 1018 (Chalmers).
Course literatureNo specific book is used as a course book. The material consists of hand-outs, papers, etc. However, I recommend the following book for complimentary reading on the subject:
- Building Secure Software: How to Avoid Security Problems the Right Way by John Viega and Gary McGraw, Addison-Wesley, 2001, 528 pages.
Lecture/supervision schedule and deadlines
The schedule is subject to change. Stay tuned!
Last year's lecture slides are already on the web, but changes and updates may be done before the actual lecture. If these updates are substantial then it will be indicated in the latest news section.
In order to view the slides, you need to be under the .se domain. Otherwise, let us know your domain - we will include it in the permission set.
All deadlines are firm.
|Mon, Mar 21, 10-12, EF||Introduction to language-based security. Overview of the
McGraw and Morrisett, Attacking
Malicious Code: A Report to the Infosec Research
Sect. I of Saltzer and Schroeder, Protection of Information in Computer Systems, 1975.
|Tue, Mar 22||OWASP Gothenburg event: Static Code Analysis for the Masses. Registration is here. First come, first served!|
|Wed, Mar 23, 13-15, ED||Design principles for security protocols||Abadi and Needham, Prudent Engineering Practice for Cryptographic Protocols, 1995.|
|Mon, Apr 11, 10-12, EF||Information flow security
|Sabelfeld and Myers, Language-Based
Information-Flow Security, 2003.|
Try this information flow exercise. See below for exercise supervision time. Bonus: JSFlow challenge.
|Wed, Apr 13, 10-12, ED-3507||Exercise: Information Flow Challenge||Bonus: JSFlow challenge.|
|Wed, Apr 13, 13-15, ED-5476||Office hours to consult on project proposals|
|Fri, Apr 15||Project proposal deadline|
|Mon, Apr 18, 10-12, EF||Data races, randomness, and determinism
|Savage, Burrows, Nelson, Sobalvarro, and Anderson, Eraser:
A Dynamic Data Race Detector for Multithreaded Programs, 1997.
Rafnsson and Sabelfeld, Secure Multi-Execution: Fine-grained, Declassification-aware, and Transparent, 2013.
Clark and Hunt, Noninterference for Deterministic Interactive Programs, 2008.
|Thu, Apr 21, 15-17, ED-3507||ToCToU lab supervision|
|Fri, Apr 22||ToCToU lab deadline|
|Mon, Apr 25, 10-12, EF||Buffer overruns; Database security; Privacy-violating information
flow in web applications|
|Aleph One, Smashing
the Stack for Fun and Profit.
Claes Nyberg's slides and tutorial with exercises.
|Wed, Apr 27, 10-12, ED-3507||r00tshell lab supervision|
|Wed, Apr 27, 13-15, ED||
Advanced Information Flow: Jif, Fabric, Timing Channels
Invited lecture by Aslan Askarov, Aarhus University.
|Jif, Fabric, Timing: 1 and 2.|
|Fri, Apr 29, 10-12, ED-3507||r00tshell lab supervision|
|Fri, Apr 29||r00tshell lab deadline|
|Mon, May 2, 10-12, EF||Web-application security
|OWASP Excess XSS, tutorial by Jakob Kallin and Irene Lobo Valbuena, from their course project in 2013|
|Wed, May 4, 10-12, ED-3507||WebAppSec lab supervision|
|Fri, May 6||WebAppSec lab deadline|
|Mon, May 9, 10-12, EF|| Java security, Stack inspection and access
Certifying compilation; Typed Assembly Languages, Proof-Carrying Code; Copyright protection and code obfuscation
|Wallach, Felten, Understanding
Java Stack Inspection, 1998.|
Morrisett, Walker, Crary, Glew, From System F to Typed Assembly Language, 1999.
|Mon, May 9, 13-15, ED-5475||Office hours to consult on projects|
|Wed, May 11, 13-15, ED||
Advanced web application security|
Lecture by Steven Van Acker.
|Thu, May 12||Project draft to opponents|
|Mon, May 16, 10-12, EF||Project presentations|
Presentation time: 7 minutes + 1 minute for questions (strict limit!), following the presentation guidelines. If you are unable to use your laptop for the presentation, just email your powerpoint/pdf presentation to me in advance.
The opponent group must be present and ask at least two questions. Range of groups (as in Fire) to present projects:
Groups 1-11 (except for group 7).
Groups with subsequent numbers are each others' "opponents". For example, groups 1 and 2 oppose each other and so on.
|Wed, May 18, 10-12, ED||Project presentations continued.
Note that this slot is on Wed morning!
Groups 7, 12-15, 17, 19-22.
|Wed, May 18, 13-15, ED||Project presentations continued. Groups 23-26, 28-29, 31-32.|
|Wed, May 25, 13-15, ED||Project presentations continued. Groups 16, 27, 34-44.|
|Fri, May 27||Project report deadline|
ExercisesIn order to get up to speed on information flow, try this information flow challenge. See the schedule for the a supervision slot for working on this exercise. Bonus: JSFlow challenge.
Lab assignments and project
You are expected to find a lab partner, with whom you will do the assignments (laborations). If you have difficulties finding a partner, please use the discussion group. No one-person or three-person groups are allowed unless there is a well-justified reason and permission from the instructor.
There are three assignments ("laborations") and a project. The lab are about specific problems whereas projects can be more open-ended (some ideas for projects are supplied below). Further information on the lab and project:
- ToCToU lab (on data races)
- r00tshell lab (on buffer overruns)
- WebAppSec lab (on web application security)
The supervision takes place according to the schedule above.
In case you have passed some of the labs and/or project in previous years, no need to resumbit the solutions. However, you still need to submit a short text file for each passed lab/project saying when (what year) you passed it.