Asymptotically optimal perfect steganographic systems

Ryabko, Boris; Ryabko, Daniil

doi:10.1134/s0032946009020094

Cited by 27 publications

(53 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(A cryptographic secret key would still be needed to keep the content of the payload from the enemy.) This parallels a result by Ryabko [16], which applies in the very different context of perfect steganography. The results in [16] demonstrate that no stego key is needed even when embedding an asymptotically maximum capacity payload, though the case of perfect steganography is completely different and the capacities are linear in the cover size.…”

Section: Introductionsupporting

confidence: 67%

“…This emphasises the difference between steganographic security, where the covers are not altered sufficiently for the changes to be detectable, and cryptographic security which prevents the enemy from understanding the payload. The same applies to the perfect steganography result in [16], where the embedding distortion is perfectly undetectable but the enemy can still read the payload if it is not encrypted.…”

Section: A Simple Solutionmentioning

confidence: 84%

See 1 more Smart Citation

The square root law does not require a linear key

Ker

2010

Proceedings of the 12th ACM Workshop on Multimedia and Security

View full text Add to dashboard Cite

Square root laws are theorems about imperfect steganography, embedding which fails to preserve all statistical properties of covers. They show that, in various situations, capacity of covers grows only with the square root of the available cover size. In a paper given at this conference last year [14], we showed an important caveat: when the sender's and recipient's shared embedding key determines the embedding path, its length must be at least linear in the size of the hidden payload to avoid their enemy exhausting over all possible sets of locations. It was left open to show that a linear key is sufficient.There is no necessity, however, for the recipient to know exactly which locations were changed during the embedding process. In this paper we remove that condition, allowing the embedder to combine more than one cover location to convey one bit of payload. As long as the embedder lives beneath the classic square root law bound, we can do more than prove the sufficiency of a linear key: we can even show that asymptotically perfect steganographic security is possible with no key at all. Furthermore, by computing Steganographic Fisher Information, we can show that the keyless embedding tends to perfect security at least as fast as the "ideal" embedding, which requires an unfeasibly large key to spread payload uniformly at random over the cover. Finally, we show asymptotic perfect security of a simple matrix embedding, which allows payload capacity of order √ n log n to be achieved.

show abstract

Section: Introductionsupporting

confidence: 67%

Section: A Simple Solutionmentioning

confidence: 84%

The square root law does not require a linear key

Ker

2010

Proceedings of the 12th ACM Workshop on Multimedia and Security

View full text Add to dashboard Cite

show abstract

“…Many works characterize the capacity of various steganographic problems -see for instance [4][5][6][7][8]. An important exception to the non-zero covertext assumption occurs in the work of Bash, Goeckel and Towsley [1, 2] -we discuss this work in depth below.…”

Section: Related Work a Steganographymentioning

confidence: 99%

“…This key is usually sent via a secure channel between Alice and Bob which is not known by Willie. Also, there are some of the works by [5,8] do not make this assumption of a shared key.…”

Section: Related Work a Steganographymentioning

confidence: 99%

See 1 more Smart Citation

Reliable, deniable and hidable communication

Hou

Bakshi

Chan

et al. 2014

2014 Information Theory and Applications Workshop (ITA)

View full text Add to dashboard Cite

Abstract-Alice wishes to potentially communicate covertly with Bob over a Binary Symmetric Channel while Willie the wiretapper listens in over a channel that is noisier than Bob's. We show that Alice can send her messages reliably to Bob while ensuring that even whether or not she is actively communicating is (a) deniable to Willie, and (b) optionally, her message is also hidable from Willie. We consider two different variants of the problem depending on the Alice's "default" behavior, i.e., her transmission statistics when she has no covert message to send: 1) When Alice has no covert message, she stays "silent", i.e., her transmission is 0; 2) When has no covert message, she transmits "innocently", i.e., her transmission is drawn uniformly from an innocent random codebook; We prove that the best rate at which Alice can communicate both deniably and hidably in model 1 is O(1/ √ n). On the other hand, in model 2, Alice can communicate at a constant rate.

show abstract

On the Way to Perfect Steganography

Jakubski

Bobulski

2017

Image Processing and Communications Challenges 9

View full text Add to dashboard Cite

Asymptotically optimal perfect steganographic systems

Cited by 27 publications

References 5 publications

The square root law does not require a linear key

The square root law does not require a linear key

Reliable, deniable and hidable communication

On the Way to Perfect Steganography

Contact Info

Product

Resources

About