Automated Symbolic Proofs of Observational Equivalence

Abstract : Many cryptographic security definitions can be naturally formulated as observational equivalence properties. However, existing automated tools for verifying the observational equivalence of cryptographic protocols are limited: they do not handle protocols with mutable state and an unbounded number of sessions. We propose a novel definition of observational equivalence for multiset rewriting systems. We then extend the Tamarin prover, based on multiset rewriting, to prove the observational equivalence of protocols with mutable state, an unbounded number of sessions, and equational theories such as Diffie-Hellman exponentiation. We demonstrate its effectiveness on case studies, including a stateful TPM protocol.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [16 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01337409
Contributor : Jannik Dreier <>
Submitted on : Tuesday, September 12, 2017 - 12:52:06 PM
Last modification on : Tuesday, March 5, 2019 - 9:30:12 AM
Document(s) archivé(s) le : Wednesday, December 13, 2017 - 12:45:49 PM

File

main.pdf
Files produced by the author(s)

Licence


Copyright

Identifiers

Citation

David Basin, Jannik Dreier, Ralf Sasse. Automated Symbolic Proofs of Observational Equivalence. 22nd ACM SIGSAC Conference on Computer and Communications Security (ACM CCS 2015), ACM, Oct 2015, Denver, United States. pp.1144--1155, ⟨10.1145/2810103.2813662⟩. ⟨hal-01337409v2⟩

Share

Metrics

Record views

40

Files downloads

151