Modelling and Analysis Network Security -- a PVCCS approach

TL;DR

This paper introduces a probabilistic CCS-based method for modeling and analyzing network security scenarios, enabling the computation of Nash Equilibrium and Social Optimal strategies through graph-theoretic algorithms.

Contribution

It presents a novel probabilistic CCS framework and two algorithms for strategic analysis in network security, with proofs and implementation details.

Findings

Algorithms successfully compute Nash and social optimal strategies.

Modeling approach effectively captures attacker-defender interactions.

Case study demonstrates practical applicability.

Abstract

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.