Using Feedback for Secrecy over Graphs
Information Theory
2013-05-29 v2 Cryptography and Security
math.IT
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.
Cite
@article{arxiv.1305.3051,
title = {Using Feedback for Secrecy over Graphs},
author = {Shaunak Mishra and Christina Fragouli and Vinod Prabhakaran and Suhas Diggavi},
journal= {arXiv preprint arXiv:1305.3051},
year = {2013}
}
Comments
6 pages, 5 figures, a shorter version of this work will appear in the proceedings of ISIT 2013, minor changes in presentation