CS 239: Efficient Cryptography-Based Systems

Instructor: Sam Kumar

Lecture: MW 12:00-2:00 PM, 3134 Rolfe Hall

Office Hours: M 9:00-10:00 AM, W 2:00-3:00 PM, and by appointment, 496B Engineering VI

Course announcements will posted on Piazza.

Course Description

Cryptography is an invaluable tool to build secure and privacy-preserving computer systems. Particularly in recent years, both academia and industry have shown enthusiasm for systems that leverage advanced cryptography to provide rich functionality in a secure, privacy-preserving way. In this course, we will study the interplay between cryptography and computer system design. We will focus on both how cryptography can enable new kinds of systems with rich functionality and stronger privacy and security guarantees, and how careful system design can reduce the costs/overheads of using advanced cryptography. Students will read assigned research papers before class, present one or more papers during the quarter, and complete a course project. A solid foundation in systems and/or basic cryptography is expected.

Assignments

• Paper Write-Ups. Before each class, students are expected to complete a short write-up for assigned paper, consisting of a paper summary and supplementary questions. You should submit the write-ups on Gradescope. You are allowed to skip a total of 4 write-ups without penalty.
• Paper Presentation. Each class will have student presenters, usually one for each reading.
• Final Project. Students are expected to work on a research project relevant to the course. More information is available on the final project page.

Grades will be assigned based on the following breakdown: 20% paper write-ups, 30% class participation (paper presentation and discussion), and 50% final project.

Course Format

This is a seminar course focused on reading and discussing research papers. Most class meetings will have two assigned research papers, which students should read before coming to class. In each class, we will have a 20-30 minute student presentation for each paper, followed by guided discussion of the paper. We will spend the remaining time on lecture or structured discussion in preparation for the next class.

Resources

• How to Read a Paper by S. Keshav
• A Graduate Course in Applied Cryptography by Dan Boneh and Victor Shoup
• Operating Systems: Three Easy Pieces by Remzi H. Arpaci-Dusseau and Andrea C. Arpaci-Dusseau
• Relevant undergraduate UCLA courses: CS 111 (Operating Systems Principles), CS 136 (Introduction to Computer Security), CS 183 (Introduction to Cryptography), ECE 188 (Secure Computing Systems)
• Relevant conferences: SOSP, OSDI, NSDI, USENIX Security, S&P, CCS, NDSS