Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-76fb5796d-25wd4 Total loading time: 0 Render date: 2024-04-26T21:14:07.500Z Has data issue: false hasContentIssue false

10 - The Discrete Memoryless Arbitrarily Varying Wiretap Channel

from Part II - Secure Communication

Published online by Cambridge University Press:  28 June 2017

By
J. Nötzel ,
M. Wiese  and
H. Boche
Edited by
Rafael F. Schaefer ,
Holger Boche ,
Ashish Khisti  and
H. Vincent Poor
J. Nötzel
Affiliation:
Física Teòrica: Informació i Fenòmens Quàntics, Universitat Autònoma de Barcelona
M. Wiese
Affiliation:
ACCESS Linnaeus Center and Automatic Control Lab, School of Electrical Engineering, KTH Royal Institute of Technology
H. Boche
Affiliation:
Chair of Theoretical Information Technology, Technische Universität München
Rafael F. Schaefer
Affiliation:
Technische Universität Berlin
Holger Boche
Affiliation:
Technische Universität München
Ashish Khisti
Affiliation:
University of Toronto
H. Vincent Poor
Affiliation:
Princeton University, New Jersey
Get access

Summary

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Chapter
Information
Information Theoretic Security and Privacy of Information Systems , pp. 258 - 312
Publisher: Cambridge University Press
Print publication year: 2017

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] D., Blackwell, L., Breiman, and A. J., Thomasian, “The capacities of certain channel classes under random coding,” Ann. Math. Stat., vol. 31, no. 3, pp. 558–567, 1960.Google Scholar
[2] R., Ahlswede, “Elimination of correlation in random codes for arbitrarily varying channels,” Z. Wahrscheinlichkeitstheorie verw. Gebiete, vol. 44, pp. 159–175, 1978.Google Scholar
[3] I., Csiszár and J., Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems, 2nd edn. Cambridge: Cambridge University Press, 2011.
[4] R., Ahlswede and N., Cai, “Correlated sources help transmission over an arbitrarily varying channel,” IEEE Trans. Inf. Theory, vol. 43, no. 4, pp. 1254–1255, Jul. 1997.Google Scholar
[5] T., Ericson, “Exponential error bounds for random codes in the arbitrarily varying channel,” IEEE Trans. Inf. Theory, vol. 31, no. 1, pp. 42–48, Jan. 1985.Google Scholar
[6] I. G., Stiglitz, “Coding for a class of unknown channels,” IEEE Trans. Inf. Theory, vol. 12, no. 2, pp. 189–195, Apr. 1966.Google Scholar
[7] I., Csiszár and P., Narayan, “Capacity of the Gaussian arbitrarily varying channel,” IEEE Trans. Inf. Theory, vol. 37, no. 1, pp. 18–26, Jan. 1991.Google Scholar
[8] I., Csiszár, “Arbitrarily varying channels with general alphabets and states,” IEEE Trans. Inf. Theory, vol. 38, no. 6, pp. 1725–1742, Nov. 1992.Google Scholar
[9] R. L., Pickholtz, D. L., Schilling, and L. B., Milstein, “Theory of spread-spectrum communications – a tutorial,” IEEE Trans. Commun., vol. 30, no. 5, pp. 855–884, May 1982.Google Scholar
[10] I., Csiszár and P., Narayan, “Arbitrarily varying channels with constrained inputs and states,” IEEE Trans. Inf. Theory, vol. 34, no. 1, pp. 27–34, Jan. 1988.Google Scholar
[11] I., Csiszár and P., Narayan, “The capacity of the arbitrarily varying channel revisited: Positivity, constraints,” IEEE Trans. Inf. Theory, vol. 34, no. 2, pp. 181–193, Mar. 1988.Google Scholar
[12] D. P., Bertsekas and R., Gallager, Data Networks, 2nd edn. Upper Saddle River, NJ: Prentice-Hall International, 1992.
[13] J., Wolfowitz, “Simultaneous channels,” Arch. Rational Mech. Analysis, vol. 4, no. 4, pp. 371–386, 1960.Google Scholar
[14] J., Wolfowitz, Coding Theorems of Information Theory, 3rd edn. Berlin: Springer-Verlag, 1978.
[15] D., Blackwell, L., Breiman, and A. J., Thomasian, “The capacity of a class of channels,” Ann. Math. Stat., vol. 30, no. 4, pp. 1229–1241, Dec. 1959.Google Scholar
[16] T. M., Cover, “Broadcast channels,” IEEE Trans. Inf. Theory, vol. 18, no. 1, pp. 2–14, Jan. 1972.Google Scholar
[17] A., Lapidoth and I. E., Telatar, “The compound channel capacity of a class of finite-state channels,” IEEE Trans. Inf. Theory, vol. 44, no. 3, pp. 396–400, May 1998.Google Scholar
[18] I., Csiszár and P., Narayan, “Capacity and decoding rules for classes of arbitrarily varying channels,” IEEE Trans. Inf. Theory, vol. 35, no. 4, pp. 752–769, Jul. 1989.Google Scholar
[19] J., Kiefer and J., Wolfowitz, “Channels with arbitrarily varying channel probability functions,” Inform. Contr., vol. 5, pp. 44–54, Mar. 1962.Google Scholar
[20] R., Ahlswede, “A note on the existence of the weak capacity for channels with arbitrarily varying channel probability functions and its relation to Shannon's zero error capacity,” Ann. Math. Stat., vol. 41, no. 3, pp. 1027–1033, 1970.Google Scholar
[21] R., Ahlswede and J., Wolfowitz, “The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet,” Z. Wahrscheinlichkeitstheorie verw. Gebiete, vol. 15, pp. 186–194, 1970.Google Scholar
[22] C. E., Shannon, “The zero error capacity of a noisy channel,” IRE Trans. Inf. Theory, vol. 2, no. 3, pp. 8–19, Sep. 1956.Google Scholar
[23] W., Haemers, “On some problems of Lovász concerning the Shannon capacity of a graph,” IEEE Trans. Inf. Theory, vol. 25, no. 2, pp. 231–232, Mar. 1979.Google Scholar
[24] W., Haemers, “An upper bound for the Shannon capacity of a graph,” Algebraic Methods in Graph Theory, pp. 267–272, 1978.
[25] N., Alon, “The Shannon capacity of a union,” Combinatorica, vol. 18, no. 3, pp. 301–310, Mar. 1998.Google Scholar
[26] L., Lovász, “On the Shannon capacity of a graph,” IEEE Trans. Inf. Theory, vol. 25, no. 1, pp. 1–7, Jan. 1979.Google Scholar
[27] F., Guo and Y., Watanabe, “On graphs in which the Shannon capacity is unachievable by finite product,” IEEE Trans. Inf. Theory, vol. 36, no. 3, pp. 622–623, May 1990.Google Scholar
[28] U. M., Maurer, “Secret key agreement by public discussion from common information,” IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 733–742, May 1993.Google Scholar
[29] M., Wiese, “Multiple access channels with cooperating encoders,” Ph.D. dissertation, Technische Universität München, Munich, Germany, 2013.
[30] H., Boche and R. F., Schaefer, “Capacity results and super-activation for wiretap channels with active wiretappers,” IEEE Trans. Inf. Forensics Security, vol. 8, no. 9, pp. 1482–1496, Sep. 2013.Google Scholar
[31] C. E., Shannon, “Communication theory of secrecy systems,” Bell Syst. Tech. J., vol. 28, no. 4, pp. 656–715, Oct. 1949.Google Scholar
[32] A. D., Wyner, “The wire-tap channel,” Bell Syst. Tech. J., vol. 54, pp. 1355–1387, Oct. 1975.Google Scholar
[33] M. R., Bloch and J. N., Laneman, “On the secrecy capacity of arbitrary wiretap channels,” in Proc. 46th Annual Allerton Conf. Commun., Control, Computing, Monticello, IL, USA, Sep. 2008, pp. 818–825.
[34] M., Bloch and J., Barros, Physical-Layer Security: From Information Theory to Security Engineering. Cambridge: Cambridge University Press, 2011.
[35] M., Wiese, J., Nötzel, and H., Boche, “The arbitrarily varying wiretap channel – communication under uncoordinated attacks,” in Proc. IEEE Int. Symp. Inf. Theory, Hong Kong, Jun. 2015, pp. 2146–2150.
[36] I., Csiszár and J., Körner, “Broadcast channels with confidential messages,” IEEE Trans. Inf. Theory, vol. 24, no. 3, pp. 339–348, May 1978.Google Scholar
[37] W., Kang and N., Liu, “Wiretap channel with shared key,” in Proc. IEEE Inf. Theory Workshop, Dublin, Ireland, Aug. 2010, pp. 1–5.
[38] H., Yamamoto, “Rate–distortion theory for the Shannon cipher system,” IEEE Trans. Inf. Theory, vol. 43, no. 3, pp. 827–835, May 1997.Google Scholar
[39] N., Merhav, “Shannon's secrecy system with informed receivers and its application to systematic coding for wiretapped channels,” IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2723–2734, Jun. 2008.Google Scholar
[40] R., Liu and W., Trappe, eds., Securing Wireless Communications at the Physical Layer. Boston, MA: Springer US, 2010.
[41] X., Zhou, L., Song, and Y., Zhang, eds., Physical Layer Security in Wireless Communications. London: CRC Press, 2013.
[42] Y., Liang, H. V., Poor, and S., Shamai (Shitz), “Information theoretic security,” Found. Trends Commun. Inf. Theory, vol. 5, no. 4–5, pp. 355–580, 2009.
[43] N., Sklavos and X., Zhang, Wireless Security and Cryptography: Specifications and Implementations. London: CRC Press, 2007.
[44] D., Welch and S., Lathrop, “Wireless security threat taxonomy,” in Proc. IEEE Systems, Man and Cybernetics Society Information AssuranceWorkshop,West Point, NY, USA, Jun. 2003, pp. 76–83.
[45] G., Fettweis et al., “The tactile internet,” ITU-T Tech. Watch Rep., Tech. Rep., Aug. 2014.
[46] D. N. C., Tse and P., Viswanath, Fundamentals of Wireless Communication. Cambridge: Cambridge University Press, 2005.
[47] S., Goel and R., Negi, “Secret communication in presence of colluding eavesdroppers,” in Proc. IEEE Military Commun. Conf., Atlantic City, NJ, USA, 2005, pp. 1501–1506, Vol. 3.
[48] S., Goel and R., Negi, “Guaranteeing secrecy using artificial noise,” IEEE Trans. Wireless Commun., vol. 7, no. 6, pp. 2180–2189, Jun. 2008.Google Scholar
[49] X., Li, J., Hwu, and E., Ratazzi, “Array redundancy and diversity for wireless transmissions with low probability of interception,” in Proc. IEEE Int. Conf. Acoustics, Speech, Signal Process., vol. 4, 2006.Google Scholar
[50] X., Li, J., Hwu, and E., Ratazzi, “Using antenna array redundancy and channel diversity for secure wireless transmissions,” J. Commun., vol. 2, no. 3, pp. 24–32, May 2007.Google Scholar
[51] A., Khisti and G.W., Wornell, “Secure transmission with multiple antennas I: The MISOME wiretap channel,” IEEE Trans. Inf. Theory, vol. 56, no. 7, pp. 3088–3104, Jul. 2010.Google Scholar
[52] S., Shafiee, N., Liu, and S., Ulukus, “Towards the secrecy capacity of the Gaussian MIMO wire-tap channel: The 2-2-1 channel,” IEEE Trans. Inf. Theory, vol. 55, no. 9, pp. 4033–4039, Sep. 2009.Google Scholar
[53] F., Oggier and B., Hassibi, “The secrecy capacity of the MIMO wiretap channel,” IEEE Trans. Inf. Theory, vol. 57, no. 8, pp. 4961–4972, Aug. 2011.Google Scholar
[54] T. T., Kim and H. V., Poor, “Secure communications with insecure feedback: Breaking the high-SNR ceiling,” IEEE Trans. Inf. Theory, vol. 56, no. 8, pp. 3700–3711, Aug. 2010.Google Scholar
[55] X., He, A., Khisti, and A., Yener, “MIMO multiple access channel with an arbitrarily varying eavesdropper: Secrecy degrees of freedom,” IEEE Trans. Inf. Theory, vol. 59, no. 8, pp. 4733–4745, Aug. 2013.Google Scholar
[56] X., He and A., Yener, “MIMO wiretap channels with unknown and varying eavesdropper channel states,” IEEE Trans. Inf. Theory, vol. 60, no. 11, pp. 6844–6869, Nov. 2014.Google Scholar
[57] Y., Liang, G., Kramer, H. V., Poor, and S., Shamai (Shitz), “Compound wiretap channels,” in Proc. 45th Annual Allerton Conf. Commun., Control, Computing, Monticello, IL, USA, 2007.
[58] Y., Liang, G., Kramer, H. V., Poor, and S., Shamai (Shitz), “Compound wiretap channels,” EURASIP J. Wireless Commun. Netw., article ID 142374, pp. 1–13, 2009.Google Scholar
[59] I., Bjelaković, H., Boche, and J., Sommerfeld, “Secrecy results for compound wiretap channels,” Probl. Inf. Transmission, vol. 49, no. 1, pp. 73–98, Mar. 2013.Google Scholar
[60] I., Bjelaković, H., Boche, and J., Sommerfeld, Information Theory, Combinatorics, and Search Theory, ser. Lecture Notes in Computer Science, vol. 7777, pp. 123–144. Berlin, Heidelberg: Springer, 2013.
[61] E., MolavianJazi, “Secure communications over arbitrarily varying wiretap channels,” Master's thesis, Graduate School, Notre Dame, Indiana, Dec. 2009.
[62] E., MolavianJazi, M., Bloch, and J. N., Laneman, “Arbitrary jamming can preclude secure communication,” in Proc. 47th Annual Allerton Conf. Commun., Control, Computing, Monticello, IL, USA, Sep. 2009, pp. 1069–1075.
[63] M., Wiese and H., Boche, Information Theory, Combinatorics, and Search Theory, ser. Lecture Notes in Computer Science, vol. 7777, pp. 71–122. Berlin, Heidelberg: Springer, 2013.
[64] M., Wiese, J., Nötzel, and H., Boche, “A channel under simultaneous jamming and eavesdropping attack – correlated random coding capacities under strong secrecy criteria,” IEEE Trans. Inf. Theory, vol. 62, no. 7, pp. 3844–3862, Jul. 2016.Google Scholar
[65] J., Nötzel, M., Wiese, and H., Boche, “The arbitrarily varying wiretap channel – secret randomness, stability and super-activation,” IEEE Trans. Inf. Theory, vol. 62, no. 6, pp. 3504–3531, Jun. 2016.Google Scholar
[66] J., Körner and K., Marton, “Comparison of two noisy channels,” in Colloquia Mathematica Societatis, Jańos Bolyai, 16, Topics in Info. Th., North Holland, 1977, pp. 411–424.
[67] G., Smith and J., Yard, “Quantum communication with zero-capacity channels,” Science, vol. 321, pp. 1812–1815, 2008.Google Scholar
[68] H., Boche and J., Nötzel, “Positivity, discontinuity, finite resources and nonzero error for arbitrarily varying quantum channels,” J. Mathematical Physics, vol. 55, p. 122201, 2014.
[69] H., Boche, R. F., Schaefer, and H. V., Poor, “On the continuity of the secrecy capacity of compound and arbitrarily varying wiretap channels,” IEEE Trans. Inf. Forensics Security, vol. 12, no. 10, pp. 2531–2546, Dec. 2015.Google Scholar
[70] H., Boche and R. F., Schaefer, “Arbitrarily varying wiretap channels with finite coordination resources,” in Proc. IEEE Int. Conf. Commun. Workshops, Sydney, Australia, Jun. 2014, pp. 746–751.
[71] D. P., Dubhasi and A., Panconesi, Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge: Cambridge University Press, 2009.
[72] R., Ahlswede and A., Winter, “Strong converse for identification via quantum channels,” IEEE Trans. Inf. Theory, vol. 48, no. 3, pp. 569–579, Mar. 2002.Google Scholar
[73] R., Ahlswede, “Coloring hypergraphs: A new approach to multi-user source coding II,” J. Comb. Inform. Syst. Sci., vol. 5, no. 3, pp. 220–268, 1980.Google Scholar
[74] R., Ahlswede, “Arbitrarily varying channels with states sequence known to the sender,” IEEE Trans. Inf. Theory, vol. 32, no. 5, pp. 621–629, Sep. 1986.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • The Discrete Memoryless Arbitrarily Varying Wiretap Channel
    • By J. Nötzel, Física Teòrica: Informació i Fenòmens Quàntics, Universitat Autònoma de Barcelona, M. Wiese, ACCESS Linnaeus Center and Automatic Control Lab, School of Electrical Engineering, KTH Royal Institute of Technology, H. Boche, Chair of Theoretical Information Technology, Technische Universität München
  • Edited by Rafael F. Schaefer, Technische Universität Berlin, Holger Boche, Technische Universität München, Ashish Khisti, University of Toronto, H. Vincent Poor, Princeton University, New Jersey
  • Book: Information Theoretic Security and Privacy of Information Systems
  • Online publication: 28 June 2017
  • Chapter DOI: https://doi.org/10.1017/9781316450840.011
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • The Discrete Memoryless Arbitrarily Varying Wiretap Channel
    • By J. Nötzel, Física Teòrica: Informació i Fenòmens Quàntics, Universitat Autònoma de Barcelona, M. Wiese, ACCESS Linnaeus Center and Automatic Control Lab, School of Electrical Engineering, KTH Royal Institute of Technology, H. Boche, Chair of Theoretical Information Technology, Technische Universität München
  • Edited by Rafael F. Schaefer, Technische Universität Berlin, Holger Boche, Technische Universität München, Ashish Khisti, University of Toronto, H. Vincent Poor, Princeton University, New Jersey
  • Book: Information Theoretic Security and Privacy of Information Systems
  • Online publication: 28 June 2017
  • Chapter DOI: https://doi.org/10.1017/9781316450840.011
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • The Discrete Memoryless Arbitrarily Varying Wiretap Channel
    • By J. Nötzel, Física Teòrica: Informació i Fenòmens Quàntics, Universitat Autònoma de Barcelona, M. Wiese, ACCESS Linnaeus Center and Automatic Control Lab, School of Electrical Engineering, KTH Royal Institute of Technology, H. Boche, Chair of Theoretical Information Technology, Technische Universität München
  • Edited by Rafael F. Schaefer, Technische Universität Berlin, Holger Boche, Technische Universität München, Ashish Khisti, University of Toronto, H. Vincent Poor, Princeton University, New Jersey
  • Book: Information Theoretic Security and Privacy of Information Systems
  • Online publication: 28 June 2017
  • Chapter DOI: https://doi.org/10.1017/9781316450840.011
Available formats
×