Theoretical Computer Science
A model-theoretic reconstruction of the operational semantics of logic programs
Information and Computation
Forum: a multiple-conclusion specification logic
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Algorithmic analysis of programs with well quasi-ordered domains
Information and Computation - Special issue: LICS 1996—Part 1
A bottom-up semantics for linear logic programs
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Proving security protocols with model checkers by data independence techniques
Journal of Computer Security
Casper: a compiler for the analysis of security protocols
Journal of Computer Security
The inductive approach to verifying cryptographic protocols
Journal of Computer Security
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
The pi-Calculus as a Theory in Linear Logic: Preliminary Results
ELP '92 Proceedings of the Third International Workshop on Extensions of Logic Programming
Phase Semantics and Verification of Concurrent Constraint Programs
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
A Meta-Notation for 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
An effective fixpoint semantics for linear logic programs
Theory and Practice of Logic Programming
Compiling and verifying security protocols
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Model checking linear logic specifications
Theory and Practice of Logic Programming
Cross-layer verification of type flaw attacks on security protocols
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Automatic verification of cryptographic protocols in first-order logic
ICAI'07 Proceedings of the 8th Conference on 8th WSEAS International Conference on Automation and Information - Volume 8
West2East: exploiting WEb Service Technologies to Engineer Agent-based SofTware
International Journal of Agent-Oriented Software Engineering
Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Formal verification of a type flaw attack on a security protocol using object-z
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
Logical approximation for program analysis
Higher-Order and Symbolic Computation
| Hi-index | 0.00 |
In this paper we investigate the applicability of a bottom-up evaluation strategy for a first order fragment of linear logic [7] for the purposes of automated validation of authentication protocols. Following [11], we use multi-conclusion clauses to represent the behaviour of agents in a protocol session, and we adopt the Dolev-Yao intruder model and related message and cryptographic assumptions. Also, we use universal quantification to provide a logical and clean way to express creation of nonces. Our approach is well suited to verify properties which can be specified by means of minimality conditions. Unlike traditional approaches based on model-checking, we can reason about parametric, infinite-state systems, thus we do not pose any limitation on the number of parallel runs of a given protocol. Furthermore, our approach can be used both to find attacks and to prove correctness of protocols. We present some preliminary experiments which we have carried out using the above approach. In particular, we analyze the ffgg protocol introduced by Millen [30]. This protocol is a challenging case study in that it is free from sequential attacks, whereas it suffers from parallel attacks that occur only when at least two sessions are run in parallel.