Skip to main content Accessibility help
×
Home
  • Print publication year: 2017
  • Online publication date: June 2017

10 - The Discrete Memoryless Arbitrarily Varying Wiretap Channel

from Part II - Secure Communication
[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.
[2] R., Ahlswede, “Elimination of correlation in random codes for arbitrarily varying channels,” Z. Wahrscheinlichkeitstheorie verw. Gebiete, vol. 44, pp. 159–175, 1978.
[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.
[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.
[6] I. G., Stiglitz, “Coding for a class of unknown channels,” IEEE Trans. Inf. Theory, vol. 12, no. 2, pp. 189–195, Apr. 1966.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[16] T. M., Cover, “Broadcast channels,” IEEE Trans. Inf. Theory, vol. 18, no. 1, pp. 2–14, Jan. 1972.
[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.
[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.
[19] J., Kiefer and J., Wolfowitz, “Channels with arbitrarily varying channel probability functions,” Inform. Contr., vol. 5, pp. 44–54, Mar. 1962.
[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.
[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.
[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.
[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.
[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.
[26] L., Lovász, “On the Shannon capacity of a graph,” IEEE Trans. Inf. Theory, vol. 25, no. 1, pp. 1–7, Jan. 1979.
[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.
[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.
[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.
[31] C. E., Shannon, “Communication theory of secrecy systems,” Bell Syst. Tech. J., vol. 28, no. 4, pp. 656–715, Oct. 1949.
[32] A. D., Wyner, “The wire-tap channel,” Bell Syst. Tech. J., vol. 54, pp. 1355–1387, Oct. 1975.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[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.