Protecting Cryptographic Code Against Spectre-RSB: (and, in Fact, All Known Spectre Variants)

Spectre attacks void the guarantees of constant-time cryptographic code by leaking secrets during speculative execution. Recent research shows that such code can be protected from Spectre-v1 attacks with minimal overhead, but leaves open the question of protecting against other Spectre variants. In this work, we design, validate, implement, and verify a new approach to protect cryptographic code against all known classes of Spectre attacks, in particular Spectre-RSB. Our approach combines a new value-dependent information-flow type system that ensures that no secrets leak even under speculative execution and a compiler transformation that enables it on the generated low-level code. We first prove the soundness of the type system and the correctness of the compiler transformation using the Coq proof assistant. We then implement our approach in the Jasmin framework for high-assurance cryptography and demonstrate that the overhead incurred by all Spectre protections is below 2% for most cryptographic primitives and reaches only about 5--7% for the more complex post-quantum key-encapsulationkmechanism Kyber.

Authors

Institutions

Publication Details

Published
2025-03-27
DOI
https://doi.org/10.1145/3676641.3716015
Citations
1
Primary Topic
Security and Verification in Computing
Type
article
Field-Weighted Citation Impact
2.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Protecting Cryptographic Code Against Spectre-RSB: (and, in Fact, All Known Spectre Variants)

Yuval Yarom, Santiago Arranz Olmos, Peter Schwabe, Gilles Barthe et al.
1 citations
Security and Verification in Computing
2.48
article

Protecting Cryptographic Code Against Spectre-RSB: (and, in Fact, All Known Spectre Variants)

Yuval Yarom, Santiago Arranz Olmos, Peter Schwabe, Gilles Barthe, Tiago Oliveira, Vincent Laporte, Chitchanok Chuengsatiansup, Zhiyuan Zhang, Benjamin Grégoire
article en
1 citations

Abstract

Spectre attacks void the guarantees of constant-time cryptographic code by leaking secrets during speculative execution. Recent research shows that such code can be protected from Spectre-v1 attacks with minimal overhead, but leaves open the question of protecting against other Spectre variants. In this work, we design, validate, implement, and verify a new approach to protect cryptographic code against all known classes of Spectre attacks, in particular Spectre-RSB. Our approach combines a new value-dependent information-flow type system that ensures that no secrets leak even under speculative execution and a compiler transformation that enables it on the generated low-level code. We first prove the soundness of the type system and the correctness of the compiler transformation using the Coq proof assistant. We then implement our approach in the Jasmin framework for high-assurance cryptography and demonstrate that the overhead incurred by all Spectre protections is below 2% for most cryptographic primitives and reaches only about 5--7% for the more complex post-quantum key-encapsulationkmechanism Kyber.

Centre National de la Recherche Scientifique (FR), Institut national de recherche en sciences et technologies du numérique (FR), Radboud University Nijmegen (NL), The University of Melbourne (AU), Max Planck Institute for Security and Privacy (DE), Laboratoire Lorrain de Recherche en Informatique et ses Applications (FR), IMDEA Software Institute (ES), Université de Lorraine (FR), Ruhr University Bochum (DE)
European Commission, Deutsche Forschungsgemeinschaft, Agence Nationale de la Recherche, Bundesministerium für Bildung und Forschung
Openalex Percentile: Top 12%
Security and Verification in Computing
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.