Output details
11 - Computer Science and Informatics
University of Oxford
Output title
The square root law of steganographic capacity for Markov covers.
Type
E - Conference contribution
Name of conference/published proceedings
Media Forensics and Security
Volume number
7254
Issue number
-
First page of article
0801
ISSN of proceedings
0277-786X
Year of publication
2009
Number of additional authors
2
Additional information
<13>
The Square Root Law of steganography states that the capacity of a cover object for hidden payload is proportional only to the square root of its size. First conjectured by Ker, this paper proves the conjecture in a very general sense, including the difficult case when the covers consist of correlated content, and for arbitrary mutually-independent embedding.
This theorem overturns prior notions of a secret communication “rate”, and has required the information hiding community to re-evaluate its measures of capacity. This paper is the standard reference for sub-linear capacity.
Winner of the Digital Watermarking Alliance Best Paper Award.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
25
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
