Strong Coordination of Signals and Actions Over Noisy Channels With Two-Sided State Information

Cervia, Giulia; Luzzi, Laura; Treust, Maël Le; Bloch, Matthieu R.

doi:10.1109/tit.2020.2984345

Cited by 13 publications

(19 citation statements)

References 50 publications

(101 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…, so that by Lemma 7 there exists one binning (ϕ 1 , ϕ 2 ) of X such that M 1 and M 2 are almost uniform and almost independent of each other; • R 1 > H(X|Y ), so that by Lemma 6 there exists one binning ϕ 1 of X such that it is possible to reconstruct X from Y and M 1 with high probability using a Slepian-Wolf decoder via the conditional distribution P SŴ X n |M1Y n ; where we can use the same binning ϕ 1 for both conditions, as proved in [3,Remark 7].…”

Section: A Random Binning Schemementioning

confidence: 99%

“…In this paper, we provide an inner and an outer bound for the strong coordination region and show that the inner bound is achievable with polar codes. Although the achievability techniques are similar to the ones used in [3], the strictly causal nature of the encoder requires a more subtle random coding scheme with a block-Markov structure.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Strong Coordination over Noisy Channels with Strictly Causal Encoding

Cervia¹,

Luzzi²,

Treust³

et al. 2018

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

Self Cite

View full text Add to dashboard Cite

show abstract

Section: A Random Binning Schemementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Strong Coordination over Noisy Channels with Strictly Causal Encoding

Cervia¹,

Luzzi²,

Treust³

et al. 2018

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

Self Cite

View full text Add to dashboard Cite

show abstract

“…They characterize the optimal solution via the mutual information. This result was later refined by Cuff in [59] and referred to as the "coordination problem" in [60], [61], [62], [63].…”

Section: B Related Literaturementioning

confidence: 99%

Strategic Communication with Side Information at the Decoder

Treust,

Tomala

2019

Preprint

View full text Add to dashboard Cite

We investigate the problem of strategic point-to-point communication with side information at the decoder, in which the encoder and the decoder have mismatched distortion functions. The decoding process is not supervised, it returns the output sequence that minimizes the decoder's distortion function.The encoding process is designed beforehand and takes into account the decoder's distortion mismatch.When the communication channel is perfect and no side information is available at the decoder, this problem is referred to as the Bayesian persuasion game of Kamenica-Gentzkow in the Economics literature. We formulate the strategic communication scenario as a joint source-channel coding problem with side information at the decoder. The informational content of the source influences the design of the encoding since it impacts differently the two distinct distortion functions. The side information complexifies the analysis since the encoder is uncertain about the decoder's belief on the source statistics.We characterize the single-letter optimal solution by controlling the posterior beliefs induced by the Wyner-Ziv's source coding scheme. This confirms the benefit of sending encoded data bits even if the decoding process is not supervised.

show abstract

“…Physical identifiers for digital devices, such as Internet-of-Things (IoT) devices, can be implemented using physical unclonable functions (PUFs) [2]. One can use PUFs in various coding schemes as a source of local randomness [3, Chapter 1], e.g., in the randomized encoder of the wiretap channel [4] and of the strong coordination problem [5], [6].…”

Section: Introductionmentioning

confidence: 99%

Multi-Entity and Multi-Enrollment Key Agreement with Correlated Noise

Günlü¹

2020

Preprint

View full text Add to dashboard Cite

A basic model for key agreement with a remote (or hidden) source is extended to a multi-user model with joint secrecy and privacy constraints over all entities that do not trust each other. Multiple entities using different measurements of the same source through broadcast channels (BCs) to agree on mutually-independent local secret keys are considered. Our model is the proper multi-user extension of the basic model since the encoder and decoder pairs are not assumed to trust other pairs, unlike assumed in the literature. Strong secrecy constraints imposed on all secret keys jointly, which is more stringent than separate secrecy leakage constraints for each secret key considered in the literature, are satisfied. Inner bounds for maximum key rate, and minimum privacy-leakage and databasestorage rates are proposed for any finite number of entities. Inner and outer bounds for degraded and less-noisy BCs are given to illustrate cases with strong privacy. A multi-enrollment model that is used for common physical unclonable functions is considered to establish inner and outer bounds for key-leakagestorage regions that differ only in the Markov chains imposed. For this special case, the encoder and decoder measurement channels have the same channel transition matrix and secrecy leakage is measured for each secret key separately. We illustrate cases for which it is useful to have multiple enrollments as compared to a single enrollment and vice versa.

show abstract

Strong Coordination of Signals and Actions Over Noisy Channels With Two-Sided State Information

Cited by 13 publications

References 50 publications

Strong Coordination over Noisy Channels with Strictly Causal Encoding

Strong Coordination over Noisy Channels with Strictly Causal Encoding

Strategic Communication with Side Information at the Decoder

Multi-Entity and Multi-Enrollment Key Agreement with Correlated Noise

Contact Info

Product

Resources

About