DMCA
A Computational Logic-based approach to security protocols verification, and its application to the Needham-Schroeder Public Key authentication protocol
BibTeX
@MISC{Gavanelli_acomputational,
author = {Marco Gavanelli and Mgavanelli Ing. Unife. It and Evelina Lamma and Paola Mello and Pmello Deis. Unibo. It and Paolo Torroni},
title = {A Computational Logic-based approach to security protocols verification, and its application to the Needham-Schroeder Public Key authentication protocol},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. In this work we present a proof-theoretic approach to the verification of security protocols. Starting from the perspective of open multi-agent systems, where the internal architecture of the individual system’s components may not be completely specified but it is important to infer and prove properties about the overall system behaviour, we propose a general framework where several kinds of verification can be applied. We take a formal approach based on Computational Logic, to tackle verification at two orthogonal levels: ‘static ’ verification of protocol properties, and ‘dynamic’ verification of compliance of agent communication. The first one could investigate the possibility that while two agents are correctly following a given protocol a malicious agent can learn secrets exchanged by them. The second one could be about automatically checking that a group of agents interacting with each other are indeed following a given protocol. The main advantages of our approach are (1) from a formal perspective, in the declarative protocol specification language, associated with a rigorous declarative
Keyphrases
security protocol verification computational logic-based approach needham-schroeder public key authentication protocol main advantage security protocol open multi-agent system general framework malicious agent declarative protocol specification language internal architecture proof-theoretic approach formal perspective individual system component overall system behaviour first one formal approach static verification several kind computational logic agent communication protocol property dynamic verification orthogonal level second one rigorous declarative
