From the 1 of 3 linked papers with an AI index.
1 citations · 1 across the 1 of their papers we have counts for
3 papers
Decompiling for Constant-Time Analysis
Santiago Arranz-Olmos, Gilles Barthe, Lionel Blatter +3
The paper investigates the reliability of the Decompile‑then‑Analyze (DtA) approach for verifying constant‑time (CT) security of compiled code, showing that existing decompilers ca…
(Dis)Proving Spectre Security with Speculation-Passing Style
Santiago Arranz-Olmos, Gilles Barthe, Lionel Blatter +2
Constant-time (CT) verification tools are commonly used for detecting potential side-channel vulnerabilities in cryptographic libraries. Recently, a new class of tools, called spec…
KEM-IND-CCA-Preserving Compilation of Jasmin's ML-KEM
Santiago Arranz-Olmos, Gilles Barthe, Lionel Blatter +4
High-assurance cryptography provides strong guarantees that source implementations are functionally correct and provably secure. In this paper, we demonstrate that the Jasmin compi…