2025
Autores
Barbosa, M; Kannwischer, MJ; Lim, TH; Schwabe, P; Strub, PY;
Publicação
CCS
Abstract
Decryption errors play a crucial role in the security of KEMs based on Fujisaki-Okamoto because the concrete security guarantees provided by this transformation directly depend on the probability of such an event being bounded by a small real number. In this paper we present an approach to formally verify the claims of statistical probabilistic bounds for incorrect decryption in lattice-based KEM constructions. Our main motivating example is the PKE encryption scheme underlying ML-KEM. We formalize the statistical event that is used in the literature to heuristically approximate ML-KEM decryption errors and confirm that the upper bounds given in the literature for this event are correct. We consider FrodoKEM as an additional example, to demonstrate the wider applicability of the approach and the verification of a correctness bound without heuristic approximations. We also discuss other (non-approximate) approaches to bounding the probability of ML-KEM decryption. © 2025 Copyright held by the owner/author(s).
2025
Autores
Barbosa, M; Boldyreva, A; Chen, S; Cheng, K; Esquível, L;
Publicação
Proc. Priv. Enhancing Technol.
Abstract
2025
Autores
Arriaga, A; Barbosa, M; Jarecki, S;
Publicação
IACR Cryptol. ePrint Arch.
Abstract
2025
Autores
Almeida, JB; Alves, GXDM; Barbosa, M; Barthe, G; Esquível, L; Hwang, V; Oliveira, T; Pacheco, H; Schwabe, P; Strub, PY;
Publicação
2025 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, SP
Abstract
We propose a hybrid formal verification approach that combines high-level deductive reasoning and circuit-based reasoning and apply it to highly optimized cryptographic assembly code. Our approach permits scaling up formal verification in two complementary directions: 1) it reduces the proof effort required for low-level functions where the computation logics are obfuscated by the intricate use of architecture-specific instructions and 2) it permits amortizing the effort of proving one implementation by using equivalence checking to propagate the guarantees to other implementations of the same computation using different optimizations or targeting different architectures. We demonstrate our approach via an extension to the EasyCrypt proof assistant and by revisiting formally verified implementations of ML-KEM in Jasmin. As a result, we obtain the first formally verified implementation of ML-KEM that offers performance comparable to the fastest non-verified implementation in x86-64 architectures.
2025
Autores
Barbosa, M; Boldyreva, A; Chen, S; Cheng, K; Esquível, L;
Publicação
IACR Cryptol. ePrint Arch.
Abstract
2025
Autores
Arriaga, A; Barbosa, M; Jarecki, S;
Publicação
IACR Cryptol. ePrint Arch.
Abstract
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.