Backend
VellSSLH: Sound Type-Guided Selective Speculative Load Hardening for LLVM IR
arXiv cs.CR0 views
arXiv:2611.18463v1 Announce Type: new Abstract: Constant-time cryptographic programs written in C can still leak secrets during speculative execution. Mispredicted branches may allow instructions to access secret data and expose it through observable behavior. Speculative load hardening (SLH) addresses these leaks, but protecting values unnecessarily can introduce significant runtime overhead. We present VellSSLH, which selectively inserts speculative load hardening at LLVM IR. Programmers specify Public and Secret inputs in annotated C programs, and our analysis infers which values may become secret during speculation. The transformation then inserts misspeculation-flag operations and protections only where needed. VellSCT, our extracted checker, validates the resulting LLVM IR. We formalize speculative constant-time (SCT) security by extending Vellvm's LLVM semantics with speculative execution, attacker directives, and leakage observations. Our security type system reasons about SSA joins, symbolic values, poison, pointer provenance, and observable faults, and supports declared declassifications and trusted external services. In Rocq, we prove that programs accepted by the checker satisfy SCT, and that a reference hardening transformation preserves architectural behavior. Evaluated optimized variants are rechecked for SCT but are not covered by this preservation proof. Our mechanized guarantees apply at LLVM IR; security of the generated binary additionally depends on backend and hardware assumptions. We evaluate VellSSLH on 24 cryptographic entries on a bare-metal Intel processor. VellSSLH achieves 4.03% lower geometric-mean runtime than LLVM SLH, with 13 comparisons favoring VellSSLH, eight favoring LLVM SLH, and three inconclusive. For X25519, VellSSLH improves runtime by 22.69% over LLVM SLH with only 1.86% overhead over unprotected code. Compared with Ultimate SLH, VellSSLH achieves 19.65% lower runtime.
Source:https://arxiv.org/abs/2611.18463PreviousDeterministic ECDSA on secp256k1: the RFC 6979 assumption, a counterexample, and the state of deployed implementationsNextFair and Efficient Distributed EV Charging Coordination Using Threshold Cryptography and Machine Learning
Related posts
DNS_PROBE_FINISHED_NXDOMAIN: What It Means and How to Fix It
0dev.to

Microsoft 365 Was Down 30 Hours. I Timed Every Part of It, and the Chlorine Story Checks Out.
0dev.to
A fast and sound algorithm to simplify summations in interventional queries expressions
0arXiv stat.CO
Does Increasing Government Spending on Tertiary Education Provide a Return on Investment? A Bayesian Causal Inference Analysis
0arXiv stat.CO
Edit one line of an AI agent journal and see what aisync verify says
0dev.to Productivity
Upgrading .NET 8 or 9 to .NET 10: the checklist
0dev.to C#