Secure cascade channel synthesis

Sanket Satpathy; Paul Cuff

doi:10.1109/ISIT.2013.6620767

Secure cascade channel synthesis

Sanket Satpathy, Paul Cuff

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

11 Scopus citations

Abstract

We investigate channel synthesis in a cascade setting where nature provides an iid sequence Xⁿ at node 1. Node 1 can send a message at rate R₁ to node 2 and node 2 can send a message at rate R₂ to node 3. Additionally, all 3 nodes share bits of common randomness at rate R ₀. We want to generate sequences Y ⁿ and Zⁿ along nodes in the cascade such that (Xⁿ, Y ⁿ, Z ⁿ) 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 language	English (US)
Title of host publication	2013 IEEE International Symposium on Information Theory, ISIT 2013
Pages	2955-2959
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2013.6620767
State	Published - 2013
Event	2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey Duration: Jul 7 2013 → Jul 12 2013

Publication series

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

Other

Other	2013 IEEE International Symposium on Information Theory, ISIT 2013
Country/Territory	Turkey
City	Istanbul
Period	7/7/13 → 7/12/13

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2013.6620767

Cite this

@inproceedings{befd19bffe5e44468c1737860a977645,

title = "Secure cascade channel synthesis",

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.",

author = "Sanket Satpathy and Paul Cuff",

year = "2013",

doi = "10.1109/ISIT.2013.6620767",

language = "English (US)",

isbn = "9781479904464",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "2955--2959",

booktitle = "2013 IEEE International Symposium on Information Theory, ISIT 2013",

note = "2013 IEEE International Symposium on Information Theory, ISIT 2013 ; Conference date: 07-07-2013 Through 12-07-2013",

}

TY - GEN

T1 - Secure cascade channel synthesis

AU - Satpathy, Sanket

AU - Cuff, Paul

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84890328416&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84890328416&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2013.6620767

DO - 10.1109/ISIT.2013.6620767

M3 - Conference contribution

AN - SCOPUS:84890328416

SN - 9781479904464

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2955

EP - 2959

BT - 2013 IEEE International Symposium on Information Theory, ISIT 2013

T2 - 2013 IEEE International Symposium on Information Theory, ISIT 2013

Y2 - 7 July 2013 through 12 July 2013

ER -

Secure cascade channel synthesis

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this