Automated Game-Theoretic Verification of Security Systems

Research output: Chapter in Book/Report/Conference proceedingPublished conference contribution

Abstract

Security-sensitive computerised communication systems are of increasing importance, however checking that they function correctly can be non-trivial. We propose automated verification techniques for the formal analysis of quantitative properties of such systems. Since communication networks typically require the collaboration of their participants to work effectively, we adopt a game-theoretic approach. Utility functions for each player, such as the degree of security offered and the communication costs incurred, are formally specified using quantitative temporal logics. Then, building upon probabilistic verification techniques for parametric Markov chains, we develop methods to identify Nash equilibria representing stable strategies for the participants. We implement our methods as an extension of the PRISM model checker, and illustrate their applicability by studying anonymity-cost trade-offs in the Crowds anonymity protocol.
Original languageEnglish
Title of host publication16th International Conference on Quantitative Evaluation of Systems (QEST)
EditorsDavid Parker, Verena Wolf
PublisherSpringer
Pages239-256
Number of pages18
Volume11785
DOIs
Publication statusPublished - 18 Oct 2019

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume11785

Fingerprint

Dive into the research topics of 'Automated Game-Theoretic Verification of Security Systems'. Together they form a unique fingerprint.

Cite this