Capacity laws for steganography in a crowd
A steganographer is not only hiding a payload inside their cover, they are also hiding themselves amongst the non-steganographers. In this paper we study asymptotic rates of growth for steganographic data – analogous to the classical Square-Root Law – in the context of a ‘crowd’ of K actors, one of...
| Main Author: | |
|---|---|
| Format: | Conference item |
| Language: | English |
| Published: |
Association for Computing Machinery
2022
|