February 24, 2015 (Tuesday: Please note the non-regular day)
Sanjay Karmakar, Electrical and Computer Engineering, NDSU: Information Theoretic secrecy in wireless networks (Part II)
February 10, 2015 (Tuesday: Please note the non-regular day)
Sanjay Karmakar, Electrical and Computer Engineering, NDSU: Information Theoretic secrecy in wireless networks (Part I)
A practical communication scenario will be considered where the information/signal exchanged between a
legitimate pair (Say Bob and Alice) is also observed by an eavesdropping node (Eve). The challenge under this circumstance is to establish an effective
and secure communication link between Bob and Alice. The objective is to find the best possible information rate at which reliable communication can
take place even in the presence of Eve. Here, the information theoretic approach to attain secrecy will be discussed which is different from the
traditional cryptographic approach and therefore, is independent of the computational capabilities of Eve. Starting with a brief description of
the relevant yet basic information theoretic tools and/or definitions we shall pose the communication problem as a mathematical optimization
problem of a real valued objective function defined over the set of probability distribution functions which satisfy certain well defined condition/s.
In this talk, we shall discuss a partial solution of this secret communication problem and also raise some open questions which are interesting in
their own right.