References
Published online by Cambridge University Press: 07 October 2011
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.
- Type
- Chapter
- Information
- Physical-Layer SecurityFrom Information Theory to Security Engineering, pp. 311 - 322Publisher: Cambridge University PressPrint publication year: 2011
References
[1] , “Communication theory of secrecy systems,” Bell System Technical Journal, vol. 28, no. 4, pp. 656–715, April 1949.Google Scholar
[5] and , Information Theory: Coding Theorems for Discrete Memoryless Systems. Akadémiai Kiadó, 1981.Google Scholar
[7] , “A mathematical theory of communication,” Bell System Technical Journal, vol. 27, nos. 7/10, pp. 379–423/623–656, July/October 1948.Google Scholar
[8] , “Capacity results for the discrete memoryless networks,” IEEE Transactions on Information Theory, vol. 49, no. 1, pp. 4–21, January 2003.Google Scholar
[9] and , “Noiseless coding of correlated information sources,” IEEE Transactions on Information Theory, vol. 19, no. 4, pp. 471–480, July 1973.Google Scholar
[10] , “Writing on dirty paper,” IEEE Transactions on Information Theory, vol. 29, no. 3, pp. 439–441, May 1983.Google Scholar
[11] and , “The rate-distortion function for source coding with side information at the decoder,” IEEE Transactions on Information Theory, vol. 22, no. 1, pp. 1–10, January 1976.Google Scholar
[12] , “Multi-way communication channels,” in Proc. International Symposium on Information Theory, Thakadsor, Armenian SSR, USSR, September 1971, pp. 23–52.Google Scholar
[13] , “Multiple access channels,” Ph.D. dissertation, University of Hawaii, 1972.
[14] , “Broadcast channels,” IEEE Transactions on Information Theory, vol. 18, no. 1, pp. 2–14, January 1972.Google Scholar
[15] , “Random coding theorem for broadcast channels with degraded components,” IEEE Transactions on Information Theory, vol. 19, no. 2, pp. 197–207, March 1973.Google Scholar
[16] , “Capacity and coding for degraded broadcast channels,” Problemy Peredachi Informatsii, vol. 10, no. 3, pp. 3–14, 1974.Google Scholar
[17] , “Comments on broadcast channels,” IEEE Transactions on Information Theory, vol. 44, no. 6, pp. 2524–2530, October 1998.Google Scholar
[18] and , “Broadcast channels with confidential messages,” IEEE Transactions on Information Theory, vol. 24, no. 3, pp. 339–348, May 1978.Google Scholar
[19] , “Cipher printing telegraph systems for secret wire and radio telegraphic communications,” Transactions of the American Institute of Electrical Engineers, vol. 45, no. 1, pp. 295–301, January 1926.Google Scholar
[20] , “On the role of MMSE estimation in approaching the information-theoretic limits of linear Gaussian channels: Shannon meets Wiener,” in Proc. 41st Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA, October 2003, pp. 430–439.Google Scholar
[21] , “The wire-tap channel,” Bell System Technical Journal, vol. 54, no. 8, pp. 1355–1367, October 1975.Google Scholar
[22] , “On a special class of wiretap channels,” IEEE Transactions on Information Theory, vol. 23, no. 5, pp. 625–627, September 1977.Google Scholar
[23] , “A simplified treatment of Wyner's wire-tap channels,” in Proc. 21st Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA, October 1983, pp. 268–276.Google Scholar
[24] , “Almost independence and secrecy capacity,” Problemy Peredachi Informatsii, vol. 32, no. 1, pp. 40–47, January–March 1996.Google Scholar
[25] , “General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channels,” IEEE Transactions on Information Theory, vol. 52, no. 4, pp. 1562–1575, April 2006.Google Scholar
[26] and , “On the secrecy capacity of arbitrary wiretap channels,” in Proc. 46th Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA, September 2008, pp. 818–825.Google Scholar
[27] , , and , “Secure bits through queues,” in Proc. IEEE Information Theory Workshop on Networking and Information Theory, Volos, Greece, June 2009, pp. 37–41.Google Scholar
[28] and , “Comparison of two noisy channels,” in Proc. Topics in Information Theory, Keszthely, Hungary, 1977, pp. 411–423.Google Scholar
[29] , “On a special class of broadcast channels with confidential messages,” IEEE Transactions on Information Theory, vol. 43, no. 2, pp. 712–714, March 1997.Google Scholar
[30] , “Capacity regions of two new classes of 2-receiver broadcast channels,” in Proc. IEEE International Symposium on Information Theory, Seoul, South Korea, July 2009, pp. 1839–1843.Google Scholar
[31] , “Rate-distortion theory for the Shannon cipher systems,” IEEE Transactions on Information Theory, vol. 43, no. 3, pp. 827–835, May 1997.Google Scholar
[32] , “Multi-user and wiretap channels including feedback,” Ph.D. dissertation, Stanford University, 1976.
[33] and , “Transmission, identification and common randomness capacities for wire-tap channels with secure feedback from the decoder,” in General Theory of Information Transfer and Combinatorics. Springer-Verlag, 2006, pp. 258–275.Google Scholar
[34] , , , and , “Wiretap channel with secure rate-limited feedback,” IEEE Transactions on Information Theory, vol. 55, no. 12, pp. 5353–5361, December 2009.Google Scholar
[35] and , “Relations between entropy and error probability,” IEEE Transactions on Information Theory, vol. 40, no. 1, pp. 259–266, January 1994.Google Scholar
[36] , , and , “An algorithm for computing the secrecy capacity of broadcast channels with confidential messages,” in Proc. IEEE International Symposium on Information Theory, Nice, France, July 2007, pp. 936–940.Google Scholar
[37] and , “Computation of secrecy capacity for more-capable channel pairs,” in Proc. IEEE International Symposium on Information Theory, Toronto, Canada, July 2008, pp. 529–533.Google Scholar
[38] , Quantum Cryptography and Secret-Key Distillation. Cambridge University Press, 2006.Google Scholar
[39] and , Quantum Computation and Quantum Information. Cambridge University Press, 2000.Google Scholar
[40] , , , and , “Quantum cryptography,” Reviews of Modern Physics, vol. 74, no. 1, pp. 145–195, January 2002.Google Scholar
[41] , , and , “Unbreakable keys from random noise,” in Security with Noisy Data, , , and , Eds. Springer-Verlag, 2007, pp. 21–44.Google Scholar
[42] , “Secret key agreement by public discussion from common information,” IEEE Transactions on Information Theory, vol. 39, no. 3, pp. 733–742, May 1993.Google Scholar
[43] and , “Common randomness in information theory and cryptography. I. Secret sharing,” IEEE Transactions on Information Theory, vol. 39, no. 4, pp. 1121–1132, July 1993.Google Scholar
[44] and , “Information-theoretic key agreement of multiple terminals – part I,” IEEE Transactions on Information Theory, vol. 56, no. 8, pp. 3973–3996, August 2010.Google Scholar
[45] and , “Information-theoretic key agreement of multiple terminals – part II: Channel models,” IEEE Transactions on Information Theory, vol. 56, no. 8, pp. 3997–4010, August 2010.Google Scholar
[46] and , “Unconditionally secure key agreement and intrinsic conditional information,” IEEE Transactions on Information Theory, vol. 45, no. 2, pp. 499–514, March 1999.Google Scholar
[47] and , “New bounds in secret-key agreement: The gap between formation and secrecy extraction,” in Proc. EUROCRYPT, 2003, pp. 652–577.
[48] and , “Common randomness and secret key generation with a helper,” IEEE Transactions on Information Theory, vol. 46, no. 2, pp. 344–366, March 2000.Google Scholar
[49] , , and , “Secret-key generation with correlated sources and noisy channels,” in Proc. IEEE International Symposium on Information Theory, Toronto, Canada, July 2008, pp. 1005–1009.Google Scholar
[50] and , “A separation result for secure communication,” in Proc. 45th Allerton Conference on Communications, Control and Computing, Monticello, IL, USA, September 2007, pp. 34–41.Google Scholar
[51] and , “Secret key agreement from vector Gaussian sources by rate limited public communications,” in Proc. IEEE International Symposium on Information Theory, Austin, TX, USA, June 2010, pp. 2597–2601; see also arXiv:1001.3705v1.Google Scholar
[52] and , “On the secret-key rate of binary random variables,” in Proc. IEEE International Symposium on Information Theory, Trondheim, Norway, June 1994, p. 351.Google Scholar
[53] , , and , “A practical protocol for advantage distillation and information reconciliation,” Designs, Codes and Cryptography, vol. 30, no. 1, pp. 39–62, August 2003.Google Scholar
[54] , , , and , “Secret key agreement by reliability information of signals in Gaussian Maurer's models,” in Proc. IEEE International Symposium on Information Theory, Toronto, Canada, July 2008, pp. 727–731.Google Scholar
[55] , , and , “Secret key capacity and advantage distillation capacity,” in Proc. IEEE International Symposium on Information Theory, Seattle, WA, USA, July 2006, pp. 2598–2602.Google Scholar
[56] and , “Secret-key reconciliation by public discussion,” in Proc. Advances in Cryptology – Eurocrypt, , Ed. Springer-Verlag, May 1993, pp. 411–423.Google Scholar
[57] , , , , , and , “Fast, efficient error reconciliation for quantum cryptography,” Physical Review A, vol. 67, no. 5, pp. 052 303/1–8, May 2003.Google Scholar
[58] , , , and , “Efficient reconciliation protocol for discrete-variable quantum key distribution,” in Proc. IEEE International Symposium on Information Theory, Seoul, South Korea, July 2009, pp. 1879–1883.Google Scholar
[59] , , and , “Reconciliation of a quantum-distributed Gaussian key,” IEEE Transactions on Information Theory, vol. 50, no. 2, pp. 394–400, February 2004.Google Scholar
[60] , , and , “Side-information coding with turbo codes and its application to quantum key distribution,” in Proc. International Symposium on Information Theory and its Applications, Parma, Italy, October 2004, pp. 1274–1279.Google Scholar
[61] , , , and , “LDPC-based Gaussian key reconciliation,” in Proc. IEEE Information Theory Workshop, Punta del Este, Uruguay, March 2006, pp. 116–120; extended report available at arXiv:cs.IT/0509041.Google Scholar
[62] , , and , “Extracting secrecy from jointly Gaussian random variables,” in Proc. IEEE International Symposium on Information Theory, Seattle, WA, USA, July 2006, pp. 2593–2597.Google Scholar
[63] , “On measures of entropy and information,” in Proc. Fourth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, Berkeley, CA, USA, 1961, pp. 547–561.Google Scholar
[64] , , C. Crépeau, and , “Generalized privacy amplification,” IEEE Transactions on Information Theory, vol. 41, no. 6, pp. 1915–1923, November 1995.Google Scholar
[65] and , “Universal classes of hash functions,” Journal of Computer and System Sciences, vol. 18, no. 2, pp. 143–154, April 1979.Google Scholar
[66] and , “New hash functions and their use in authentication and set equality,” Journal of Computer Sciences and Systems, vol. 22, no. 3, pp. 265–279, June 1981.Google Scholar
[67] , “Universal hashing and authentication codes,” Designs, Codes and Cryptography, vol. 4, no. 4, pp. 369–380, October 1994.Google Scholar
[68] and , “Information-theoretic key agreement: From weak to strong secrecy for free,” in Advances in Cryptology – Eurocrypt 2000, , Ed. Springer-Verlag, 2000, p. 351.Google Scholar
[69] , “Extracting all the randomness from a weakly random source,” Massachusetts Institute of Technology, Cambridge, MA, USA, Technical Report, 1998.Google Scholar
[70] , “Entropy measures and unconditional security in cryptography.” Ph.D. dissertation, ETH Zürich, Zurich, Switzerland, 1997.
[71] and , “Linking information reconciliation and privacy amplification,” Journal of Cryptology, vol. 10, no. 2, pp. 97–110, March 1997.Google Scholar
[72] , “Secret key agreement from correlated source outputs using low density parity check matrices,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E89-A, no. 7, pp. 2036–2046, July 2006.Google Scholar
[73] , “Secret key generation for correlated Gaussian sources,” in Proc. 45th Allerton Conference on Communications, Control and Computing, Monticello, IL, USA, September 2007, pp. 1054–1058.Google Scholar
[74] and , “Secret-key agreement over unauthenticated public channels – part I. Definitions and a completeness result,” IEEE Transactions on Information Theory, vol. 49, no. 4, pp. 822–831, April 2003.Google Scholar
[75] and , “Secret-key agreement over unauthenticated public channels – part II. The simulatability condition,” IEEE Transactions on Information Theory, vol. 49, no. 4, pp. 832–838, April 2003.Google Scholar
[76] and , “Secret-key agreement over unauthenticated public channels – part III. Privacy amplification,” IEEE Transactions on Information Theory, vol. 49, no. 4, pp. 839–851, April 2003.Google Scholar
[77] , , and , “On the possibility of key agreement using variable directional antenna,” in Proc. 1st Joint Workshop on Information Security, Seoul, South Korea, September 2006, pp. 153–167.Google Scholar
[78] , , , , , and , “Information-theoretically secret key generation for fading wireless channels,” IEEE Transactions on Information Forensics and Security, vol. 5, no. 2, pp. 240–254, June 2010.Google Scholar
[79] and , “Secret key establishment using temporally and spatially correlated wireless channel coefficients,” IEEE Transactions on Mobile Computing, vol. 10, no. 2, pp. 205–215, February 2011.Google Scholar
[80] , , , , , and , “Quantum key distribution using Gaussian-modulated coherent states,” Letters to Nature, vol. 421, no. 6920, pp. 238–241, January 2003.Google Scholar
[81] , , , , , , , , , , and , “Quantum key distribution over 25 km with an all-fiber continuous-variable system,” Physical Review A, vol. 76, pp. 042 305/1–10, October 2007.Google Scholar
[82] and , “Noisy cryptographic protocols for low-cost RFID tags,” IEEE Transactions on Information Theory, vol. 52, no. 8, pp. 3562–3566, August 2006.Google Scholar
[83] and , “The MIMOME channel,” in Proc. 45th Allerton Conference on Communication, Control and Computing, Monticello, IL, USA, September 2007, pp. 625–632; available online: http://allegro.mit.edu/pubs/posted/journal/2008-khistiwornell-it.pdf.Google Scholar
[84] and , “Secure transmission with multiple antennas – II: The MIMOME wiretap channels,” IEEE Transactions on Information Theory, vol. 56, no. 11, pp. 5515–5532, November 2010.Google Scholar
[85] , , and (Shitz), “Secure communication over fading channels,” IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2470–2492, June 2008.Google Scholar
[86] , , and , “On the secrecy capacity of fading channels,” IEEE Transactions on Information Theory, vol. 54, no. 10, pp. 4687–4698, October 2008.Google Scholar
[87] and , “The Gaussian wire-tap channels,” IEEE Transactions on Information Theory, vol. 24, no. 4, pp. 451–456, July 1978.Google Scholar
[88] , , , and , “An MMSE approach to the secrecy capacity of the MIMO Gaussian wiretap channels,” EURASIP Journal on Wireless Communications and Networking, vol. 2009, pp. 370 970/1–8, 2009.Google Scholar
[89] and , “The secrecy capacity of the MIMO wiretap channels,” in Proc. IEEE International Symposium on Information Theory, Toronto, Canada, July 2008, pp. 524–528.Google Scholar
[90] and , “A note on the secrecy capacity of the multiple-antenna wiretap channel,” IEEE Transactions on Information Theory, vol. 55, no. 6, pp. 2547–2553, June 2009.Google Scholar
[91] , , and , “Towards the secrecy capacity of the Gaussian MIMO wire-tap channel: The 2–2–1 channels,” IEEE Transactions on Information Theory, vol. 55, no. 9, pp. 4033–4039, September 2009.Google Scholar
[92] , “Secure communication in the low-SNR regime: A characterization of the energy–secrecy tradeoff,” in Proc. IEEE International Symposium on Information Theory, Seoul, South Korea, July 2009, pp. 2291–2295.Google Scholar
[93] and , “Secret communication using artificial noise,” in 62nd Vehicular Technology Conference (VTC), vol. 3, Dallas, TX, USA, September 2005, pp. 1906–1910.Google Scholar
[94] and , “Guaranteeing secrecy using artificial noise,” IEEE Transactions on Wireless Communications, vol. 7, no. 6, pp. 2180–2189, June 2008.Google Scholar
[95] , , , and , “On the Gaussian MIMO wiretap channels,” in Proc. IEEE International Symposium on Information Theory, Nice, France, July 2007, pp. 2471–2475.Google Scholar
[96] and , “Secrecy capacity of wireless channels,” in Proc. IEEE International Symposium on Information Theory, Seattle, WA, USA, July 2006, pp. 356–360.Google Scholar
[97] , R.Yates, and , “Secret communication with a fading eavesdropper channel,” in Proc. IEEE International Symposium on Information Theory, Nice, France, June 2007, pp. 1296–1300.Google Scholar
[98] , , , , and , “Secrecy capacity over correlated ergodic fading channels,” in Proc. IEEE Military Communications Conference, San Diego, CA, USA, November 2008, pp. 1–7.Google Scholar
[99] , , , and , “On the secure degrees of freedom in the k-user Gaussian interference channels,” in Proc. IEEE International Symposium on Information Theory, Toronto, Canada, July 2008, pp. 384–388.Google Scholar
[100] , , and , “Secured communication over frequency-selective fading channels: A practical Vandermonde precoding,” EURASIP Journal on Wireless Communications and Networking, vol. 2009, pp. 386 547/1–19, 2009.Google Scholar
[101] and , “Information-spectrum methods for information-theoretic security,” in Proc. Information Theory and Applications Workshop, San Diego, CA, USA, February 2009, pp. 23–28.Google Scholar
[102] , , , and , “On the throughput of secure hybrid-ARQ protocols for Gaussian block-fading channels,” IEEE Transactions on Information Theory, vol. 55, no. 4, pp. 1575–1591, April 2009.Google Scholar
[103] , , , and , “Secret-key sharing based on layered broadcast coding over fading channels,” in Proc. IEEE International Symposium on Information Theory, Seoul, South Korea, July 2009, pp. 2762–2766.Google Scholar
[104] , , , and , “The broadcast approach over fading Gaussian wiretap channels,” in Proc. Information Theory Workshop, Taormina, Italy, October 2009, pp. 1–5.Google Scholar
[105] , , , and , “Wireless information-theoretic security,” IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2515–2534, June 2008.Google Scholar
[106] , , and , “Secret sharing over fast-fading MIMO wiretap channels,” EURASIP Journal on Wireless Communications and Networking, vol. 2009, pp. 506 973/1–17, 2009.Google Scholar
[107] , , and , “Channel identification: Secret sharing using reciprocity in ultrawideband channels,” IEEE Transactions on Information Forensics and Security, vol. 2, no. 3, pp. 364–375, September 2007.Google Scholar
[109] and , “Block error iterative decoding capacity for LDPC codes,” in Proc. International Symposium on Information Theory, Adelaide, Australia, 2005, pp. 52–56.Google Scholar
[110] , “Lowdensity parity check codes,” Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MA, USA, 1963.
[111] and , “The capacity of low-density parity-check codes under message-passing decoding,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 599–618, February 2001.Google Scholar
[112] , , and , “Analysis of sum–product decoding of low-density parity-check codes using a Gaussian approximation,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 657–670, February 2001.Google Scholar
[113] , , , and , “On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit,” IEEE Communications Letters, vol. 5, no. 2, pp. 58–60, February 2001.Google Scholar
[114] , , and , “Design of capacity-approaching irregular low-density parity-check codes,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 619–637, February 2001.Google Scholar
[115] and , “Design of efficient erasure codes with differential evolution,” in Proc. IEEE International Symposium on Information Theory, Sorrento, Italy, June 2000.Google Scholar
[116] and , “Wire tap channel II,” AT&T Bell Laboratories Technical Journal, vol. 63, no. 10, pp. 2135–2157, December 1984.Google Scholar
[117] , , , , and , “Applications of LDPC codes to the wiretap channels,” IEEE Transactions on Information Theory, vol. 53, no. 8, pp. 2933–2945, August 2007.Google Scholar
[118] , , , , and , “Strong secrecy for erasure wiretap channels,” in Proc. IEEE Information Theory Workshop, Dublin, Ireland, 2010, pp. 1–5.Google Scholar
[119] , , , and , “Strong secrecy on the binary erasure wiretap channel using large-girth LDPC codes,” submitted to IEEE Transactions on Information Forensics and Security, September 2010. Available online: arXiv:1009.3130.
[120] , , , , and , “Two edge type LDPC codes for the wiretap channels,” in Proc. 43rd Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, USA, November 2009, pp. 834–838.Google Scholar
[121] and , “Syndrome-coding for the wiretap channel revisited,” in Proc. IEEE Information Theory Workshop, Chengdu, China, October 2006, pp. 33–36.Google Scholar
[122] , , , and , “Secure nested codes for type II wiretap channels,” in Proc. IEEE Information Theory Workshop, Lake Tahoe, CA, USA, September 2007, pp. 337–342.Google Scholar
[123] and , “Convolutional encoding for Wyner's wiretap channels,” IEEE Transactions on Information Theory, vol. 25, no. 2, pp. 234–236, March 1979.Google Scholar
[124] , “Generalized Hamming weights for linear codes,” IEEE Transactions on Information Theory, vol. 37, no. 5, pp. 1412–1418, September 1991.Google Scholar
[125] and , “Achieving the secrecy capacity of wiretap channels using polar codes,” in Proc. IEEE International Symposium on Information Theory, Austin, TX, USA, June 2010, pp. 913–917. Available online: arXiv:1001.0210v1.Google Scholar
[126] , , , , and , “Nested polar codes for wiretap and relay channels,” IEEE Communications Letters, vol. 14, no. 4, pp. 752–754, June 2010.Google Scholar
[127] and , “Polar coding for secure transmission and key agreement,” in Proc. IEEE International Symposium on Personal Indoor and Mobile Radio Communications, Istanbul, Turkey, 2010, pp. 2698–2703.Google Scholar
[128] and , “Secrecy-achieving polar-coding for binary-input memoryless symmetric wire-tap channels,” in Proc. IEEE Information Theory Workshop, Dublin, Ireland, 2010, pp. 1–5.Google Scholar
[129] , , , , and , “LDPC codes for the Gaussian wiretap channels,” in Proc. IEEE Information Theory Workshop, Taormina, Sicily, October 2009, pp. 95–99.Google Scholar
[130] and , “Unimodular lattices for the Gaussian wiretap channels,” in Proc. IEEE Information Theory Workshop, Dublin, Ireland, September 2010, pp. 1–5.Google Scholar
[131] and , “Secrecy gain: A wiretap lattice code design,” in Proc. International Symposium on Information Theory and its Applications, Taichung, Taiwan, October 2010.Google Scholar
[132] , “Recent results in the Shannon theory,” IEEE Transactions on Information Theory, vol. 20, no. 1, pp. 2–10, January 1974.Google Scholar
[133] , , and , “Compression of binary sources with side information at the decoder using LDPC codes,” IEEE Communications Letters, vol. 6, no. 10, pp. 440–442, October 2002.Google Scholar
[134] , , and , “Slepian–Wolf code design via source-channel correspondence,” in Proc. IEEE International Symposium on Information Theory, Seattle, WA, USA, July 2006, pp. 2433–2437.Google Scholar
[135] , , , , and , “Multidimensional reconciliation for a continuous-variable quantum key distribution,” Physical Review A, vol. 77, no. 4, p. 042325, April 2008.Google Scholar
[136] , , and , “Multilevel codes: Theoretical concepts and practical design rules,” IEEE Transactions on Information Theory, vol. 45, no. 5, pp. 1361–1391, July 1999.Google Scholar
[137] , , and , “Bit-interleaved coded modulation,” IEEE Transactions on Information Theory, vol. 44, no. 3, pp. 927–946, May 1998.Google Scholar
[138] , , , and , “Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes,” IEEE Transactions on Information Theory, vol. 49, no. 9, pp. 2141–2155, September 2003.Google Scholar
[139] , Cryptography and Network Security: Principles and Practice. Prentice Hall, 2010.Google Scholar
[140] and , “New directions in cryptography,” IEEE Transactions on Information Theory, vol. 22, no. 6, pp. 644–654, November 1976.Google Scholar
[141] , , and , “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the ACM, vol. 21, no. 2, pp. 120–126, February 1978.Google Scholar
[142] , Applied Cryptography: Protocols, Algorithms, and Source Code in C, 2nd edn. Wiley, 1996.Google Scholar
[144] , , , and , “Security issues in all-optical networks,” IEEE Network, vol. 11, no. 3, pp. 42–48, May–June 1997.Google Scholar
[145] , “Authentication theory and hypothesis testing,” IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1350–1356, July 2000.Google Scholar
[146] , , , and , “Securing wireless systems via lower layer enforcements,” in Proc. 5th ACM Workshop on Wireless Security, Los Angeles, CA, USA, September 2006, pp. 33–42.Google Scholar
[148] and , Eds., Securing Wireless Communications at the Physical Layer. Springer-Verlag, 2010.
[149] and , “The general Gaussian multiple-access and two-way wiretap channels: Achievable rates and cooperative jamming,” IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2735–2751, June 2008.Google Scholar
[150] and , “On the role of feedback in two-way secure communications,” in Proc. 42nd Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, USA, October 2008, pp. 1093–1097.Google Scholar
[151] , “Channel scrambling for secrecy,” in Proc. of IEEE International Symposium on Information Theory, Seoul, South Korea, July 2009, pp. 2452–2456.Google Scholar
[152] , “Capacity of correlated jamming channels,” in Proc. Allerton Conference on Communications, Computing and Control, Monticello, IL, USA, October 1997.Google Scholar
[153] , , , and , “Interference-assisted secret communications,” in Proc. IEEE Information Theory Workshop, Porto, Portugal, May 2008, pp. 164–168.Google Scholar
[154] , , , and , “The Gaussian wiretap channel with a helping interferer,” in Proc. IEEE International Symposium on Information Theory, Toronto, Canada, July 2008, pp. 389–393.Google Scholar
[155] and , “Providing secrecy with lattice codes,” in Proc. 46th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA, September 2008, pp. 1199–1206.Google Scholar
[156] and , “Secure degrees of freedom for Gaussian channels with interference: Structured codes outperform Gaussian signaling,” in Proc. IEEE Global Telecommunications Conference, Honolulu, HI, USA, December 2009, pp. 1–6.Google Scholar
[157] and , “Secrecy in cooperative relay broadcast channels,” in Proc. IEEE International Symposium on Information Theory, Toronto, Canada, July 2008, pp. 2217–2221.Google Scholar
[158] and , “Confidential messages to a cooperative relay,” in Proc. IEEE Information Theory Workshop, Porto, Portugal, May 2008, pp. 154–158.Google Scholar
[159] , , , and , “Friendly jamming for wireless secrecy,” in Proc. IEEE International Conference on Communications, Cape Town, South Africa, May 2010, pp. 1550–3607.Google Scholar
[160] and , “The cognitive multiple access wire-tap channel,” in Proc. 43rd Annual Conference on Information Sciences and Systems, Baltimore, MD, USA, March 2009, pp. 158–163.Google Scholar
[161] , , , , and , “Capacity of cognitive interference channels with and without secrecy,” IEEE Transactions on Information Theory, vol. 55, no. 2, pp. 604–619, February 2009.Google Scholar
[162] , , and , “An achievable region for the Gaussian wiretap channel with side information,” IEEE Transactions on Information Theory, vol. 52, no. 5, pp. 2181–2190, May 2006.Google Scholar
[163] and , “Secrecy rates of binary wiretapper channels using feedback schemes,” in Proc. 42nd Annual Conference on Information Sciences and Systems, Princeton, NJ, USA, March 2008, pp. 624–629.Google Scholar
[164] , , and , “The wiretap channel with feedback: Encryption over the channel,” IEEE Transactions on Information Theory, vol. 54, no. 11, pp. 5059–5067, November 2008.Google Scholar
[165] , , and , “Secret communication with feedback,” in Proc. International Symposium on Information Theory and Its Applications, Auckland, New Zealand, May 2008, pp. 1–6.Google Scholar
[166] , , , and , “New achievable secrecy rate regions for the two way wiretap channels,” in Proc. IEEE Information Theory Workshop, Cairo, Egypt, January 2010, pp. 1–5.Google Scholar
[167] and , “A new outer bound for the secrecy capacity region of the Gaussian two-way wiretap channels,” in Proc. IEEE International Conference on Communications, Cape Town, South Africa, May 2010, pp. 1–5.Google Scholar
[168] , “Coding for relay channels with confidential messages,” in Proc. IEEE Information Theory Workshop, Cairns, Australia, September 2001, pp. 87–89.Google Scholar
[169] and , “The relay-eavesdropper channel: Cooperation for secrecy,” IEEE Transactions on Information Theory, vol. 54, no. 9, pp. 4005–4019, September 2008.Google Scholar
[170] and , “Secure communication with a relay helping the wire-tapper,” in Proc. IEEE Information Theory Workshop, Lake Tahoe, CA, USA, September 2007, pp. 595–600.Google Scholar
[171] and , “Secure communication with a Byzantine relay,” in Proc. IEEE International Symposium on Information Theory, Seoul, South Korea, July 2009, pp. 2096–2100.Google Scholar
[172] and , “Two-hop secure communication using an untrusted relay,” EURASIP Journal on Wireless Communication and Networking, vol. 2009, pp. 305 146/1–13, 2009.Google Scholar
[173] and , “Cooperation with an untrusted relay: A secrecy perspective,” IEEE Transactions on Information Theory, vol. 56, no. 8, pp. 3807–3827, August 2010.Google Scholar
[174] , , and , “Secure broadcasting over fading channels,” IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2453–2469, June 2008.Google Scholar
[175] , , , and , “Compound wiretap channels,” EURASIP Journal on Wireless Communications and Networking, vol. 2009, pp. 142 374/1–12, 2009.Google Scholar
[176] and , “Secrecy capacities for multiple terminals,” IEEE Transactions on Information Theory, vol. 50, no. 12, pp. 3047–3061, December 2004.Google Scholar
[177] and , “Secrecy capacities for multiterminal channel models,” IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2437–2452, June 2008.Google Scholar
[178] and , “Secrecy generation for multiple input multiple output channel models,” in Proc. IEEE International Symosium on Information Theory, Seoul, SouthKorea, July 2009, pp. 2447–2451.Google Scholar
[179] , , , , and , “Perfect secrecy, perfect omni-science and Steiner tree packing,” in Proc. IEEE International Symposium on Information Theory, Seoul, South Korea, July 2009, pp. 1288–1292.Google Scholar
[180] and , “Perfect secrecy and combinatorial tree packing,” in Proc. IEEE International Symposium on Information Theory, Austin, TX, USA, June 2010, pp. 2622–2626.Google Scholar
[181] , “The secrecy graph and some of its properties,” in Proc. IEEE International Symposium on Information Theory, Toronto, Canada, July 2008, pp. 539–543.Google Scholar
[182] , , and , “Physical-layer security in stochastic wireless networks,” in Proc. 11th IEEE Singapore International Conference on Communication Systems, Guangzhou, Singapore, November 2008, pp. 974–979.Google Scholar
[183] , , and , “On noise insertion strategies for wireless network secrecy,” in Proc. Information Theory and Applications Workshop, San Diego, CA, USA, February 2009, pp. 77–84.Google Scholar
[184] , , , and , “Network information flow,” IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1204–1216, July 2000.Google Scholar
[185] , , and , “Linear network coding,” IEEE Transactions on Information Theory, vol. 49, no. 2, pp. 371–381, February 2003.Google Scholar
[186] and , “An algebraic approach to network coding,” IEEE/ACM Transactions on Networking, vol. 11, no. 5, pp. 782–795, October 2003.Google Scholar
[187] , , , , , , and , “A random linear network coding approach to multicast,” IEEE Transactions on Information Theory, vol. 52, no. 10, pp. 4413–4430, October 2006.Google Scholar
[188] , , and , “Practical network coding,” in Proc. 41st Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA, October 2003.Google Scholar
[189] and , “Network coding for large scale content distribution,” in Proc. 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), Miami, FL, USA, March 2005, pp. 2235–2245.Google Scholar
[190] , , , , , and , “XORs in the air: practical wireless network coding,” in Proc. Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Pisa, Italy, August 2006, pp. 243–254.Google Scholar
[191] and , “Secure network coding,” in Proc. IEEE International Symposium on Information Theory, Lausanne, Switzerland, July 2002, p. 323.Google Scholar
[192] and , “Wire-tap channel II,” AT&T Bell Labs Technical Journal, vol. 63, no. 10, pp. 2135–2157, December 1984.Google Scholar
[193] and , “On wiretap networks II,” in Proc. IEEE International Symposium on Information Theory, Nice, France, June 2007, pp. 551–555.Google Scholar
[194] and , “Weakly secure network coding,” in Proc. First Workshop on Network Coding, Theory, and Applications (NetCod), Riva del Garda, Italy, February 2005.Google Scholar
[195] , , and , “Random linear network coding: A free cipher?” in Proc. IEEE International Symposium on Information Theory, Nice, France, June 2007, pp. 546–550.Google Scholar
[196] , , and , “Lightweight security for network coding,” in Proc. IEEE International Conference on Communications, Beijing, China, May 2008, pp. 1750–1754.Google Scholar
[197] , , , , and , “Secure network coding for multi-resolution wireless video streaming,” IEEE Journal on Selected Areas in Communications, vol. 28, no. 3, pp. 377–388, April 2010.Google Scholar
[198] , , , , , and , “Resilient network coding in the presence of Byzantine adversaries,” in IEEE INFOCOM, May 2007.
[199] and , “Cooperative security for network coding file distribution,” in IEEE INFOCOM, Barcelona, Spain, April 2006.Google Scholar
[200] and , “Network error correction,” in Proc. IEEE International Symposium on Information Theory, Kanagawa, Japan, July 2003, p. 101.Google Scholar
[201] and , “Coding for errors and erasures in random network coding,” IEEE Transactions on Information Theory, vol. 54, no. 8, pp. 3579–3591, August 2008.Google Scholar
[202] , , , , , , , and , “On counteracting Byzantine attacks in network coded peer-to-peer networks,” IEEE Journal on Selected Areas in Communications, vol. 28, no. 5, pp. 692–702, June 2010.Google Scholar
[203] , , and , “Mobile secret key distribution with network coding,” in Proc. International Conference on Security and Cryptography, Barcelona, Spain, July 2007, pp. 1–4.Google Scholar
[204] , , , and , “An algebraic watchdog for wireless network coding,” in Proc. IEEE International Symposium on Information Theory, Seoul, South Korea, July 2009, pp. 1159–1163.Google Scholar
[206] and , “Network coding fundamentals,” Foundations and Trends in Networking, vol. 2, no. 1, pp. 1–133, 2007.Google Scholar
[207] and , “Network coding applications,” Foundations and Trends in Networking, vol. 2, no. 2, pp. 135–269, 2007.Google Scholar