Open access
Jul 2026
Interactive Proofs in Higher-Order Logic with Errors and Application to Concrete Cryptography
This paper introduces a proof term calculus with dedicated features for bounds, for which an elaborator can automatically infer bound-related manipulations, improving usability and reducing user inputs, and theoretically argues for its usability through an erasability theorem.
Caroline Fontaine, Adrien Koutsos, Guillaume Scerri et al.
· IEEE Computer Security Found... · 0 citations