Data-Driven Synthesis of Provably Sound Side Channel Analyses
Not on the map. Why?
Abstract (arXiv)
We propose a data-driven method for synthesizing a static analyzer to detect side-channel information leaks in cryptographic software. Compared to the conventional way of manually crafting such a static analyzer, which can be labor intensive, error prone and suboptimal, our learning-based technique is not only automated but also provably sound. Our analyzer consists of a set of type-inference rules learned from the training data, i.e., example code snippets annotated with ground truth. Internally, we use syntax-guided synthesis (SyGuS) to generate new features and decision tree learning (DTL) to generate type-inference rules based on these features. We guarantee soundness by formally proving each learned rule via a technique called Datalog query containment checking. We have implemented our technique in the LLVM compiler and used it to detect power side channels in C programs. Our results show that, in addition to being automated and provably sound during synthesis, the learned analyzer also has the same empirical accuracy as two state-of-the-art, manually crafted analyzers while being 300X and 900X faster, respectively.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Feb 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 1; 2024: 1.
4 papers.
- 2024FairQuant: Certifying and Quantifying Fairness of Deep Neural Networks5 Sep 2024
- 2023Certifying the Fairness of KNN in the Presence of Dataset Bias17 Jul 2023
- 2022NeuDep: Neural Binary Memory Dependence Analysis4 Oct 2022
- 2022Example-based Synthesis of Static Analysis Rules19 Apr 2022