An abstraction and refinement framework for verifying security protocols based on logic programming

Authors:
MengJun Li;Ti Zhou;ZhouJun Li;HuoWang Chen
Affiliations:
School of Computer Science, National University of Defense Technology, ChangSha, China;School of Computer Science, National University of Defense Technology, ChangSha, China;School of Computer Science & Engineering, Beihang University, Beijing, China;School of Computer Science, National University of Defense Technology, ChangSha, China
Venue:
ASIAN'07 Proceedings of the 12th Asian computing science conference on Advances in computer science: computer and network security
Year:
2007

Citing 8
Cited 3

Analyzing security protocols with secrecy types and logic programs

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
From Secrecy to Authenticity in Security Protocols

SAS '02 Proceedings of the 9th International Symposium on Static Analysis
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules

CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Reconstruction of Attacks against Cryptographic Protocols

CSFW '05 Proceedings of the 18th IEEE workshop on Computer Security Foundations
Verification of cryptographic protocols: tagging enforces termination

Theoretical Computer Science - Foundations of software science and computation structures
Causality-based Abstraction of Multiplicity in Security Protocols

CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
Pattern-based abstraction for verifying secrecy in protocols

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems

A Novel Derivation Framework For Definite Logic Program

Electronic Notes in Theoretical Computer Science (ENTCS)
Local abstract verification and refinement of security protocols

Proceedings of the 6th ACM workshop on Formal methods in security engineering
SPVT-II: An Efficient Security Protocol Verifier Based on Logic Programming

Information Security and Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using depth(k) abstract domain, we present an abstraction and refinement framework for verifying security protocols based on logic programming. The solved-form fixpoint of the logic program model is abstracted by depth(k) abstract domain, which guarantees termination of the verification algorithm; If the result of the verification algorithm with the abstract solved-form fixpoint shows there exists counterexamples, but the result of the verification algorithm with the logic rules in abstract solved-form fixpoint which are not abstracted shows there exists no counterexamples, then the abstracted solved-form fixpoint is refined by increasing the value of term depth bound k. With this framework, all of the verification, constructing counterexamples and refinement can be implemented in a mechanized way.