Implementing Security Protocol Monitors

@inproceedings{Chevalier2021ImplementingSP,
  title={Implementing Security Protocol Monitors},
  author={Yannick Chevalier and Micha{\"e}l Rusinowitch},
  booktitle={International Symposium on Symbolic Computation in Software Science},
  year={2021}
}
Cryptographic protocols are often specified by narrations, i.e., finite sequences of message exchanges that show the intended execution of the protocol. Another use of narrations is to describe attacks. We propose in this paper to compile, when possible, attack describing narrations into a set of tests that honest participants can perform to exclude these executions. These tests can be implemented in monitors to protect existing implementations from rogue behaviour. 
View PDF on arXiv

References

SHOWING 1-10 OF 16 REFERENCES

Compiling and securing cryptographic protocols

Formal Verification of Protocols Based on Short Authenticated Strings

A new decision procedure for analysing (a bounded number of sessions of) protocols that rely on short strings is proposed which includes attacker capabilities for both guessing short strings, and producing collisions when short strings result from an application of weak hash functions.

Towards the attacker's view of protocol narrations (or, how to compile security protocols)

A faithful view of the attacker is established based on rigorous, yet intuitive, interpretations of exchanged messages that gives a new way to look at attacks and protocol implementations.

Safe Simplifying Transformations for Security Protocols.

The notion of safe simplifying transformations is developed: transformations that have the property of preserving insecurities; the effect of such transformations is that if the authors can verify the transformed protocol, then they will have verified the original protocol.

Defending Vulnerable Security Protocols by Means of Attack Interference in Non-Collaborative Scenarios

This paper formalizes a framework for multi-attacker scenarios and shows, through a case study, that concurrent competitive attacks can interfere with each other.

Safe simplifying transformations for security protocols or not just the Needham Schroeder pubic key protocol

  • M. HuiG. Lowe
  • Computer Science, Mathematics
    Proceedings of the 12th IEEE Computer Security Foundations Workshop
  • 1999
The notion of safe simplifying transformations is developed: transformations that have the property of preserving insecurities; the effect of such transformations is that if the authors can verify the transformed protocol, then they will have verified the original protocol.

Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR

  • G. Lowe
  • Computer Science, Mathematics
    Softw. Concepts Tools
  • 1996
This paper uses FDR, a refinement checker for CSP to discover an attack upon the Needham-Schroeder Public-Key Protocol, which allows an intruder to impersonate another agent, and adapt the protocol, and uses FDR to show that the new protocol is secure, at least for a small system.

Validating Security Protocols under the General Attacker

The analysis of security protocols under the General Attacker threat model brings forward yet more insights: retaliation attacks and anticipation attacks are the main findings, while the tool support can scale up to the new analysis at a negligible price.

Deciding knowledge in security protocols under equational theories

Using encryption for authentication in large networks of computers

Use of encryption to achieve authenticated communication in computer networks is discussed. Example protocols are presented for the establishment of authenticated connections, for the management of…