DocumentCode :
640367
Title :
Secure cascade channel synthesis
Author :
Satpathy, Sudhir ; Cuff, Paul
Author_Institution :
Dept. of Electr. Eng., Princeton Univ., Princeton, NJ, USA
fYear :
2013
fDate :
7-12 July 2013
Firstpage :
2955
Lastpage :
2959
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 R0. We want to generate sequences Y n and Zn along nodes in the cascade such that (Xn, Y n, Zn) 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.
Keywords :
sequences; telecommunication channels; telecommunication security; cascade setting; eavesdropper; iid sequence; secure cascade channel synthesis; sequence generation; Joints; Markov processes; Mutual information; Random variables; TV; Zinc;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on
Conference_Location :
Istanbul
ISSN :
2157-8095
Type :
conf
DOI :
10.1109/ISIT.2013.6620767
Filename :
6620767
Link To Document :
بازگشت