Title: CS 6301-002: Language-based Security
Class/Course Registration Number: 87670 / 014135
Times: MW 1:00–2:15
Location: CB1 1.104
Instructor: Dr. Kevin Hamlen (hamlen AT utdallas)
Instructor's Office Hours: MW 2:15–3:15, ECSS 3.704
Teaching Assistant: Jun Duan
TA Office Hours: F 10:00–noon, ECSS 2.104A1 (Last Name A-F)
This course introduces and surveys the field of Language-based Software Security, in which techniques from compilers and programming language theory are leveraged to address issues in computer security. Topics include:
The aim of the course is to allow each student to develop a solid understanding of at least one of these topics, along with a more general familiarity with the range of research in the field. In-course discussion will highlight opportunities for cutting-edge research in each area. If you conduct work involving software security, this course will provide you with an array of powerful tools for addressing software security issues. If your work involves programming language design and implementation, this course will show you how to take techniques that you already know and apply them to a new and important problem domain. If your career involves management or development of high-assurance software systems, this course will provide a comparative analysis of traditional versus language-based techniques.
The course is open to Ph.D. students and Masters students. Interested undergraduates should see the instructor for permission to take the course.
Suggested complementary course: Interested students may wish to consider taking CS 6371 Advanced Programming Languages before/after this course or concurrently, since it presents material that supplements and enhances several of the above topics.
Homework (30%): For the first 10 weeks of the course, students will complete a series of programming exercises assigned through eLearning. Background material helpful for completing the exercises can be found in the online textbook Software Foundations.
Quizzes (30%): Most classes will begin with a short quiz testing the students comprension of an assigned reading for the day. Questions will typically be multiple choice or short answer. The easier questions will be designed to test whether the student has read the material, and the harder ones will test deeper understanding of more subtle points.
Class Participation (10%): Students are expected to come to class having read the assigned paper(s), and prepared with questions, critiques, and discussion topics. Regular attendance and class participation will count 10% towards their grades in the course.
Project (30%): Students will work individually or in a small team for the last 6 weeks of the course to complete a small project. A typical project will involve implementing and/or formally verifying a language-based security mechanism covered in the class or related to class material. Students conducting research are encouraged to choose projects that synergize with their research activities. Students will present their projects in class, with the presentation counting toward their project grade.
In our study of the Coq theorem proving system, we will be using the following online textbook:
For those who wish to explore Coq in greater depth (e.g., for developing projects), the following book by the Coq developers is recommended:
Additionally, the following text available through the UTD library may be useful for general background on type theory and functional programming:
| Date | Topic | Assigned Reading(s) | Coq Exercises |
| Program-Proof Co-development | |||
| Lecture 1: Mon 8/19 |
Introduction to Language-based Security Lecture Slides Binary Search in Coq |
Assignment 1 due 8/28 (Coq Basics) |
|
| Lecture 2: Wed 8/21 |
Functional Programming with Coq Coq transcript |
Software Foundations: Basics chapter, up to and including the first two exercises (nandb, andb3). | |
| Lecture 3: Mon 8/26 |
Parametric Polymorphism Coq transcript |
F. Williams. Investigating SANS/CWE Top 25 Programming Errors. Tech. Rep. ICTN 6870, E. Carolina University, 2009. | |
| Lecture 4: Wed 8/28 |
Curry-Howard Isomorphism Coq transcript |
J. Walden, J. Stuckman, and R. Scandariato. Predicting Vulnerable Components: Software Metrics vs Text Mining. In Proc. 25th Int. Sym. Software Reliability Engineering (ISSRE), pp. 23–33, November 2014. | |
| No Class: Mon 9/2 |
No class: Labor Day | Assignment 2 due 9/11 (Induction) |
|
| Lecture 5: Wed 9/4 |
Inductive Propositions Coq transcript Coq tactic quick-reference sheet |
P. Hudak. Conception, Evolution, and Application of Functional Programming Languages. ACM Computing Surveys, 21(3):359–411, May 1989.
|
|
| Lecture 6: Mon 9/9 |
Logical Operators Coq transcript |
X. Leroy. Formal Verification of a Realistic Compiler. Communications of the ACM, 52(7):107–115, 2009. | |
| Lecture 7: Wed 9/11 |
Constructivistic Logic | no assigned reading | |
| Language-based Security Foundations | |||
| Lecture 8: Mon 9/16 |
The Science of Software Security Coq transcript Lecture Slides |
J. Bau and J. C. Mitchell. Security Modeling and Analysis. IEEE Security & Privacy 9(3):18–25, 2011. | Assignment 3 due 9/23 (Lists) |
| Lecture 9: Wed 9/18 |
Software Model-checking Lecture Slides |
M. Müller-Olm, D. Schmidt, and B. Steffen. Model-Checking: A Tutorial Introduction. In Proc. 6th Int. Sym. Static Analysis (SAS), pp. 330–354, September 1999.
|
|
| Lecture 10: Mon 9/23 |
Superset Disassembly | E. Bauman, Z. Lin, and K.W. Hamlen. Superset Disassembly: Statically Rewriting x86 Binaries Without Heuristics. In Proc. Network and Distributed Systmes Security Sym. (NDSS), 2018. | |
| Code-reuse Attacks and Defenses | |||
| Lecture 11: Wed 9/25 |
Return-oriented Programming Lecture Slides |
E.J. Schwartz, T. Avgerinos, and D. Brumley. Q: Exploit Hardening Made Easy. In Proc. 20th USENIX Security Symposium, 2011. | Assignment 4 due 9/30 (Polymorphism) |
| Lecture 12: Mon 9/30 |
Artificial Diversity Lecture Slides |
H. Shacham, M. Page, B. Pfaff, E.-J. Goh, N. Modadugu, and D. Boneh. On the Effectiveness of Address-Space Randomization. In Proc. ACM Conf. Computer and Communications Security (CCS), pp. 298–307, 2004. | |
| Lecture 13: Wed 10/2 |
Control-flow Integrity Lecture Slides |
M. Abadi, M. Budiu, Ú. Erlingsson, and J. Ligatti. Control-Flow Integrity: Principles, Implementations, and Applications. In Proc. ACM Conf. Computer and Communications Security, pp. 340–353, 2005. | Assignment 5 due 10/9 (Logical Operators) |
| Lecture 14: Mon 10/7 |
Binary Stirring Lecture Slides |
R. Wartell, V. Mohan, K.W. Hamlen, and Z. Lin. Binary Stirring: Self-randomizing Instruction Addresses of Legacy x86 Binary Code. In Proc. ACM Conf. Computer and Communications Security (CCS), 2012. | |
| Lecture 15: Wed 10/9 |
Binary Attack Surface Reduction | M. Ghaffarinia and K.W. Hamlen. Binary Control-flow Trimming. In Proc. ACM Conf. Computer and Communications Security (CCS), 2019. | |
| In-lined Reference Monitors | |||
| Lecture 16: Mon 10/14 |
Theory of IRMs Lecture Slides |
F.B. Schneider. Enforceable Security Policies. ACM Transactions on Information and System Security, 3(1):30–50, 2000. | Assignment 6 due 10/28 (Inductive Props) |
| Lecture 17: Wed 10/16 |
Cryptojacking Project Summary Slides |
W. Wang, B. Ferrell, X. Xu, K.W. Hamlen, and S. Hao. SEISMIC: SEcure In-lined Script Monitors for Interrupting Cryptojacks. In Proc. European Sym. on Research in Computer Security (ESORICS), 2018. | |
| Lecture 18: Mon 10/21 |
IRM Validation Lecture slides |
K.W. Hamlen, M.M. Jones, and M. Sridhar. Aspect-oriented Runtime Monitor Certification. In Proc. 18th Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp. 126–140, March–April 2012. | |
| Lecture 19: Wed 10/23 |
Web Scripting Security Lecture slides |
P.H. Phung, M. Monshizadeh, M. Sridhar, K.W. Hamlen, and V.N. Venkatakrishnan. Between Worlds: Securing Mixed JavaScript/ActionScript Multi-party Web Content. IEEE Transactions on Dependable and Secure Computing (TDSC), 12(4):443–457, July–August 2015. | |
| Lecture 20: Mon 10/28 |
Machine-checked Native Code Validation See Picinæ project files on eLearning. |
D. Brumley, I. Jager, T. Avgerinos, and E.J. Schwartz. BAP: A Binary Analysis Platform. In Proc. Int. Conf. Computer Aided Verification (CAV), 2011. | |
| Confidentiality Enforcement | |||
| Lecture 21: Wed 10/30 |
Intro to Information Flow Lecture slides |
A. Sabelfeld and A.C. Myers. Language-Based Information-Flow Security. IEEE J. Selected Areas in Communications, 21(1):5–19, 2003. | Project due 12/16 Project Slides |
| Lecture 22: Mon 11/4 |
Type-based Information Flow Controls Lecture on Picinæ (see eLearning files) |
A.C. Myers. JFlow: Practical Mostly-Static Information Flow Control. In Proc. 26th ACM Sym. Principles of Programming Languages (POPL), pp. 228–241, 1999. | |
| Current Research | |||
| Lecture 23: Wed 11/6 |
Cyber-deceptive Software Engineering Lecture slides |
F. Araujo, K.W. Hamlen, S. Biedermann, and S. Katzenbeisser. From Patches to Honey-Patches: Lightweight Attacker Misdirection, Deception, and Disinformation. In Proc. ACM Computer and Communications Security (CCS), 2014. | |
| Lecture 24: Mon 11/11 |
Binary Rewriting Compatibility Challenges | X. Xu, M. Ghaffarinia, W. Wang, K.W. Hamlen, and Z. Lin. ConFIRM: Evaluating Compatibility and Relevance of Control-flow Integrity Protections for Modern Software. In Proc. USENIX Security Symposium, 2019. | |
| Lecture 25: Wed 11/13 |
Object Flow Integrity | W. Wang, X. Xu, and K.W. Hamlen. Object Flow Integrity. In Proc. ACM Computer and Communications Security (CCS), 2017. | |
| Lecture 26: Mon 11/18 |
Future Research | no assigned reading | |
| Conclusions | |||
| Lecture 27: Wed 11/20 |
Project Team Meetings | no assigned reading | |
| No Class: Mon 11/25 |
No class: Fall break | ||
| No Class: Wed 11/27 |
No class: Fall break | ||
| Lecture 28: Mon 12/2 |
Project Presentations
|
||
| Lecture 29: Wed 12/4 |
Project Presentations
|
||