A logic programming based framework for security protocol verification

Research output: Chapter in Book / Conference PaperConference Paperpeer-review

3 Citations (Scopus)

Abstract

Security protocol analysis has been a major research topic in information security and recognised to be a notoriously hard problem. In this paper, we take the advantage of answer set programming technology to develop an effective framework to verify security protocols carrying claimed security proof under adversary models on computational complexity theory. In our approach, a security protocol, adversary actions and attacks can be formally specified within a unified logic program. Then the verification is performed in an automatic manner by computing the stable models of the underlying logic program. We use Boyd-Gonz lez Nieto conference key agreement protocol as our case study protocol to demonstrate the effectiveness and efficiency of our approach.

Original languageEnglish
Title of host publicationFoundations of Intelligent Systems - 17th International Symposium, ISMIS 2008, Proceedings
Pages638-643
Number of pages6
DOIs
Publication statusPublished - 2008
Event17th International Symposium on Methodologies for Intelligent Systems, ISMIS 2008 - Toronto, Canada
Duration: 20 May 200823 May 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4994 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th International Symposium on Methodologies for Intelligent Systems, ISMIS 2008
Country/TerritoryCanada
CityToronto
Period20/05/0823/05/08

Fingerprint

Dive into the research topics of 'A logic programming based framework for security protocol verification'. Together they form a unique fingerprint.

Cite this