Formalizing algorithmic bounds in the query model in EeasyCrypt

DOI10.4230/LIPICS.ITP.2022.30MaRDI QIDQ6572572zbMATH OpenFDO

Authors Alley Stoughton, Carol Chen, Marco Gaboardi, Weihao Qu

Publication date 15 July 2024

zbMATH Keywords

lower boundupper boundquery modeladversary argumentEasyCrypt

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

This page was built for publication: Formalizing algorithmic bounds in the query model in EeasyCrypt

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6572572)