Skip to Main content Skip to Navigation
Reports

Computationally Sound, Automated Proofs for Security Protocols

Véronique Cortier 1 Bogdan Warinschi
1 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and probability. This approach captures a strong notion of security, guaranteed against all probabilistic polynomial-time attacks. The other approach relies on a symbolic model of protocol executions in which cryptographic primitives are treated as black boxes. Since the seminal work of Dolev and Yao, it has been realized that this latter approach enables significantly simpler and often automated proofs. However, the guarantees that it offers have been quite unclear. In this paper, we show that it is possible to obtain the best of both worlds: fully automated proofs and strong, clear security guarantees. Specifically, for the case of protocols that use signatures and asymmetric encryption, we establish that symbolic integrity and secrecy proofs are sound with respect to the computational model. The main new challenges concern secrecy properties for which we obtain the first soundness result for the case of active adversaries. Our proofs are carried out using Casrul, a fully automated tool.
Document type :
Reports
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/inria-00070660
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 9:08:30 PM
Last modification on : Friday, January 15, 2021 - 3:24:31 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:40:41 PM

Identifiers

  • HAL Id : inria-00070660, version 1

Citation

Véronique Cortier, Bogdan Warinschi. Computationally Sound, Automated Proofs for Security Protocols. [Research Report] RR-5341, INRIA. 2004, pp.23. ⟨inria-00070660⟩

Share

Metrics

Record views

280

Files downloads

689