pith. sign in

arxiv: 1211.4081 · v1 · pith:YN2FIKUJnew · submitted 2012-11-17 · 💻 cs.IT · math.IT

Network Equivalence in the Presence of an Eavesdropper

classification 💻 cs.IT math.IT
keywords channelnetworkwiretapeavesdroppercasechannelsnoiselesscoding
0
0 comments X
read the original abstract

We consider networks of noisy degraded wiretap channels in the presence of an eavesdropper. For the case where the eavesdropper can wiretap at most one channel at a time, we show that the secrecy capacity region, for a broad class of channels and any given network topology and communication demands, is equivalent to that of a corresponding network where each noisy wiretap channel is replaced by a noiseless wiretap channel. Thus in this case there is a separation between wiretap channel coding on each channel and secure network coding on the resulting noiseless network. We show with an example that such separation does not hold when the eavesdropper can access multiple channels at the same time, for which case we provide upper and lower bounding noiseless networks.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.