Explicit capacity-achieving coding scheme for the Gaussian wiretap channel

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2014, Pages 956-960

  Tyagi, Himanshu ^a   Vardy, Alexander ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); GAUSSIAN DISTRIBUTION; SIGNAL TO NOISE RATIO;

CODEWORD LENGTH; CODING SCHEME; GAUSSIANS; POLYNOMIAL COMPLEXITY; STRONG SECURITIES; TRANSMISSION CODES; WIRE-TAP CHANNELS;

CHANNEL CODING;

EID: 84906539585     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2014.6874974     Document Type: Conference Paper

References (21)

1. E. Abbe and A. Barron, "Polar coding schemes for the AWGN channel, " IEEE International Symposium on Information Theory, pp. 194-198, 2011.
2. G. W. Anderson, A. Guionnet, and O. Zeitouni, An introduction to random matrices. Cambridge University Press, 2010.
3. M. Bellare and S. Tessaro, "Polynomial-time, semantically-secure encryption achieving the secrecy capacity, " Cryptology ePrint Archive, Report 2012/022, 2012, http://eprint.iacr.org/.
4. M. Bellare, S. Tessaro, and A. Vardy, "A cryptographic treatment of the wiretap channel, " Cryptology ePrint Archive, Report 2012/015, 2012, http://eprint.iacr.org/.
5. M. Bellare, S. Tessaro, and A. Vardy, "Semantic security for the wiretap channel, " CRYPTO, LNCS, vol. 7417, pp. 294-311, 2012.
6. C. H. Bennett, G. Brassard, and J.-M. Robert, "Privacy amplification by public discussion, " SIAM J. Comput., vol. 17, no. 2, pp. 210-229, 1988.
7. J. L. Carter and M. N. Wegman, "Universal classes of hash functions, " Journal of Computer and System Sciences, vol. 18, no. 2, pp. 143 - 154, 1979.
8. I. Csiszár and P. Narayan, "Secrecy capacities for multiple terminals, " IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3047-3061, December 2004.
9. S. Goldwasser and S. Micali, "Probabilistic encryption, " Journal of Computer and System Sciences, vol. 28, no. 2, pp. 270 - 299, 1984.
10. M. Hayashi and R. Matsumoto, "Construction of wiretap codes from ordinary channel codes, " Proc. IEEE International Symposium on Information Theory, pp. 2538-2542, 2010.
11. R. Impagliazzo, L. A. Levin, and M. Luby, "Pseudo-random generation from one-way functions, " in Proc. ACM Symposium on Theory of Computing (STOC), 1989, pp. 12-24.
12. R. Impagliazzo and D. Zuckerman, "How to recycle random bits, " in Proc. Annual Symposium on Foundations of Computer Science (FOCS), 1989, pp. 248-253.
13. A. Joseph and A. R. Barron, "Least squares superposition codes of moderate dictionary size are reliable at rates up to capacity, " IEEE Trans. Inf. Theory, vol. 58, no. 5, pp. 2541-2557, 2012.
14. H. Krawczyk, "LFSR-based hashing and authentication, " CRYPTO, LNCS, vol. 839, pp. 129-139, 1994.
15. S. Leung-Yan-Cheong and M. Hellman, "The Gaussian wiretap channel, " IEEE Trans. Inf. Theory, vol. 24, no. 4, pp. 451-456, 1978.
16. C. Ling, L. Luzzi, J.-C. Belfiore, and D. Stehlé, "Semantically secure lattice codes for the gaussian wiretap channel, " CoRR, vol. abs/1210.6673v3, 2013.
17. R. Renner, "Security of quantum key distribution, " Ph. D. Dissertation, ETH Zurich, 2005.
18. R. Renner and S. Wolf, "Simple and tight bounds for information reconciliation and privacy amplification, " in Proc. ASIACRYPT, 2005, pp. 199-216.
19. I. Tal and A. Vardy, "Channel upgrading for semantically-secure encryption on wiretap channels, " Proc. IEEE International Symposium on Information Theory, pp. 1561-1565, 2013.
20. X. Wang, "Volumes of generalized unit balls, " Mathematics Magazine, vol. 78, no. 5, 2005.
21. A. D. Wyner, "The wiretap channel, " Bell System Technical Journal, vol. 54, no. 8, pp. 1355-1367, October 1975.