Results 1 
5 of
5
The square root law in stegosystems with imperfect information
 Proc. 12th Information Hiding Workshop
, 2010
"... Abstract. Theoretical results about the capacity of stegosystems typically assume that one or both of the adversaries has perfect knowledge of the cover source. Socalled perfect steganography is possible if the embedder has this perfect knowledge, and the Square Root Law of capacity applies when th ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
(Show Context)
Abstract. Theoretical results about the capacity of stegosystems typically assume that one or both of the adversaries has perfect knowledge of the cover source. Socalled perfect steganography is possible if the embedder has this perfect knowledge, and the Square Root Law of capacity applies when the embedder has imperfect knowledge but the detector has perfect knowledge. The epistemology of stegosystems is underdeveloped and these assumptions are sometimes unstated. In this work we consider stegosystems where the detector has imperfect information about the cover source: once the problem is suitably formalized, we show a parallel to the Square Root Law. This answers a question raised by Böhme. 1
Reliable deniable communication: Hiding messages in noise,” http://personal.ie.cuhk.edu.hk/∼sjaggi/arxiv 01.pdf
, 2013
"... a message to a receiver Bob over a binary symmetric channel (BSC), while simultaneously ensuring that her transmission is deniable from an eavesdropper Willie. That is, if Willie listening to Alice’s transmissions over a “significantly noisier ” BSC than the one to Bob, he should be unable to estima ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
a message to a receiver Bob over a binary symmetric channel (BSC), while simultaneously ensuring that her transmission is deniable from an eavesdropper Willie. That is, if Willie listening to Alice’s transmissions over a “significantly noisier ” BSC than the one to Bob, he should be unable to estimate even whether Alice is transmitting. Even when Alice’s (potential) communication scheme is publicly known to Willie (with no common randomness between Alice and Bob), we prove that over n channel uses Alice can transmit a message of length O(√n) bits to Bob, deniably from Willie. We also prove informationtheoretically orderoptimality of our results. I.
Reliable, Deniable and Hidable Communication
"... 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 commun ..."
Abstract
 Add to MetaCart
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. I.
1Reliable Deniable Communication: Hiding Messages in Noise
"... A transmitter Alice may wish to reliably transmit a message to a receiver Bob over a binary symmetric channel (BSC), while simultaneously ensuring that her transmission is deniable from an eavesdropper Willie. That is, if Willie listening to Alice’s transmissions over a “significantly noisier ” BSC ..."
Abstract
 Add to MetaCart
A transmitter Alice may wish to reliably transmit a message to a receiver Bob over a binary symmetric channel (BSC), while simultaneously ensuring that her transmission is deniable from an eavesdropper Willie. That is, if Willie listening to Alice’s transmissions over a “significantly noisier ” BSC than the one to Bob, he should be unable to estimate even whether Alice is transmitting. Even when Alice’s (potential) communication scheme is publicly known to Willie (with no common randomness between Alice and Bob), we prove that over n channel uses Alice can transmit a message of length O(√n) bits to Bob, deniably from Willie. We also prove informationtheoretically orderoptimality of our results. I.