Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
The main goal in network information theory is to identify fundamental limits of communication over networks, and design solutions which perform close to such limits. After several decades of effort, many important problems still do not have a characteriza ...
This thesis is primarily concerned with two security mechanisms for wireless networks: location verification and key management. These mechanisms are potential building blocks in the security architectures of a range of applications. Under location verific ...
The aim of information-theoretic secrecy is to ensure that an eavesdropper who listens to the wireless transmission of a message can only collect an arbitrarily small number of information bits about this message. In contrast to cryptography, there are no ...
Providing real-time multimedia services over a best-effort network is challenging due to the stringent delay requirements in the presence of complex network dynamics. Multiple description (MD) coding is one approach to transmit the media over diverse (mult ...
A fundamental problem in wireless networks is determining the broadcast capacity, i.e., the maximum data transfer rate from a given node to every other node in a relay network. This paper studies the scaling of the broadcast capacity for a network with a s ...
Most of the known public-key cryptosystems have an overall complexity which is dominated by the key-production algorithm, which requires the generation of prime numbers. This is most inconvenient in settings where the key-generation is not an one-off proce ...
We examine routing over two classes of orthogonal information networks. The first is a relay network with orthogonal inputs. The nodes in this network do not broadcast, but communicate to the different nodes via independent inputs. There is multiple access ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008
We characterize the secret message capacity of a wiretapped erasure channel where causal channel state informa- tion of the honest nodes is publicly available. In doing so, we establish an intimate connection between message secrecy and secret key generati ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011
Confidential communication aided by a relay without security clearance is studied. General strategies and outer bounds are derived for the problem of secret communication and secret key generation when correlated observations at all terminals are available ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009
We investigate the problem of collaborative video streaming with Raptor network coding over overlay networks. We exploit path and source diversity, as well as basic processing capabilities of network nodes to increase the overall throughput and improve the ...
