Physical Layer Security over Wiretap Channels with Random Parameters

  • Ziv GoldfeldEmail author
  • Paul Cuff
  • Haim H. Permuter
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10332)


We study semantically secure communication over state dependent (SD) wiretap channels (WTCs) with non-causal channel state information (CSI) at the encoder. This model subsumes all other instances of CSI availability as special cases, and calls for an efficient utilization of the state sequence both for reliability and security purposes. A lower bound on the secrecy-capacity, that improves upon the previously best known result by Chen and Han Vinck, is derived based on a novel superposition coding scheme. The improvement over the Chen and Han Vinck result is strict for some SD-WTCs. Specializing the lower bound to the case where CSI is also available to the decoder reveals that it is at least as good as the achievable formula by Chia and El-Gamal, which is already known to outperform the adaptation of the Chen and Han Vinck code to the encoder and decoder CSI scenario. The results are derived under the strict semantic security metric that requires negligible information leakage for all message distributions. The proof of achievability relies on a stronger version of the soft-covering lemma for superposition codes. The lower bound is shown to be tight for a class of reversely less-noisy SD-WTCs, thus characterizing the fundamental limit of reliable a secure communication. An explicit coding scheme that includes a key extraction phase via the random state sequence is also proposed.


Channel State Information State Sequence Secret Message Wiretap Channel Superposition Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Johnson, M.W., et al.: Quantum annealing with manufactured spins. Nature 473(7346), 194–198 (2011)CrossRefGoogle Scholar
  2. 2.
    Jones, N.: Google and NASA snap up quantum computer D-Wave Two (2013).
  3. 3.
    Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303–332 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Bernstein, D.J.: Introduction to post-quantum cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-quantum Cryptography, pp. 1–14. Springer, Heidelberg (2009)Google Scholar
  5. 5.
    Perlner, R.A., Cooper, D.A.: Quantum resistant public key cryptography: a survey. In: Proceedings of Symposium Identity and Trust on the Internet (IDtrust), Gaithersburg, Maryland, pp. 85–93. ACM, April 2009Google Scholar
  6. 6.
    Bloch, M., Barros, J.: Physical-Layer Security: From Information Theory to Security Engineering. Cambridge University Press, Cambridge (2011)CrossRefzbMATHGoogle Scholar
  7. 7.
    Wyner, A.D.: The wire-tap channel. Bell Syst. Technol. 54(8), 1355–1387 (1975)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Gelfand, S.I., Pinsker, M.S.: Coding for channel with random parameters. Probl. Pered. Inform. (Probl. Control Inf. Theor.) 9(1), 19–31 (1980)Google Scholar
  9. 9.
    Chen, Y., Han Vinck, A.J.: Wiretap channel with side information. IEEE Trans. Inf. Theor. 54(1), 395–402 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Liu, W., Chen, B.: Wiretap channel with two-sided state information. In: Proceedings of 41st Asilomar Conference Signals, System and Computer, Pacific Grove, CA, US, pp. 893–897 (2007)Google Scholar
  11. 11.
    Chia, Y.-K., El Gamal, A.: Wiretap channel with causal state information. IEEE Trans. Inf. Theor. 58(5), 2838–2849 (2012)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Song, E., Cuff, P., Poor, V.: The likelihood encoder for lossy compression. IEEE Trans. Inf. Theor. 62(4), 1836–1849 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Bellare, M., Tessaro, S., Vardy, A.: A cryptographic treatment of the wiretap channel. In: Proceedings of Advance Cryptology, (CRYPTO 2012), Santa Barbara, CA, USA (2012)Google Scholar
  14. 14.
    Goldfeld, Z., Cuff, P., Permuter, H.H.: Wiretap channel with random states non-causally available at the encoder. IEEE Trans. Inf. Theor. (2016, submitted)Google Scholar
  15. 15.
    Goldfeld, Z., Cuff, P., Permuter, H.H.: Arbitrarily varying wiretap channels with type constrained states. IEEE Trans. Inf. Theor. 62(12), 7216–7244 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Khisti, A., Diggavi, S.N., Wornell, G.W.: Secret-key generation using correlated sources and channels. IEEE Trans. Inf. Theor. 58(2), 652–670 (2012)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Kramer, G.: Teaching IT: an identity for the Gelfand-Pinsker converse. IEEE Inf. Theor. Soc. Newslett. 61(4), 4–6 (2011)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Ben Gurion University of the NegevBeer ShevaIsrael
  2. 2.Princeton UniversityPrincetonUSA

Personalised recommendations