### Abstract

We analyze a two-player zero-sum game between a steganographer, Alice, and a steganalyst, Eve. In this game, Alice wants to hide a secret message of length k in a binary sequence, and Eve wants to detect whether a secret message is present. The individual positions of all binary sequences are independently distributed, but have different levels of predictability. Using knowledge of this distribution, Alice randomizes over all possible size-k subsets of embedding positions. Eve uses an optimal (possibly randomized) decision rule that considers all positions, and incorporates knowledge of both the sequence distribution and Alice’s embedding strategy. Our model extends prior work by removing restrictions on Eve’s detection power.We give defining formulas for each player’s best response strategy and minimax strategy; and we present additional structural constraints on the game’s equilibria. For the special case of length-two binary sequences, we compute explicit equilibria and provide numerical illustrations.

Original language | English (US) |
---|---|

Pages (from-to) | 69-91 |

Number of pages | 23 |

Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Volume | 8948 |

DOIs | |

State | Published - 2015 |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Adaptive steganography and steganalysis with fixed-size embedding'. Together they form a unique fingerprint.

## Cite this

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*,

*8948*, 69-91. https://doi.org/10.1007/978-3-662-46739-8_5