Secure Cascade Channel Synthesis

Sanket Satpathy, Paul Cuff

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


We consider the problem of generating correlated random variables in a distributed fashion, where communication is constrained to a cascade network. The first node in the cascade observes an i.i.d. sequence Xn locally before initiating communication along the cascade. All nodes share bits of common randomness that are independent of Xn. We consider secure synthesis-random variables produced by the system appear to be appropriately correlated and i.i.d. even to an eavesdropper who is cognizant of the communication transmissions. We characterize the optimal tradeoff between the amount of common randomness used and the required rates of communication. We find that not only does common randomness help, its usage exceeds the communication rate requirements. The most efficient scheme is based on a superposition codebook, with the first node selecting messages for all downstream nodes. We also provide a fleeting view of related problems, demonstrating how the optimal rate region may shrink or expand.

Original languageEnglish (US)
Article number7506245
Pages (from-to)6081-6094
Number of pages14
JournalIEEE Transactions on Information Theory
Issue number11
StatePublished - Nov 2016

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


  • Channel simulation
  • Secrecy
  • cascade network
  • channel synthesis
  • resolvability
  • soft covering
  • strong coordination


Dive into the research topics of 'Secure Cascade Channel Synthesis'. Together they form a unique fingerprint.

Cite this