Modelling and Analysis Network Security -- a PVCCS approach
This work addresses network security modeling for scenarios with attackers and defenders, but it appears incremental as it applies existing methods like probabilistic bisimulation and graph theory to a specific case.
The authors tackled the problem of modeling and analyzing network security scenarios with probabilistic value-passing CCS, resulting in the design of two algorithms for computing Nash Equilibrium and Social Optimal strategies, with correctness proofs and implementations provided.
In this work, we propose a probabilistic value-passing CCS (Calculus of Communicating System) approach to model and analyze a typical network security scenario with one attacker and one defender. By minimizing this model with respect to probabilistic bisimulation and abstracting it through graph-theoretic methods, two algorithms based on backward induction are designed to compute Nash Equilibrium strategy and Social Optimal strategy respectively. For each algorithm, the correctness is proved and an implementation is realized. Finally, this approach is illustrated by a detailed case study.