Achieving secrecy: Capacity vs. resolvability

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2011, Pages 633-637

  Bloch, Matthieu R ^a,b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CODING MECHANISM; CONFIDENTIAL MESSAGE; SECRECY CAPACITY; WIRETAP CHANNEL;

COMMUNICATION CHANNELS (INFORMATION THEORY);

BINARY SEQUENCES;

EID: 80054802506     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6034207     Document Type: Conference Paper

References (17)

1. M. R. Bloch and J. N. Laneman, "Secrecy from Resolvability", submitted to IEEE Transactions on Information Theory, November 2011. [Online]. Available: arXiv:1105.5419
2. M. Bloch and J. Barros, Physical-Layer Security: From Information Theory to Security Engineering. Cambridge University Press, to be published July 2011.
3. U. M. Maurer and S. Wolf, "Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free", in Advances in Cryptology - Eurocrypt 2000, Lecture Notes in Computer Science. B. Preneel, 2000, p. 351.
4. I. Csiszár, "Almost Independence and Secrecy Capacity", Problems of Information Transmission, vol. 32, no. 1, pp. 40-47, January-March 1996.
5. A. Subramanian, A. Thangaraj, M. Bloch, and S. McLaughlin, "Strong Secrecy on the Binary Erasure Wiretap Channel Using Large-Girth LDPC Codes", IEEE Transactions on Information Forensics and Security, vol. 6, no. 3, September 2011.
6. I. Csiszár and J. Körner, "Broadcast Channels with Confidential Messages", IEEE Trans. on Inf. Theory, vol. 24, no. 3, pp. 339-348, May 1978.
7. A. D. Wyner, "The Wire-Tap Channel", Bell System Technical Journal, vol. 54, no. 8, pp. 1355-1367, October 1975.
8. H. Mahdavifar and A. Vardy, "Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes", July 2010, submitted to IEEE Trans. Inf. Theory. [Online]. Available: arXiv:1007.3568v1
9. V. Rathi, M. Andersson, R. Thobaben, J. Kliewer, and M. Skoglund, "Two edge type LDPC codes for the wiretap channel", in Proc. Conf Signals, Systems and Computers Record of the Forty-Third Asilomar Conf, 2009, pp. 834-838.
10. T. Han and S. Verdú, "Approximation Theory of Output Statistics", IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 752-772, May 1993.
11. M. Hayashi, "General Nonasymptotic and Asymptotic Formulas in Channel Resolvability and Identification Capacity and their Application to the Wiretap Channels", IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1562-1575, April 2006.
12. L. Luzzi and M. R. Bloch, "Capacity-based random codes cannot achieve strong secrecy over symmetric wiretap channels", in Proc. of 1st. International Workshop on Secure Wireless Networks, Cachan, France, May 2011, (invited).
13. M. Hayashi, "Second-Order Asymptotics in Fixed-Length Source Coding and Intrinsic Randomness", IEEE Trans. Inf. Theory, vol. 54, no. 10, pp. 4619-4637, October 2008.
14. S. Watanabe, R. Matsumoto, and T. Uyematsu, "Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code", IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E93-A, no. 9, pp. 1650-1659, September 2010.
15. P. W. Cuff, "Communication in Networks for Coordinating Behavior", Ph. D. dissertation, Princeton University, July 2009.
16. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. Akademiai Kiado, December 1981.
17. M. Hayashi, "Exponential decreasing rate of leaked information in universal random privacy amplification", September 2010, accepted to IEEE Trans. on Inf. Theory. [Online]. Available: arXiv:0904.0308