On Secure Communication Over Wireless Erasure Networks

A special network model which incorporates the broadcast nature of wireless transmission and models each link as a memoryless erasure channel has proven to be a useful abstraction to study wireless networks. This paper studies the secrecy capacity of unicast communication in a wireless erasure network setting in the presence of a wire-tapper. From an information-theoretic setting of perfect secrecy, both upper bounds and achievable secrecy rates are presented. Secrecy capacity is determined in closed form for a class of broadcast constrained erasure networks.