On noise insertion strategies for wireless network secrecy

Information Theory and Applications Workshop, ITA 2009

Volumn , Issue , 2009, Pages 77-84

  Perron, Etienne ^a   Diggavi, Suhas ^a   Telatar, Emre ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ACHIEVABILITY; ACHIEVABLE RATE; CHANNEL STATISTICS; DETERMINISTIC SIGNALS; ENCODING FUNCTIONS; LOWER AND UPPER BOUNDS; MULTIPLE SOURCE; NOISY SIGNALS; OPTIMAL RATE; OUTER BOUNDS; RANDOM NOISE; RELAY NODE; RELIABLE TRANSMISSION; UPPER BOUND;

INFORMATION THEORY;

WIRELESS NETWORKS;

EID: 70349282001     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITA.2009.5044926     Document Type: Conference Paper

References (11)

1. A.S. Avestimehr, S.N. Diggavi, and D.N.C. Tse. A detenninistic approach to wireless relay networks. In Proceedings oj Allerton Coriference on Communication, Control, and Computing, Illinois, USA, September 2007. See: http://licos.epfl.chlindex.php?p=research-projWNC.
2. A.S. Avestimehr, S.N. Diggavi, and D.N.C. Tse. Wireless network information flow. In Proceedings oj Allerton ConJerence on Communication, Control, and Computing, Illinois, USA, September 2007. See: http://licos.epfl. chlindex.php?p=research-projWNC.
3. I Csiszár and J. Kömer. Broadcast channels with confidential messages. IEEE Trans. Inform. Theory, 24(3), May 1978.
4. L Lai and H. EI Gamal. Cooperative secrecy: The relay-eavesdropper channel. Proc. oJthe IEEE Int. Symposium on Inform. Theory, Nice, France, June 2007.
5. y. Oohama. Relay channels with confidential messages. IEEE Trans. Inform. Theory, November 2006. submitted.
6. E. Perron, S. Diggavi, and E. Telatar. On cooperative wireless network secrecy. Technical Report LICOS-REPORT-2008-2009, École Polytechnique Fédérale de Lausanne, Switzerland, August 2008. http://infoscience.epfl.chirecordlI26166.
7. E. Perron, S. Diggavi, and E. Telatar. On cooperative wireless network secrecy. In Proc. oj IEEE lrifocom, Rio de Janeiro, Brazil, April 2009.
8. Th.M.Cover and J.A. Thomas. Elements oj InJormation Theory. Wiley, New York, 1991.
9. D.N.C. Tse and S.V. Hanly. Multiaccess fading channels.I Polymatroid structure, optimal resource allocation and throughput capacities. IEEE Trans. Inform. Theory, 44(7):2796-2815, November 1998.
10. M.N. Wegman and J.L. Carter. New hash functions and their use in authentication and set equality. Journal oj Computer and System Sciences, 22:265-279, 1981.
11. A. D. Wyner. The wire-tap channel. Bell System Tech. J 54:1355-1387, October 1975.