A Higher-Order Indistinguishability Logic for Cryptographic Reasoning - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

A Higher-Order Indistinguishability Logic for Cryptographic Reasoning

Adrien Koutsos
Joseph Lallemand


The field of cryptographic protocol verification in the computational model aims at obtaining formal security proofs of protocols. To facilitate writing such proofs, which are complex and hard to automate, Bana and Comon have proposed the Computationally Complete Symbolic Attacker (CCSA) approach, which is based on a first-order logic with a probabilistic computational semantics. Later, a meta-logic was built on top of the CCSA logic, to extend it with support for unbounded protocols and effective mechanisation. This metalogic was then implemented in the SQUIRREL prover. In this paper, we propose a careful redesign of the SQUIRREL logic, providing clean and robust foundations for its future development. We show in this way that the original meta-logic was both needlessly complex and too restrictive. Our new logic, using higher-order, avoids the indirect definition of the meta-logic on top of the CCSA logic, decouples the logic from the notion of protocol, and supports advanced generic reasoning and non-computable functions. We also equip it with generalised cryptographic rules allowing corruption. This theoretical work justifies our extension of SQUIRREL with higher-order reasoning, which we illustrate on case studies.
Fichier principal
Vignette du fichier
hal.pdf (635.23 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03981949 , version 1 (14-02-2023)
hal-03981949 , version 2 (21-04-2023)





David Baelde, Adrien Koutsos, Joseph Lallemand. A Higher-Order Indistinguishability Logic for Cryptographic Reasoning. LICS, Jun 2023, Boston, United States. pp.1-13, ⟨10.1109/LICS56636.2023.10175781⟩. ⟨hal-03981949v2⟩
195 View
121 Download



Gmail Facebook Twitter LinkedIn More