Detecting and Preventing Type flaws: a Control Flow Analysis with Tags
Electronic Notes in Theoretical Computer Science (ENTCS)
A Formal Analysis of Complex Type Flaw Attacks on Security Protocols
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
A formal analysis for capturing replay attacks in cryptographic protocols
ASIAN'07 Proceedings of the 12th Asian computing science conference on Advances in computer science: computer and network security
Detecting and preventing type flaws at static time
Journal of Computer Security - Security Issues in Concurrency (SecCo'07)
Non-repudiation analysis using LySa with annotations
Computer Languages, Systems and Structures
| Hi-index | 0.00 |
Recently there has been an increased research interest in applying process calculi in the verification of cryptographic protocols due to their ability to formally model protocols. This work presents LYSA with explicit confidentiality annotations for indicating the expected behavior of target protocols. A static analysis approach is developed for analyzing protocols specified in the extended LYSA. The proposed approach will over-approximate the possible executions of protocols while keeping track of all messages communicated over the network, and furthermore it will capture the potential malicious activities performed by attackers as specified by the confidentiality annotations. The proposed analysis approach is fully automatic without the need of human intervention and has been applied successfully to a number of protocols.