Skip to content
Open access

Steganography and Probabilistic Risk Analysis: A Game Theoretical Framework for Quantifying Adversary Advantage and Impact

Dec 2024 · PeerJ Computer Science · Vol abs/2412.17950 · 0 citations · 170 references
Computer Science

TL;DR

A game-theoretic model of steganographic operations that captures the strategic interaction between a defender and an adversary through calibrated monetary primitives and nonlinear utility mappings is presented, and adversarial advantage can be translated into interpretable monetary risk estimates for assessing whether steganographic defences decrease, amplify, or only marginally affect organisational exposure.

Abstract

In environments where adversaries engage in active surveillance and covert communication, defenders face the dual challenge of when to deploy steganography and whether it yields measurable operational benefit. We present a game-theoretic model of steganographic operations that captures the strategic interaction between a defender and an adversary through calibrated monetary primitives and nonlinear utility mappings. The model derives mixed-strategy equilibria that determine conditional and unconditional success rates for hiding and detection, and introduces a time-varying adversarial advantage metric that quantifies when an attacker’s incentive exceeds the defender’s effective concealment or detection capability. By linking this advantage to a currency-unit risk measure, we extend the classical risk formulation into a decision-aware, monetised framework. The quantitative evaluation combines nonlinear equilibrium analysis, a Monte Carlo ensemble of 10,000 draws, and empirical calibration on Break Our Steganographic System database (BOSSbase) 1.01 using four spatial-domain adaptive steganographic methods: Wavelet Obtained Weights (WOW), Spatial Universal Wavelet Relative Distortion (S-UNIWARD), High-pass, Low-pass and Low-pass (HILL), and Minimising the Probability of Detection (MiPOD). The payloads are 0.100, 0.200, and 0.400 bits per pixel. Two lightweight convolutional neural-network steganalysis back-ends are used to estimate the defender signal, defined as 1 − TPR@FPR = 0.10. The aggregated trajectories show persistent positive adversarial advantage in most configurations, with mean normalised advantage reaching 0.22 and maximum normalised risk reaching 0.20. Lower-risk cases show average positive advantage of approximately 0.01, while higher-risk regimes reach approximately 0.18 to 0.19. In the monetary setting, the maximum epoch-level risk reaches £210,375, high-risk configurations produce mean risks close to £196,000, and the maximum observed security benefit is £11,250. Detector performance further shows best-epoch area under the curve (AUC) values of at least 0.95 for the more stable detector, while the more volatile detector produces defender-signal values spanning approximately 0.015 to 0.915. These results show that adversarial advantage can be translated into interpretable monetary risk estimates for assessing whether steganographic defences decrease, amplify, or only marginally affect organisational exposure.

Read PDF

Similar papers

Conference Aug 2026

Game-Theoretic Defense Against Hardware Trojans with Multi-Level Strategies

Hardware Trojans are malicious circuit modifications that can be covertly inserted during the design or fabrication of integrated circuits, enabling leakage, performance degradation, or mission failure after deployment. Because exhaustive testing against all Trojan classes and activation behaviors are prohibitively exp...

Soraya Partow, Satyaki Nan · 0 citations
Conference Open access Sep 2026

Beyond Homogeneous Adversaries: Stackelberg Security Games with Mixed Quantal Response

A polynomial-time approximation scheme for SSG with mixed quantal response attackers, where the follower population consists of multiple discrete attacker types, each following a type-specific QR model, is developed based on an exponential cone programming formulation combined with a carefully designed Branch-and-Bound...

Hoang Giang Pham, Tien Mai, Thuy Anh Ta et al. · 0 citations
Jul 2026

Game of Coding under Computation-Dependent Adversarial Noise

This paper introduces a unified multi-node, multidimensional formulation of the game of coding with input-dependent adversarial noise, and constructs an input-independent joint noise distribution that exactly preserves the probability of acceptance and the accepted mean-squared estimation error.

Hanzaleh Akbari Nodehi, M. Maddah-ali · 0 citations
Preprint Jul 2026

The Power of Backdoor Absorption in Community Training

It is proved that the success probability of any bounded adversary asymptotically collapses to zero under a defense strategy combining natural absorption, a randomized scheduler, and lazy verification oracle, which yields a provably sound and computationally efficient defense for safety-critical AI.

Issam Seddik, Sami Souihi, Mohamed Tamaazousti et al. · 0 citations
Open access 2026

HEbdMIA: Lightweight Logit Encryption for Membership Inference Defense

HEbdMIA is a lightweight homomorphic encryption-based defense that operates at the post-inference stage by encrypting model output logits without requiring retraining or architectural modifications, indicating that HEbdMIA provides an effective, scalable, and deployment-friendly solution for enhancing privacy in real-w...

Akash Shah, M. A. Wani, R. Chaturvedi et al. · 0 citations
Conference Open access 2026

Adversarial Distance Metrics: A Threat to Fairness in Clustering-Based Decision Systems

An insider adversary manipulates the distance function to induce discriminatory clustering outcomes against demographic groups, exposing a gap in current fairness auditing practices and demonstrating the urgent need to expand the scope of the algorithmic audit to include distance-function verification.

Shahzad Ahmad, Stefan Rass, Enes Sovtic · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.