2000 character limit reached
Secure Strong Coordination (2009.01572v1)
Published 3 Sep 2020 in cs.IT and math.IT
Abstract: We consider a network of two nodes separated by a noisy channel, in which the source and its reconstruction have to be strongly coordinated, while simultaneously satisfying the strong secrecy condition with respect to an outside observer of the noisy channel. In the case of non-causal encoding and decoding, we propose a joint source-channel coding scheme for the secure strong coordination region. Furthermore, we provide a complete characterization of the secure strong coordination region when the decoder has to reliably reconstruct the source sequence and the legitimate channel is more capable than the channel of the eavesdropper.