• Publications
  • Influence
Computer-Aided Security Proofs for the Working Cryptographer
TLDR
It is argued that EasyCrypt is a plausible candidate for adoption by working cryptographers and its application to security proofs of the Cramer-Shoup and Hashed ElGamal cryptosystems is illustrated.
Formal certification of code-based cryptographic proofs
TLDR
This work presents Certicrypt, a framework that enables the machine-checked construction and verification of code-based proofs, built upon the general-purpose proof assistant Coq, and draws on many areas, including probability, complexity, algebra, and semantics of programming languages.
A compiled implementation of strong reduction
TLDR
This work develops and proves correct a strong reducer and ß-equivalence checker for the λ-calculus with products, sums, and guarded fixpoints and demonstrates important speed-ups compared with the original interpreter-based implementation of strong reduction in Coq.
Strong Non-Interference and Type-Directed Higher-Order Masking
TLDR
This work develops a precise, scalable, and fully automated methodology to verify the probing security of masked algorithms, and generate them from unprotected descriptions of the algorithm.
A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses
TLDR
A way to enjoy the power of SAT and SMT provers in Coq without compromising soundness is presented, conceived in a modular way, in order to tame the proofs' complexity and to be extendable.
Verified Proofs of Higher-Order Masking
TLDR
The problem of automatically verifying higher-order masking countermeasures is studied, since weaknesses have been discovered in schemes that were thought secure, but is inherently exponential.
Jasmin: High-Assurance and High-Speed Cryptography
TLDR
Using the supercop framework, this work evaluates the Jasmin compiler on representative cryptographic routines and concludes that the code generated by the compiler is as efficient as fast, hand-crafted, implementations.
Secure Compilation of Side-Channel Countermeasures: The Case of Cryptographic “Constant-Time”
TLDR
This work considers the problem of preserving side-channel counter-measures by compilation for cryptographic “constant-time”, a popular countermeasure against cache-based timing attacks, and presents a general method, based on the notion of constant-time-simulation, for proving that a compilation pass preserves the constant- timecountermeasure.
Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
TLDR
It is proved that probing security for a serial implementation implies bounded moment security for its parallel counterpart, which enables an accurate understanding of the links between formal security analyses of masking schemes and experimental security evaluations based on the estimation of statistical moments.
EasyCrypt: A Tutorial
TLDR
Machine-checked frameworks that support the construction and automated verification of cryptographic systems are developed to reason directly in the computational model commonly used by cryptographers to deliver rigorous and detailed mathematical proofs.
...
1
2
3
4
5
...