The hitchhiker's guide to decidability and complexity of equivalence properties in security protocols - Archive ouverte HAL Access content directly
Conference Papers Year :

The hitchhiker's guide to decidability and complexity of equivalence properties in security protocols

(1, 2) , (1, 2) , (1, 2)
1
2

Abstract

Privacy-preserving security properties in cryptographic protocols are typically modelled by observational equivalences in process calculi such as the applied pi-calulus. We survey decidability and complexity results for the automated verification of such equivalences, casting existing results in a common framework which allows for a precise comparison. This unified view, beyond providing a clearer insight on the current state of the art, allowed us to identify some variations in the statements of the decision problems-sometimes resulting in different complexity results. Additionally, we prove a couple of novel or strengthened results.
Fichier principal
Vignette du fichier
main.pdf (297.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02961617 , version 1 (08-10-2020)

Identifiers

  • HAL Id : hal-02961617 , version 1

Cite

Vincent Cheval, Steve Kremer, Itsaka Rakotonirina. The hitchhiker's guide to decidability and complexity of equivalence properties in security protocols. Logic, Language, and Security. Essays Dedicated to Andre Scedrov on the Occasion of His 65th Birthday, 2020, Philadelphia, United States. ⟨hal-02961617⟩
29 View
121 Download

Share

Gmail Facebook Twitter LinkedIn More