Capacity of Steganographic Channels
| Autor: | William A. Pearlman, Jeremiah Harmsen |
|---|---|
| Rok vydání: | 2009 |
| Předmět: |
Steganalysis
Theoretical computer science Steganography ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION Context (language use) Data_CODINGANDINFORMATIONTHEORY Function (mathematics) Adversary Library and Information Sciences Computer security computer.software_genre Information theory Computer Science Applications Information protection policy Channel capacity Distortion Algorithm design computer Algorithm Encoder Communication channel Information Systems Mathematics |
| Zdroj: | MM&Sec |
| ISSN: | 0018-9448 |
| DOI: | 10.1109/tit.2009.2012991 |
| Popis: | This work investigates a central problem in steganography, that is: How much data can safely be hidden without being detected? To answer this question, a formal definition of steganographic capacity is presented. Once this has been defined, a general formula for the capacity is developed. The formula is applicable to a very broad spectrum of channels due to the use of an information-spectrum approach. This approach allows for the analysis of arbitrary steganalyzers as well as nonstationary, nonergodic encoder and attack channels. After the general formula is presented, various simplifications are applied to gain insight into example hiding and detection methodologies. Finally, the context and applications of the work are summarized in a general discussion. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|