Heuristic Methods for Security Protocols
Qurat ul Ain Nizamani (Department of Computer Science, University of, Leicester, UK), Emilio Tuosto (Department of Computer Science, University of, Leicester, UK)

TL;DR
This paper introduces a heuristic approach that improves the efficiency of model checking cryptographic security protocols by prioritizing state exploration based on security properties, addressing the state-space explosion problem.
Contribution
It proposes a security property-dependent heuristic that weights states using security formulae to enhance attack search in model checking of cryptographic protocols.
Findings
Heuristic reduces state-space exploration time.
Improves detection of security violations.
Addresses state-space explosion in protocol verification.
Abstract
Model checking is an automatic verification technique to verify hardware and software systems. However it suffers from state-space explosion problem. In this paper we address this problem in the context of cryptographic protocols by proposing a security property-dependent heuristic. The heuristic weights the state space by exploiting the security formulae; the weights may then be used to explore the state space when searching for attacks.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
