ACM SIGOPS Operating Systems Review
ACM Transactions on Computer Systems (TOCS)
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Optimal privacy and authentication on a portable communications system
ACM SIGOPS Operating Systems Review
Using encryption for authentication in large networks of computers
Communications of the ACM
A logic for modeling the dynamics of beliefs in cryptographic protocols
ACSC '01 Proceedings of the 24th Australasian conference on Computer science
On the design of security protocols for mobile communications
ACISP '96 Proceedings of the First Australasian Conference on Information Security and Privacy
PVS: Combining Specification, Proof Checking, and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Modelling and verifying key-exchange protocols using CSP and FDR
CSFW '95 Proceedings of the 8th IEEE workshop on Computer Security Foundations
Formal Analysis of a Non-Repudiation Protocol
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
A Meta-Notation for Protocol Analysis
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
On Unifying Some Cryptographic Protocol Logics
SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
A fair non-repudiation protocol
SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy
Formal verification: an imperative step in the design of security protocols
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the automated implementation of modal logics used to verify security protocols
ISICT '03 Proceedings of the 1st international symposium on Information and communication technologies
Authentication and payment in future mobile systems
Journal of Computer Security
Computers and Electrical Engineering
| Hi-index | 0.00 |
Security protocols are one of the most critical elements in enabling the secure communication and processing of information. The presence of flaws in published protocols highlights the complexity of security protocol design. Only formal verification can provide strong confidence in the correctness of security protocols and is considered an imperative step in their design. This paper presents a new theoretical concept, called Layered Proving Trees, for automatically applying logical postulates in logic-based security protocol verification.An algorithm for the new concept is introduced and the soundness and completeness of the technique is proved. Empirical results on the performance of the algorithm are presented. The presented proofs and empirical results demonstrate the feasibility and effectiveness of the Layered Proving Tree approach.