Advertisement

Broadcast Channels with Confidential Messages: Channel Uncertainty, Robustness, and Continuity

  • Rafael F. SchaeferEmail author
  • Andrea Grigorescu
  • Holger Boche
  • H. Vincent Poor
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 358)

Abstract

The broadcast channel with confidential messages (BCC) models the communication scenario in which a transmitter sends simultaneously common and confidential information to two receivers. The common information must be received by both receivers while the confidential information is designated for one receiver only and must be secured against the other one. The performance of this system is usually characterized by its secrecy capacity region determining the maximum transmission rates. In this chapter, the issue of whether this secrecy capacity region depends continuously on the system parameters or not is examined. In particular, this is done for compound channels, in which the users know only that the true channel realization is constant for the whole duration of transmission and this comes from a pre-specified uncertainty set. The secrecy capacity region of the compound BCC is shown to be robust in the sense that it is a continuous function of the uncertainty set. This means that small variations in the uncertainty set result in small variations in secrecy capacity.

Notes

Acknowledgments

This work of R. F. Schaefer was supported by the German Research Foundation (DFG) under Grant WY 151/2-1. This work of A. Grigorescu was supported by the German Research Foundation (DF) under Grant BO 1734/20-1. This work of H. Boche was supported by the German Ministry of Education and Research (BMBF) under Grants 01BQ1050 and 16KIS0118. This work of H. V. Poor was supported by the U.S. National Science Foundation under Grant CMMI-1435778.

