Semantically secure lattice codes for the Gaussian wiretap channel

IEEE Transactions on Information Theory

Volumn 60, Issue 10, 2014, Pages 6399-6416

  Ling, Cong ^a   Luzzi, Laura ^a,b   Belfiore, Jean Claude ^c   Stehlé, Damien ^d  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b UNIVERSITÉ DE CERGY PONTOISE   (France)

^c TELECOM PARISTECH   (France)

^d UNIVERSITÉ DE LYON   (France)

Author keywords

information theoretic security; Lattice coding; semantic security; strong secrecy; wiretap channel

Indexed keywords

INFORMATION- THEORETIC SECURITIES; LATTICE CODING; SEMANTIC SECURITY; STRONG SECRECIES; WIRE-TAP CHANNELS;

EID: 84907222991     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2014.2343226     Document Type: Article

References (43)

1. A. D. Wyner, "The wire-tap channel," Bell Syst. Tech. J., vol. 54, no. 8, pp. 1355-1387, Oct. 1975.
2. I. Csiszár, "Almost independence and secrecy capacity," Problems Inf. Transmiss., vol. 32, no. 1, pp. 40-47, 1996.
3. S. Goldwasser and S. Micali, "Probabilistic encryption," J. Comput. Syst. Sci., vol. 28, no. 2, pp. 270-299, 1984.
4. M. Bellare, S. Tessaro, and A. Vardy, "Semantic security for the wiretap channel," in Advances in Cryptology (Lecture Notes in Computer Science), vol. 7417. Berlin, Germany: Springer-Verlag, 2012, pp. 294-311.
5. A. Subramanian, A. Thangaraj, M. Bloch, and S. McLaughlin, "Strong secrecy on the binary erasure wiretap channel using large-girth LDPC codes," IEEE Trans. Inf. Forensics Security, vol. 6, no. 3, pp. 585-594, Sep. 2011.
6. H. Mahdavifar and A. Vardy, "Achieving the secrecy capacity of wiretap channels using polar codes," IEEE Trans. Inf. Theory, vol. 57, no. 10, pp. 6428-6443, Oct. 2011.
7. D. Klinc, J. Ha, S. McLaughlin, J. Barros, and B.-J. Kwak, "LDPC codes for the Gaussian wiretap channel," IEEE Trans. Inf. Forensics Security, vol. 6, no. 3, pp. 532-540, Sep. 2011.
8. F. Oggier, P. Solé, and J.-C. Belfiore, "Lattice codes for the wiretap Gaussian channel: Construction and analysis," to be published. [Online]. Available: http://arxiv.org/abs/1103.4086
9. A. Ernvall-Hytonen and C. Hollanti, "On the eavesdropper's correct decision in Gaussian and fading wiretap channels using lattice codes," in Proc. IEEE Inf. Theory Workshop (ITW), Oct. 2011, pp. 210-214.
10. L.-C. Choo, C. Ling, and K.-K. Wong, "Achievable rates for lattice coding over the Gaussian wiretap channel," in Proc. IEEE Int. Conf. Commun. Workshops (ICC), Jun. 2011, pp. 1-5.
11. L. Lai, H. El Gamal, and H. Poor, "The wiretap channel with feedback: Encryption over the channel," IEEE Trans. Inf. Theory, vol. 54, no. 11, pp. 5059-5067, Nov. 2008.
12. U. Erez and R. Zamir, "Achieving 1/2 log (1+SNR) on the AWGN channel with lattice encoding and decoding," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2293-2314, Oct. 2004.
13. X. He and A. Yener, "Providing secrecy with lattice codes," in Proc. 46th Annu. Allerton Conf. Commun., Control, Comput., Sep. 2008, pp. 1199-1206.
14. X. He and A. Yener, "The Gaussian many-to-one interference channel with confidential messages," IEEE Trans. Inf. Theory, vol. 57, no. 5, pp. 2730-2745, May 2011.
15. X. He and A. Yener, "Strong secrecy and reliable Byzantine detection in the presence of an untrusted relay," IEEE Trans. Inf. Theory, vol. 59, no. 1, pp. 177-192, Jan. 2013.
16. M. Bloch and J. Laneman, "Strong secrecy from channel resolvability," IEEE Trans. Inf. Theory, vol. 59, no. 12, pp. 8077-8098, Dec. 2013.
17. L. Luzzi and M. R. Bloch, "Capacity-based random codes cannot achieve strong secrecy over symmetric wiretap channels," in Proc. 5th Int. ICST Conf. Perform. Eval. Methodol. Tools, 2011, pp. 641-647.
18. S. Nitinawarat and P. Narayan, "Secret key generation for correlated Gaussian sources," IEEE Trans. Inf. Theory, vol. 58, no. 6, pp. 3373-3391, Jun. 2012.
19. C. Ling, L. Luzzi, and M. Bloch, "Secret key generation from Gaussian sources using lattice hashing," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jul. 2013, pp. 2621-2625.
20. D. Micciancio and O. Regev, "Lattice-based cryptography," in Post- Quantum Cryprography, D. J. Bernstein and J. Buchmann, Eds. Berlin, Germany: Springer-Verlag, 2008.
21. M. Bloch and J. Barros, Physical Layer Security: From Information Theory to Security Engineering. Cambridge, U.K.: Cambridge Univ. Press, 2011.
22. Y. Liang, H. Poor, and S. Shamai, "Information theoretic security," in Foundations and Trends in Communications and Information Theory. Norwell, MA, USA: Now Publishers, 2009.
23. I. Csiszar and J. Korner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York, NY, USA: Academic, Dec. 1981.
24. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices, and Groups, 3rd ed. New York, NY, USA: Springer-Verlag, 1998.
25. G. Poltyrev, "On coding without restrictions for the AWGN channel," IEEE Trans. Inf. Theory, vol. 40, no. 2, pp. 409-417, Mar. 1994.
26. H. A. Loeliger, "Averaging bounds for lattices and linear codes," IEEE Trans. Inf. Theory, vol. 43, no. 6, pp. 1767-1773, Nov. 1997.
27. W. Banaszczyk, "New bounds in some transference theorems in the geometry of numbers," Math. Ann., vol. 296, no. 1, pp. 625-635, 1993.
28. G. Forney, M. Trott, and S.-Y. Chung, "Sphere-bound-achieving coset codes and multilevel coset codes," IEEE Trans. Inf. Theory, vol. 46, no. 3, pp. 820-850, May 2000.
29. D. Micciancio and O. Regev, "Worst-case to average-case reductions based on Gaussian measures," in Proc. Ann. Symp. Found. Comput. Sci., Rome, Italy, Oct. 2004, pp. 372-381.
30. J.-C. Belfiore, "Lattice codes for the compute-and-forward protocol: The flatness factor," in Proc. IEEE ITW, Paraty, Brazil, Oct. 2011, pp. 1-4.
31. C. Ling, L. Luzzi, and J.-C. Belfiore, "Lattice codes achieving strong secrecy over the mod Gaussian channel," in Proc. IEEE Int. Symp. Inform. Theory (ISIT), Cambridge, MA, USA, Jul. 2012, pp. 2306-2310.
32. C. Gentry, C. Peikert, and V. Vaikuntanathan, "Trapdoors for hard lattices and new cryptographic constructions," in Proc. 40th Annu. ACM Symp. Theory Comput., Victoria, BC, Canada, 2008, pp. 197-206.
33. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York, NY, USA: Wiley, 1991.
34. O. Regev, "On lattices, learning with errors, random linear codes, and cryptography," J. ACM, vol. 56, no. 6, pp. 34:1-34:40, 2009.
35. G. D. Forney, "On the role of MMSE estimation in approaching the information-theoretic limits of linear Gaussian channels: Shannon meets Wiener," in Proc. 41st Allerton Conf. Commun., Control Comput., 2003, pp. 430-439.
36. U. Erez, S. Litsyn, and R. Zamir, "Lattices which are good for (almost) everything," IEEE Trans. Inf. Theory, vol. 51, no. 10, pp. 3401-3416, Oct. 2005.
37. T. Han and S. Verdu, "Approximation theory of output statistics," IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 752-772, May 1993.
38. R. Zamir and M. Feder, "On lattice quantization noise," IEEE Trans. Inf. Theory, vol. 42, no. 4, pp. 1152-1159, Jul. 1996.
39. G. D. Forney, Jr., "Coset codes. I. Introduction and geometrical classification," IEEE Trans. Inf. Theory, vol. 34, no. 5, pp. 1123-1151, Sep. 1988.
40. P. Klein, "Finding the closest lattice vector when it's unusually close," in Proc. ACM-SIAM Symp. Discrete Algorithms, 2000, pp. 937-941.
41. S. Liu, C. Ling, and D. Stehlé, "Decoding by sampling: A randomized lattice algorithm for bounded-distance decoding," IEEE Trans. Inf. Theory, vol. 57, no. 9, pp. 5933-5945, Sep. 2011.
42. D. Micciancio and S. Goldwasser, Complexity of Lattice Problems: A Cryptographic Perspective. Boston, MA, USA: Kluwer, 2002.
43. B. Nazer and M. Gastpar, "Compute-and-forward: Harnessing interference through structured codes," IEEE Trans. Inf. Theory, vol. 57, no. 10, pp. 6463-6486, Oct. 2011.