The inductive approach to verifying cryptographic protocols
Journal of Computer Security
Timestamps in key distribution protocols
Communications of the ACM
Using encryption for authentication in large networks of computers
Communications of the ACM
Constraint solving for bounded-process cryptographic protocol analysis
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Flexible protocol specification and execution: applying event calculus planning using commitments
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Proving properties of open agent systems
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Categories of Artificial Societies
ESAW '01 Proceedings of the Second International Workshop on Engineering Societies in the Agents World II
An Abductive Approach for Analysing Event-Based Requirements Specifications
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
From Secrecy to Authenticity in Security Protocols
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
An Improved Constraint-Based System for the Verification of 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
Automatic verification of cryptographic protocols: a logic programming approach
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Analyzing security protocols with secrecy types and logic programs
Journal of the ACM (JACM)
NetBill security and transaction protocol
WOEC'95 Proceedings of the 1st conference on USENIX Workshop on Electronic Commerce - Volume 1
A social ACL semantics by deontic constraints
CEEMAS'03 Proceedings of the 3rd Central and Eastern European conference on Multi-agent systems
The SCIFF abductive proof-procedure
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
An abductive framework for a-priori verification of web services
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Verifiable agent interaction in abductive logic programming: The SCIFF framework
ACM Transactions on Computational Logic (TOCL)
Computational Logic in Multi-Agent Systems
Expressing and Verifying Business Contracts with Abductive Logic Programming
International Journal of Electronic Commerce
A General Approach to the Verification of Cryptographic Protocols Using Answer Set Programming
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Declarative specification and verification of service choreographiess
ACM Transactions on the Web (TWEB)
Autonomous Agents and Multi-Agent Systems
A verifiable logic-based agent architecture
ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
Specification and verification of agent interaction using abductive reasoning
CLIMA'05 Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems
Multi-agent systems in computational logic: challenges and outcomes of the SOCS project
CLIMA'05 Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems
| Hi-index | 0.00 |
In this paper we present by a case study an approach to the verification of security protocols based on Abductive Logic Programming. We start 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 take a formal approach based on Computational Logic, to address verification at two orthogonal levels: ‘static' verification of protocol properties (which can guarantee, at design time, that some properties are a logical consequence of the protocol), and ‘dynamic' verification of compliance of agent communication (which checks, at runtime, that the agents do actually follow the protocol). In order to explain the approach, we adopt as a running example the well-known Needham-Schroeder protocol. We first show how the protocol can be specified in our previously developed SOCS-SI framework, and then demonstrate the two types of verification. We also demonstrate the use of the SOCS-SI framework for the static verification of the NetBill e-commerce protocol.