DocumentCode
640316
Title
Using feedback for secrecy over graphs
Author
Mishra, Shivakant ; Fragouli, Christina ; Prabhakaran, Vinod ; Diggavi, Suhas
Author_Institution
Univ. of California, Los Angeles, Los Angeles, CA, USA
fYear
2013
fDate
7-12 July 2013
Firstpage
2399
Lastpage
2403
Abstract
We study the problem of secure message multicasting over graphs in the presence of a passive (node) adversary who tries to eavesdrop in the network. We show that use of feedback, facilitated through the existence of cycles or undirected edges, enables higher rates than possible in directed acyclic graphs of the same mincut. We demonstrate this using code constructions for canonical combination networks (CCNs). We also provide general outer bounds as well as schemes for node adversaries over CCNs.
Keywords
directed graphs; telecommunication security; CNN; canonical combination networks; code constructions; directed acyclic graphs; feedback; general outer bounds; node adversaries; passive adversary; secure message multicasting; undirected edges; Downlink; Encoding; Network coding; Protocols; Receivers; Silicon;
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.6620656
Filename
6620656
Link To Document