References

  1. 1.
    Ahlswede R (1978) Elimination of correlation in random codes for arbitrarily varying channels. Z Wahrscheinlichkeitstheorie verw Gebiete 44:159–175zbMATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    Alicki R, Fannes M (2004) Continuity of quantum conditional information. J Phys A: Math Gen 37(5):L55–L57zbMATHMathSciNetCrossRefGoogle Scholar
  3. 3.
    Bjelaković I, Boche H, Sommerfeld J (2013) Capacity results for arbitrarily varying wiretap channels. Information theory, combinatorics, and search theory. Springer, Berlin, pp 123–144CrossRefGoogle Scholar
  4. 4.
    Bjelaković I, Boche H, Sommerfeld J (2013) Secrecy results for compound wiretap channels. Prob Inf Trans 49(1):73–98zbMATHCrossRefGoogle Scholar
  5. 5.
    Blackwell D, Breiman L, Thomasian AJ (1959) The capacity of a class of channels. Ann Math Stat 30(4):1229–1241zbMATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    Blackwell D, Breiman L, Thomasian AJ (1960) The capacities of certain channel classes under random coding. Ann Math Stat 31(3):558–567zbMATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    Bloch M, Barros J (2011) Physical-layer security: from information theory to security engineering. Cambridge University Press, CambridgeCrossRefGoogle Scholar
  8. 8.
    Boche H, Schaefer RF (2013) Capacity results and super-activation for wiretap channels with active wiretappers. IEEE Trans Inf Forensics Secur 8(9):1482–1496CrossRefGoogle Scholar
  9. 9.
    Boche H, Schaefer RF (2014) Arbitrarily varying wiretap channels with finite coordination resources. In Proceedings of IEEE international conference on communication workshops, Sydney, Australia, pp 746–751Google Scholar
  10. 10.
    Boche H, Schaefer RF, Poor HV (2014) On the continuity of the secrecy capacity of compound and arbitrarily varying wiretap channels. IEEE Trans Inf Forensics Secur. http://arxiv.org/abs/1409.4752
  11. 11.
    Boche H, Schaefer RF, Poor HV (2015) On the continuity of the secrecy capacity of wiretap channels under channel uncertainty. In: Proceedings of IEEE international conference on communication, London, UK, June 2015Google Scholar
  12. 12.
    Boche H, Schaefer RF, Poor HV (2014) On arbitrarily varying wiretap channels for different classes of secrecy measures. In: Proceedings of IEEE international symposium on information theory, Honolulu, pp 2376–2380Google Scholar
  13. 13.
    Csiszár I (1996) Almost independence and secrecy capacity. Probl Pered Inf 32(1):48–57Google Scholar
  14. 14.
    Csiszár I, Körner J (1978) Broadcast channels with confidential messages. IEEE Trans inf theory 24(3):339–348zbMATHCrossRefGoogle Scholar
  15. 15.
    Csiszár I, Narayan P (1988) The capacity of the arbitrarily varying channel revisited: positivity, constraints. IEEE Trans Inf Theory 34(2):181–193zbMATHCrossRefGoogle Scholar
  16. 16.
    Deutsche Telekom AG Laboratories (2010) Next generation mobile networks: (r)evolution in mobile communications. Technology Radar Edition III/2010, Feature PaperGoogle Scholar
  17. 17.
    Ekrem E, Ulukus S (2010) On Gaussian MIMO compound wiretap channels. In: Proceedings of the conference on information sciences and systems, Baltimore, pp 1–6Google Scholar
  18. 18.
    Fettweis G, Boche H, Wiegand T et al (2014) The tactile internet. Technical report, ITU-T Technology Watch reports. http://www.itu.int/oth/T2301000023/en
  19. 19.
    Grigorescu A (2015) Robust biometric authentication and secure message transmission. Master’s thesis, Technische Universität München, Munich, GermanyGoogle Scholar
  20. 20.
    Grigorescu A, Boche H, Schaefer RF, Poor HV (2015) Capacity region continuity of the compound broadcast channel with confidential messages. In: Proceedings of IEEE conference on information theory workshop, Jerusalem, IsraelGoogle Scholar
  21. 21.
    Helmbrecht U, Plaga R (2008) New challenges for IT-security research in ICT. In: World federation of scientists international seminars on planetary emergencies, Erice, Italy, pp 1–6Google Scholar
  22. 22.
    Jorswieck EA, Wolf A, Gerbracht S (2010) Secrecy on the physical layer in wireless networks. Trends in Telecommunications Technologies, pp 413–435Google Scholar
  23. 23.
    Khisti A (2011) Interference alignment for the multiantenna compound wiretap channel. IEEE Trans Inf Theory 57(5):2976–2993MathSciNetCrossRefGoogle Scholar
  24. 24.
    Kobayashi M, Liang Y, Shamai (Shitz) S, Debbah M (2009) On the compound MIMO broadcast channels with confidential messages. In: Proceedings of IEEE international symposium on information theory, Seoul, Korea, pp 1283–1287Google Scholar
  25. 25.
    Leung D, Smith G (2009) Continuity of quantum channel capacities. Commun Math Phys 292(1):201–215zbMATHMathSciNetCrossRefGoogle Scholar
  26. 26.
    Liang Y, Kramer G, Poor HV, Shamai (Shitz) S (2009) Compound wiretap channels. EURASIP J Wireless Commun 142374:1–13Google Scholar
  27. 27.
    Liang Y, Poor HV, Shamai (Shitz) S (2009) Information theoretic security. Found Trends Commun Inf Theory 5(4–5):355–580Google Scholar
  28. 28.
    Liu R, Trappe W (eds) (2010) Securing wireless communications at the physical layer. Springer, BerlinGoogle Scholar
  29. 29.
    Maurer UM, Wolf S (2000) Information-theoretic key agreement: from weak to strong secrecy for free. In: EUROCRYPT 2000. Lecture Notes in Computer Science, vol 1807, Springer, Berlin, pp 351–368Google Scholar
  30. 30.
    MolavianJazi E, Bloch M, Laneman JN (2009) Arbitrary jamming can preclude secure communication. In: Proceedings of the 47th annual Allerton conference on communication, control, computing, Monticello, IL, pp 1069–1075Google Scholar
  31. 31.
    Nötzel J, Wiese M, Boche H (2015) The arbitrarily varying wiretapchannel—secret randomness, stability and super-activation. IEEE Trans Inf Theory. http://arxiv.org/abs/1501.07439
  32. 32.
    Schaefer RF, Boche H (2014a) Physical layer service integration in wireless networks—signal processing challenges. IEEE Signal Process Mag 31(3):147–156CrossRefGoogle Scholar
  33. 33.
    Schaefer RF, Boche H (2014b) Robust broadcasting of common and confidential messages over compound channels: strong secrecy and decoding performance. IEEE Trans Inf Forensics Secur 9(10):1720–1732CrossRefGoogle Scholar
  34. 34.
    Schaefer RF, Loyka S (2013) The secrecy capacity of a compound MIMO gaussian channel. In: Proceedings of IEEE conference information theory workshop, Seville, Spain, pp 104–108Google Scholar
  35. 35.
    Schaefer RF, Loyka S (2014) The compound secrecy capacity of a class of non-degraded MIMO gaussian channels. In: Proceedings of the 52nd annual allerton conference on communication, control, and computing, Monticello, pp. 1004–1010Google Scholar
  36. 36.
    Shannon CE (1949) Communication theory of secrecy systems. Bell Syst Tech J 28(4):656–715zbMATHMathSciNetCrossRefGoogle Scholar
  37. 37.
    Wiese M, Nötzel J, Boche H (2014) The arbitrarily varying wiretap channel-deterministic and correlated random coding capacities under the strong secrecy criterion. IEEE Trans Inf Theory. http://arxiv.org/abs/1410.8078
  38. 38.
    Wolfowitz J (1960) Simultaneous channels. Arch Rational Mech Anal 4(4):371–386zbMATHMathSciNetGoogle Scholar
  39. 39.
    Wyner AD (1975) The wire-tap channel. Bell Syst Tech J 54:1355–1387zbMATHMathSciNetCrossRefGoogle Scholar
  40. 40.
    Zhou X, Song L, Zhang Y (eds) (2013) Physical layer security in wireless communications. CRC Press, Boca RatonGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Rafael F. Schaefer
    • 1
    Email author
  • Andrea Grigorescu
    • 2
  • Holger Boche
    • 2
  • H. Vincent Poor
    • 1
  1. 1.Department of Electrical EngineeringPrinceton UniversityPrincetonUSA
  2. 2.Lehrstuhl für Theoretische InformationstechnikTechnische Universität MünchenMunchenGermany

Personalised recommendations