In collaboration with Princeton University
Z. Goldfeld, P. Cuff and H. H. Permuter
Accepted to the 2017 IEEE International Symposium on Information Theory (ISIT-2017), Aachen, Germany, June 2017
To be considered for the 2017 IEEE Jack KeilWolf ISIT Student Paper Award. We study the state-dependent(SD) wiretap channel (WTC) with non-causal channel stateinformation (CSI) at the encoder. This model subsumes all otherinstances of CSI availability as special cases, and calls for anefficient utilization of the state sequence both for reliability andsecurity purposes. A lower bound on the secrecy-capacity, thatimproves upon the previously best known result by Chen andHan Vinck, is derived based on a novel superposition codingscheme. The improvement over the Chen and Han Vinck resultis strict for some SD-WTCs. Specializing the lower bound to thecase where CSI is also available to the decoder reveals that itis at least as good as the achievable formula by Chia and ElGamal,which is already known to outperform the adaptationof the Chen and Han Vinck code to the encoder and decoderCSI scenario. The results are derived under the strict semanticsecuritymetric that requires negligible information leakage forall message distributions. The proof of achievability relies ona stronger version of the soft-covering lemma for superpositioncodes.