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.
Type de document :
Communication dans un congrès
22nd ACM SIGSAC Conference on Computer and Communications Security (ACM CCS 2015), Oct 2015, Denver, United States. 22nd ACM SIGSAC Conference on Computer and Communications Security (ACM CCS 2015), pp.1144--1155, 〈10.1145/2810103.2813662〉
Liste complète des métadonnées

Littérature citée [16 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01337409
Contributeur : Jannik Dreier <>
Soumis le : mardi 12 septembre 2017 - 12:52:06
Dernière modification le : dimanche 21 octobre 2018 - 20:08:02
Document(s) archivé(s) le : mercredi 13 décembre 2017 - 12:45:49

Fichier

main.pdf
Fichiers produits par l'(les) auteur(s)

Licence


Copyright (Tous droits réservés)

Identifiants

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), Oct 2015, Denver, United States. 22nd ACM SIGSAC Conference on Computer and Communications Security (ACM CCS 2015), pp.1144--1155, 〈10.1145/2810103.2813662〉. 〈hal-01337409v2〉

Partager

Métriques

Consultations de la notice

29

Téléchargements de fichiers

111