Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
In this paper we consider secret communication between two special nodes ("source" and "destination") in a wireless network with authenticated relays: the message communicated to the destination is to be kept information-theoretically (unconditionally) secret from any eavesdropper within a class. A public feedback channel from the destination to all nodes may or may not be available. We focus on a one-relay network with a bottleneck link between the source and the relay to illustrate the ideas. For this particular network, we derive the rate-equivocation capacity region when the public feedback channel is absent, and an achievable secret key rate when public feedback is present.
Emre Telatar, Arno Schneuwly, Derya Malak
Jean-Pierre Hubaux, Bryan Alexander Ford, Mahdi Zamani, Italo Ivan Dacosta Petrocelli, Ludovic Barman