License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2020.31
URN: urn:nbn:de:0030-drops-128433
URL: https://drops.dagstuhl.de/opus/volltexte/2020/12843/
Go to the corresponding LIPIcs Volume Portal


D'Osualdo, Emanuele ; Stutz, Felix

Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions

pdf-format:
LIPIcs-CONCUR-2020-31.pdf (0.6 MB)


Abstract

We develop a theory of decidable inductive invariants for an infinite-state variant of the Applied πcalc, with applications to automatic verification of stateful cryptographic protocols with unbounded sessions/nonces. Since the problem is undecidable in general, we introduce depth-bounded protocols, a strict generalisation of a class from the literature, for which our decidable analysis is sound and complete. Our core contribution is a procedure to check that an invariant is inductive, which implies that every reachable configuration satisfies it. Our invariants can capture security properties like secrecy, can be inferred automatically, and represent an independently checkable certificate of correctness. We provide a prototype implementation and we report on its performance on some textbook examples.

BibTeX - Entry

@InProceedings{dosualdo_et_al:LIPIcs:2020:12843,
  author =	{Emanuele D'Osualdo and Felix Stutz},
  title =	{{Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions}},
  booktitle =	{31st International Conference on Concurrency Theory (CONCUR 2020)},
  pages =	{31:1--31:23},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-160-3},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{171},
  editor =	{Igor Konnov and Laura Kov{\'a}cs},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/12843},
  URN =		{urn:nbn:de:0030-drops-128433},
  doi =		{10.4230/LIPIcs.CONCUR.2020.31},
  annote =	{Keywords: Security Protocols, Infinite-State Verification, Ideal Completions for WSTS}
}

Keywords: Security Protocols, Infinite-State Verification, Ideal Completions for WSTS
Collection: 31st International Conference on Concurrency Theory (CONCUR 2020)
Issue Date: 2020
Date of publication: 26.08.2020
Supplementary Material: Tool available at https://doi.org/10.5281/zenodo.3950846


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI