Reliable, deniable and hidable communication: A quick survey

Hou, Pak; Kadhe, Swanand; Bakshi, Mayank; Chan, Chung; Jaggi, Sidharth; Sprintson, Alex

doi:10.1109/itw.2014.6970826

Cited by 20 publications

(13 citation statements)

References 33 publications

(39 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A length-n sequenceX = Π 2 (Π 1 (X)) is obtained after the two permutations. Note that to guarantee covertness, the parameter d, which determines the length ofC, cannot 10 Note that K 2 may or may not be uniformly distributed from James' perspective , (1 − d )-covertness can be guaranteed. In the following let's focus on the selected d √ n locations corresponding toX.…”

Section: Definitionmentioning

confidence: 99%

“…However, the number of (K 1 , K 2 ) pairs satisfying this equation is exactly n 3 , and each pair contains a distinct K 1 , hence from James' perspective the first part of the key, K 1 , is still uniformly distributed. 10 Alice's transmission pair (m, h) is consistent with the shared key K by default. For any message-hash pair (m , h ) = (m, h), the probability that (m , h ) is consistent with the common randomness K equals…”

mentioning

confidence: 99%

See 1 more Smart Citation

Covert Communication over Adversarially Jammed Channels

Zhang

Bakshi

Jaggi

2018

2018 IEEE Information Theory Workshop (ITW)

Self Cite

View full text Add to dashboard Cite

We consider a situation in which a transmitter Alice may wish to communicate with a receiver Bob over an adversarial channel. An active adversary James eavesdrops on their communication over a binary symmetric channel (BSC(q)), and may maliciously flip (up to) a certain fraction p of their transmitted bits. The communication should be both covert and reliable. Covertness requires that the adversary James should be unable to estimate whether or not Alice is communicating based on his noisy observations, while reliability requires that the receiver Bob should be able to correctly recover Alice's message with high probability.Unlike the setting with passive adversaries considered thus far in the literature, we show that reliable covert communication in the presence of actively jamming adversaries requires Alice and Bob to have a shared key (unknown to James). The optimal throughput obtainable depends critically on the size of this key:• When Alice and Bob's shared key is less than 1 2 log(n) bits, no communication that is simultaneously covert and reliable is possible. This is true even under reasonable computational assumptions on James, and if his jamming is required to be causal. Conversely, when the shared key is larger than 6 log(n), the optimal throughput scales as O( √ n) -we explicitly characterize even the constant factor (with matching inner and outer bounds) for a wide range of parameters of interest. • When Alice and Bob have a large amount (ω( √ n) bits) of shared key, we again present a tight covert capacity characterization for all parameters of interest, and the capacity is independent of the number of bits in the shared key as long as it is larger than ω( √ n) (again regardless of computational or causality assumptions on James). • When the size of the shared key is "moderate" (belongs to (Ω(log(n)), O( √ n))), we show an achievable coding scheme as well as an outer bound on the information-theoretically optimal throughput. • When Alice and Bob's shared key is O( √ n log(n)) bits, we develop a computationally efficient coding scheme for Alice/Bob whose throughput is only a constant factor smaller than information-theoretically optimal, and it ensures both covertness and reliability even against a computationally unbounded adversary James. I. INTRODUCTIONThe security of our communication schemes is of significant concern -Big Brother is often watching! While much attention focuses on schemes that aim to hide the content of communication, in many scenarios, the fact of communication should also be kept secret. For example, a secret agent being caught communicating with an accomplice is of potentially drastic consequences -merely ensuring secrecy does not guarantee undetectability. This observation has drawn attention to the problem of covert communication. In a canonical information-theoretic setting for this problem, a transmitter Alice may wish to transmit messages to a receiver Bob over a noisy channel, and remains silent otherwise. James eavesdrops on her transmission through another noisy channel...

show abstract

Section: Definitionmentioning

confidence: 99%

mentioning

confidence: 99%

Covert Communication over Adversarially Jammed Channels

Zhang

Bakshi

Jaggi

2018

2018 IEEE Information Theory Workshop (ITW)

Self Cite

View full text Add to dashboard Cite

show abstract

“…(13) 1 We note that λ = 1 is due to the unknown or equal a priori probabilities, i.e., P 0 and P 1 are unknown or equal, where P 0 is the a priori probability that H 0 is true, P 1 is the a priori probability that H 1 is true, and P 0 + P 1 = 1. If both P 0 and P 1 are known, the total error rate is reformulated as ξ = P 0 P F + P 1 P M and the optimal test that minimizes this reformulated ξ is the likelihood ratio test with λ = P 1 /P 0 .…”

Section: Binary Hypothesis Testing At Williementioning

confidence: 99%

“…This is due to the fact that (for example) the exposure of this transmission may disclose the user's location information, which probably violates the privacy of the user. Therefore, covert communication is attracting an increasing amount of research interests recently (e.g., [1][2][3]). In covert communication, a transmitter (Alice) intends to communicate with a legitimate receiver (Bob) without being detected by a warden (Willie), who is observing this communication.…”

Section: Introductionmentioning

confidence: 99%

Covert communication with finite blocklength in AWGN channels

Yan

Cong

et al. 2017

2017 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Abstract-Covert communication is to achieve a reliable transmission from a transmitter to a receiver while guaranteeing an arbitrarily small probability of this transmission being detected by a warden. In this work, we study the covert communication in AWGN channels with finite blocklength, in which the number of channel uses is finite. Specifically, we analytically prove that the entire block (all available channel uses) should be utilized to maximize the effective throughput of the transmission subject to a predetermined covert requirement. This is a nontrivial result because more channel uses results in more observations at the warden for detecting the transmission. We also determine the maximum allowable transmit power per channel use, which is shown to decrease as the blocklength increases. Despite the decrease in the maximum allowable transmit power per channel use, the maximum allowable total power over the entire block is proved to increase with the blocklength, which leads to the fact that the effective throughput increases with the blocklength.

show abstract

“…The intuition behind the covert schemes first presented in [13] and elaborated on in other works such as [2], [14], [16]- [20], [22], [30] is that most reasonable noise processes have, with non-zero probability, "some deviation" in the "noise intensity". For instance, a length-n Bernoulli(q) sequence (corresponding to the additive noise sequence in a BSC(q) -a Binary Symmetric Channel with crossover probability q -the channel from the transmitter Alice to the eavesdropper Willie) has expected value nq, but has standard deviation nq (1 − q).…”

Section: A Challengesmentioning

confidence: 99%

Computationally efficient deniable communication

Zhang

Bakshi

Jaggi

2016

2016 IEEE International Symposium on Information Theory (ISIT)

Self Cite

View full text Add to dashboard Cite

In this paper, we design the first computationally efficient codes for simultaneously reliable and deniable communication over a Binary Symmetric Channel (BSC). Our setting is as follows -a transmitter Alice wishes to potentially reliably transmit a message to a receiver Bob, while ensuring that the transmission taking place is deniable from eavesdropper Willie (who hears Alice's transmission over a noisier BSC). Prior works show that Alice can reliably and deniably transmit O( √ n) bits over n channel uses without any shared secret between Alice and Bob. One drawback of prior works is that the computational complexity of the codes designed scales as 2 Θ( √ n) . In this work we provide the first computationally tractable codes with provable guarantees on both reliability and deniability, while simultaneously achieving the best known throughput for the problem.

show abstract

Reliable, deniable and hidable communication: A quick survey

Cited by 20 publications

References 33 publications

Covert Communication over Adversarially Jammed Channels

Covert Communication over Adversarially Jammed Channels

Covert communication with finite blocklength in AWGN channels

Computationally efficient deniable communication

Contact Info

Product

Resources

About