Secure cascade channel synthesis

Sanket Satpathy, Paul Cuff

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Scopus citations

Abstract

We investigate channel synthesis in a cascade setting where nature provides an iid sequence Xn at node 1. Node 1 can send a message at rate R1 to node 2 and node 2 can send a message at rate R2 to node 3. Additionally, all 3 nodes share bits of common randomness at rate R 0. We want to generate sequences Y n and Zn along nodes in the cascade such that (Xn, Y n, Z n) appears to be appropriately correlated and iid even to an eavesdropper who is cognizant of the messages being sent. We characterize the optimal tradeoff between the amount of common randomness used and the required rates of communication. We also solve the problem for arbitrarily long cascades and provide an inner bound for cascade channel synthesis without an eavesdropper.

Original languageEnglish (US)
Title of host publication2013 IEEE International Symposium on Information Theory, ISIT 2013
Pages2955-2959
Number of pages5
DOIs
StatePublished - 2013
Event2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey
Duration: Jul 7 2013Jul 12 2013

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Other

Other2013 IEEE International Symposium on Information Theory, ISIT 2013
Country/TerritoryTurkey
CityIstanbul
Period7/7/137/12/13

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Secure cascade channel synthesis'. Together they form a unique fingerprint.

Cite this