Learn More
We study secure source-coding with causal disclosure, under the Gaussian distribution. The optimality of Gaussian auxiliary random variables is shown in various scenarios. We explicitly characterize the tradeoff between the rates of communication and secret key. This tradeoff is the result of a mutual information optimization under Markov constraints. As a(More)
We investigate channel synthesis in a cascade setting where nature provides an iid sequence X<sup>n</sup> at node 1. Node 1 can send a message at rate R<sub>1</sub> to node 2 and node 2 can send a message at rate R<sub>2</sub> to node 3. Additionally, all 3 nodes share bits of common randomness at rate R<sub>0</sub>. We want to generate sequences Y(More)
We investigate the problem of secure source coding with a two-sided helper in a game-theoretic framework. Alice (A) and Helen (H) view iid correlated information sequences X<sup>n</sup> and Y<sup>n</sup> respectively. Alice communicates to Bob (B) at rate R, while H broadcasts a message to both A and B at rate R<sub>H</sub>. Additionally, A and B share(More)
  • 1