Exploiting symmetries when proving equivalence properties for security protocols (Technical report) - Archive ouverte HAL Access content directly
Reports (Technical Report) Year : 2020

Exploiting symmetries when proving equivalence properties for security protocols (Technical report)

Vincent Cheval
Steve Kremer

Abstract

Verification of privacy-type properties for cryptographic protocols in an active adversarial environment, modelled as a behavioural equivalence in concurrent-process calculi, exhibits a high computational complexity. While undecidable in general, for some classes of common cryptographic primitives the problem is coNEXP-complete when the number of honest participants is bounded. In this paper we develop optimisation techniques for verifying equivalences, exploiting symmetries between the two processes under study. We demonstrate that they provide a signi cant (sev-eral orders of magnitude) speed-up in practice, thus increasing the size of the protocols that can be analysed fully automatically.
Fichier principal
Vignette du fichier
main.pdf (867.7 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02267866 , version 1 (19-08-2019)
hal-02267866 , version 2 (27-08-2019)
hal-02267866 , version 3 (17-04-2020)

Identifiers

  • HAL Id : hal-02267866 , version 3

Cite

Vincent Cheval, Steve Kremer, Itsaka Rakotonirina. Exploiting symmetries when proving equivalence properties for security protocols (Technical report). [Technical Report] INRIA Nancy Grand-Est. 2020. ⟨hal-02267866v3⟩
140 View
212 Download

Share

Gmail Facebook X LinkedIn More