An achievable region for the Wiretap multiple-access channel with common message

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2012, Pages 249-253

  Wiese, Moritz ^a   Boche, Holger ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ACHIEVABLE REGION; CHANNEL OUTPUT; COMMON RANDOMNESS; MULTIPLE ACCESS CHANNELS;

INFORMATION THEORY;

EID: 84867563761     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2012.6283966     Document Type: Conference Paper

References (19)

1. I. Bjelaković, H. Boche, J. Sommerfeld, "Secrecy Results for Compound Wiretap Channels", achievable at http://arxiv.org/abs/1106.2013, 2011.
2. M.R. Bloch, J.N. Laneman, "Secrecy from Resolvability", submitted to IEEE Trans. Inf. Theory, achievable at http://arxiv.org/abs/1105. 5419, 2011.
3. N. Cai, A.Winter, R.W. Yeung, "Quantum Privacy and QuantumWiretap Channels", Probl. Inf. Transm, vol. 40, no. 4, pp. 318-336, 2004.
4. I. Csiszár, "Almost Independence and Secrecy Capacity", Problems of Information Transmission, vol. 32, no. 1, pp. 40-47, 1996.
5. I. Csiszár, J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems, 2nd edition, Cambridge: Cambridge University Press, 2011.
6. I. Csiszár, J. Körner, "Broadcast Channels with Confidential Messages", IEEE Trans. Inf. Theory, vol. IT-24, no. 3, pp. 339-348, 1978.
7. I. Devetak, "The Private Classical Capacity and Quantum Capacity of a Quantum Channel", IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 44-55, 2005.
8. E. Ekrem, S. Ulukus, "Effects of Cooperation on the secrecy of Multiple Access Channels with Generalized Feedback", Proc. Conf. on Inf. Sciences and Systems (CISS), pp. 791-796, Princeton, NJ, March 2008.
9. E. Ekrem, S. Ulukus, "On the Secrecy of Multiple Access Wiretap Channel", Proc. Allerton Conference, pp. 1014-1021, Allerton House, UIUC, IL, USA, Sept. 2008.
10. R. Liu, Y. Liang, H.V. Poor, "Fading Cognitive Multiple-Access Channels With Confidential Messages", submitted to IEEE Trans. Inf. Theory, achievable at http://arxiv.org/abs/0910.4613, 2009.
11. Y. Liang, H.V. Poor, "Multiple-Access Channels With Confidential Messages", IEEE Trans. Inf. Theory, vol. 54, no. 3, pp. 976-1002, 2008.
12. R. Liu, I. Marić, R.D. Yates, P. Spasojević, "The Discrete Memoryless Multiple-Access Channel with Confidential Messages", Proc. Int. Symp. Inf. Theory, pp. 957-961, Seattle, USA, July 2006.
13. U.M. Maurer, S. Wolf, "Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free", Advances in Cryptology - Eurocrypt 2000, Lecture Notes in Computer Science, vol. 1807, pp. 351-368, 2000.
14. O. Simeone, A. Yener, "The Cognitive Multiple Access Wire-Tap Channel", Proc. Conf. on Inf. Sciences and Systems (CISS), Baltimore, NJ, USA, March 2009.
15. D. Slepian and K. Wolf, "A coding theorem for multiple access channels with correlated sources", Bell System Techn. J., vol. 52, no. 7, 1037-1076, 1973.
16. X. Tang, R. Liu, P. Spasojević, H. V. Poor, "Multiple Access Channels with Generalized Feedback and Confidential Messages", Proc. Inf. Theory Workshop, pp. 608-613, Lake Tahoe, CA, USA, Sept. 2007.
17. M. van Dijk, "On a Special Class of Broadcast Channels with Confidential Messages", IEEE Trans. Inf. Theory, vol. 43, no. 2, 1997.
18. F.M.J. Willems, "The Discrete Memoryless Multiple Access Channel with Partially Cooperating Encoders", IEEE Trans. Inf. Theory, vol. IT-29, no. 3, pp. 441-445, 1983.
19. A. Wyner, "The Wire-Tap Channel", The Bell System Tech. J., vol. 54, no. 8, pp 1355-1387, 1975.