CS 595C
Side Channel Analysis via Model Counting Constraint Solvers
Fall 2016

Description:

Schedule and Presentations

• Week 1 (Monday, 9-26, 3:00pm at HFH 1132): Introduction & Overview
• Week 2 (Monday, 10-3, 4:00pm at HFH 1132): Fish Wang will present (slides): Timing Analysis of Keystrokes and Timing Attacks on SSH. Dawn Xiaodong Song, David Wagner, Xuqing Tian.
• Week 3 (Thursday, 10-13, 11:00am at HFH 1152): Miroslav Gavrilov will present (slides): An information-theoretic model for adaptive side-channel attacks. Boris Köpf, David Basin.
• Week 4 (Thursday, 10-20, 11:00am at HFH 1152): Tegan Brennan will present (slides): Measuring Information Leakage Using Generalized Gain Functions Mario S. Alvim, Kostas Chatzikokolakis, Catuscia Palamidessi, Geoffrey Smith.
• Week 5 (Thursday, 10-27, 11:00am at HFH 1152): Lucas Bang will present: String Analysis for Side Channels with Segmented Oracles. Lucas Bang, Abdulbaki Aydin, Quoc-Sang Phan, Corina S. Pasareanu, and Tevfik Bultan.
• Week 6 (Thursday, 11-3, 11:00am at HFH 1152): Ismet Burak Kadron will present (slides): The good old Davis-Putnam procedure helps counting models. Elazar Birnbaum, Eliezer L. Lozinskii.
• Week 7 (Thursday, 11-10, 11:00am at HFH 1152): Sanjana Sahayaraj will present (slides) Quantifying information leaks in software. Jonathan Heusser, Pasquale Malacaria.
• Week 8 (Thursday, 11-17, 11:00am at HFH 1152): Seemanta Saha will present: Automatic Discovery and Quantification of Information Leaks. Michael Backes, Boris Köpf, Andrey Rybalchenko.
• Week 9 (MONDAY, 11-21, 4:00pm at HFH 1152): William Eiers will present: Approximate Probabilistic Inference via Word-Level Counting. Supratik Chakraborty, Kuldeep S. Meel, Rakesh Mistry, Moshe Y. Vardi
• Week 10 (Thursday, 12-1, 11:00am at HFH 1152): Xiaofei Du will present: Speeding Up SMT-Based Quantitative Program Analysis. Daniel J. Fremont and Sanjit A. Seshia.
  Binhan Xu will present: On the relation between Differential Privacy and Quantitative Information Flow. Mario S. Alvim, Miguel E. Andres.

Course Work

• Each student has to read all the papers that are presented every week and participate in the discussion.
• Each student will be asked to present one week:
  • Please prepare slides for presenting the high level ideas. Use the whiteboard for detailed discussions and examples.

Reading List

• Side Channel Analysis
  1. Timing Analysis of Keystrokes and Timing Attacks on SSH. Dawn Xiaodong Song, David Wagner, Xuqing Tian.
  2. An information-theoretic model for adaptive side-channel attacks. Boris Köpf, David Basin.
  3. Automatically deriving information-theoretic bounds for adaptive side-channel attacks. Boris Köpf, David Basin.
  4. On the Foundations of Quantitative Information Flow. Geoffrey Smith.
  5. Automatic Discovery and Quantification of Information Leaks. Michael Backes, Boris Köpf, Andrey Rybalchenko.
  6. Quantitative Security Analysis for Programs with Low Input and Noisy Output. Tri Minh Ngo, Marieke Huisman.
  7. Quantitative information flow under generic leakage functions and adaptive adversaries M. Boreale, Francesca Pampaloni.
  8. Measuring Information Leakage Using Generalized Gain Functions Mario S. Alvim, Kostas Chatzikokolakis, Catuscia Palamidessi, Geoffrey Smith.
  9. Multi-run Side-Channel Analysis Using Symbolic Execution and Max-SMT. Corina S. Pasareanu, Quoc-Sang Phan, Pasquale Malacaria.
  10. SMT-Based Verification of Software Countermeasures against Side-Channel Attacks. Hassan Eldib, Chao Wang, Patrick Schaumont.
  11. Assessing security threats of looping constructs. Pasquale Malacaria.
  12. A static analysis for quantifying information flow in a simple imperative language. David Clark, Sebastian Hunt, Pasquale Malacaria. Alternate link
  13. Quantifying information leaks in software. Jonathan Heusser, Pasquale Malacaria.
  14. Symbolic quantitative information flow. Quoc-Sang Phan, Pasquale Malacaria, Oksana Tkachuk, Corina S. Pasareanu.
  15. On the relation between Differential Privacy and Quantitative Information Flow. Mario S. Alvim, Miguel E. Andres.
• Model Counting and SMT
  1. Speeding Up SMT-Based Quantitative Program Analysis. Daniel J. Fremont and Sanjit A. Seshia.
  2. A Model Counter For Constraints Over Unbounded Strings. Loi Luu, Shweta Shinde, Prateek Saxena.
  3. The good old Davis-Putnam procedure helps counting models. Elazar Birnbaum, Eliezer L. Lozinskii.
  4. Satisfiability modulo counting: a new approach for analyzing privacy properties. Matthew Fredrikson, Somesh Jha.
  5. Symbolic Polytopes for Quantitative Interpolation and Verification. Klaus v. Gleissenthall1, Boris Kopf, and Andrey Rybalchenko.
  6. An Automata-Theoretic Algorithm for Counting Solutions to Presburger Formulas. Erin Parker, Siddhartha Chatterjee.
  7. Abstract model counting: a novel approach for quantification of information leaks. Quoc-Sang Phan, Pasquale Malacaria.
  8. A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension Is Fixed. Alexander I. Barvinok.
  9. Effective lattice point counting in rational convex polytopes. Jesús A. De Loerab, Raymond Hemmeckeb, Jeremiah Tauzera, Ruriko Yoshidab.
  10. Distribution-Aware Sampling and Weighted Model Counting for SAT. Supratik Chakraborty, Daniel J. Fremont, Kuldeep S. Meel, Sanjit A. Seshia, Moshe Y. Vardi.
  11. From Weighted to Unweighted Model Counting. Supratik Chakraborty, Dror Fried, Kuldeep S. Meel, Moshe Y. Vardi.
  12. Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi.
  13. Approximate Probabilistic Inference via Word-Level Counting. Supratik Chakraborty, Kuldeep S. Meel, Rakesh Mistry, Moshe Y. Vardi.