Formal analysis of protocols based on TPM state registers - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Formal analysis of protocols based on TPM state registers

Résumé

We present a Horn-clause-based framework for analysing security protocols that use platform configuration registers (PCRs), which are registers for maintaining state inside the Trusted Platform Module (TPM). In our model, the PCR state space is unbounded, and our experience shows that a naïve analysis using ProVerif or SPASS does not terminate. To address this, we extract a set of instances of the Horn clauses of our model, for which ProVerif does terminate on our examples. We prove the soundness of this extraction process: no attacks are lost, that is, any query derivable in the more general set of clauses is also derivable from the extracted instances. The effectiveness of our framework is demonstrated in two case studies: a simplified version of Microsoft Bitlocker, and a digital envelope protocol that allows a user to choose whether to perform a decryption, or to verifiably renounce the ability to perform the decryption.
Fichier principal
Vignette du fichier
DKRS-csf11.pdf (218.41 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00636747 , version 1 (09-10-2015)

Identifiants

Citer

Stéphanie Delaune, Steve Kremer, Ryan D. Mark, Graham Steel. Formal analysis of protocols based on TPM state registers. 24th IEEE Computer Security Foundations Symposium (CSF'11), Jun 2011, Cernay-la-Ville, France. ⟨10.1109/CSF.2011.12⟩. ⟨inria-00636747⟩
103 Consultations
214 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More