SPVT-II: An Efficient Security Protocol Verifier Based on Logic Programming

Authors:
Mengjun Li;Ti Zhou;Zhoujun Li
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, BeiHang University, BeiJing, China
Venue:
Information Security and Cryptology
Year:
2009

Citing 13
Cited 0

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
Athena: a New Efficient Automatic Checker for Security Protocol Analysis

CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules

CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
A dynamic approach to characterizing termination of general logic programs

ACM Transactions on Computational Logic (TOCL)
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
An abstraction and refinement framework for verifying security protocols based on logic programming

ASIAN'07 Proceedings of the 12th Asian computing science conference on Advances in computer science: computer and network security
Breaking and fixing public-key Kerberos

ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
The AVISPA tool for the automated validation of internet security protocols and applications

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

SPVT-II is a security protocol verifier based on logic programming, in which an accurate verification approach and an abstract verification approach are combined by a non-termination prediction algorithm. The prediction algorithm predicts non-termination of the solved-form fixpoint of the logic program model of security protocols. In SPVT-II, if the fixpoint is predicted non-termination, then the abstract approach is used to verify protocols, otherwise the accurate approach is used. The combined approach inherits the efficiency of the accurate approach for verifying those security protocols whose fixpoint terminates, and in the abstract-refinement iteration verification framework, the combined approach can be used to incrementally verify security protocols whose fixpoint is predicted non-termination. And in SPVT-II, the non-termination prediction of fixpoint, verification, constructing counterexamples and refinement are all implemented mechanically. The experiment results demonstrate the practicality of our verifier.