The square root law of steganography: Bringing theory closer to practice

<p>There are two interpretations of the term `square root law of steganography'. As a rule of thumb, that the secure capacity of an imperfect stegosystem scales only with the square root of the cover size (not linearly as for perfect stegosystems), it acts as a robust guide in multiple st...

Full description

Bibliographic Details
Main Author: Ker, A
Format: Conference item
Published: Association for Computing Machinery 2017
_version_ 1797061933597196288
author Ker, A
author_facet Ker, A
author_sort Ker, A
collection OXFORD
description <p>There are two interpretations of the term `square root law of steganography'. As a rule of thumb, that the secure capacity of an imperfect stegosystem scales only with the square root of the cover size (not linearly as for perfect stegosystems), it acts as a robust guide in multiple steganographic domains. As a mathematical theorem, it is unfortunately limited to artificial models of covers that are a long way from real digital media objects: independent pixels or first-order stationary Markov chains. It is also limited to models of embedding where the changes are uniformly distributed and, for the most part, independent.</p> <br/> <p>This paper brings the theoretical square root law closer to the practice of digital media steganography, by extending it to cases where the covers are Markov Random Fields, including inhomogeneous Markov chains and Ising models. New proof techniques are required. We also consider what a square root law should say about adaptive embedding, where the changes are not uniformly located, and state a conjecture about it.</p>
first_indexed 2024-03-06T20:38:16Z
format Conference item
id oxford-uuid:335ed32c-977a-4d7f-adc3-3e5c0b90a124
institution University of Oxford
last_indexed 2024-03-06T20:38:16Z
publishDate 2017
publisher Association for Computing Machinery
record_format dspace
spelling oxford-uuid:335ed32c-977a-4d7f-adc3-3e5c0b90a1242022-03-26T13:19:52ZThe square root law of steganography: Bringing theory closer to practiceConference itemhttp://purl.org/coar/resource_type/c_5794uuid:335ed32c-977a-4d7f-adc3-3e5c0b90a124Symplectic Elements at OxfordAssociation for Computing Machinery2017Ker, A<p>There are two interpretations of the term `square root law of steganography'. As a rule of thumb, that the secure capacity of an imperfect stegosystem scales only with the square root of the cover size (not linearly as for perfect stegosystems), it acts as a robust guide in multiple steganographic domains. As a mathematical theorem, it is unfortunately limited to artificial models of covers that are a long way from real digital media objects: independent pixels or first-order stationary Markov chains. It is also limited to models of embedding where the changes are uniformly distributed and, for the most part, independent.</p> <br/> <p>This paper brings the theoretical square root law closer to the practice of digital media steganography, by extending it to cases where the covers are Markov Random Fields, including inhomogeneous Markov chains and Ising models. New proof techniques are required. We also consider what a square root law should say about adaptive embedding, where the changes are not uniformly located, and state a conjecture about it.</p>
spellingShingle Ker, A
The square root law of steganography: Bringing theory closer to practice
title The square root law of steganography: Bringing theory closer to practice
title_full The square root law of steganography: Bringing theory closer to practice
title_fullStr The square root law of steganography: Bringing theory closer to practice
title_full_unstemmed The square root law of steganography: Bringing theory closer to practice
title_short The square root law of steganography: Bringing theory closer to practice
title_sort square root law of steganography bringing theory closer to practice
work_keys_str_mv AT kera thesquarerootlawofsteganographybringingtheoryclosertopractice
AT kera squarerootlawofsteganographybringingtheoryclosertopractice