Secret key generation from Gaussian sources using lattice hashing

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2013, Pages 2621-2625

  Ling, Cong ^a   Luzzi, Laura ^b   Bloch, Matthieu R ^c  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b CNRS   (France)

^c GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FLATNESS FACTOR; GAUSSIAN SOURCES; INTRINSIC RANDOMNESS; LATTICE-BASED; SECRET KEY; SECRET KEY GENERATIONS; SOURCE MODELS;

INFORMATION THEORY;

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

References (16)

1. U. Maurer, "Secret key agreement by public discussion from common information," IEEE Trans. Inform. Theory, vol. 39, no. 3, pp. 733-742, May 1993.
2. R. Ahlswede and I. Csiszar, "Common randomness in information theory and cryptography-Part I: Secret sharing," IEEE Trans. Inform. Theory, vol. 39, no. 4, pp. 1121-1132, July 1993.
3. S. Watanabe and Y. Oohama, "Secret key agreement from correlated Gaussian sources by rate limited public communication," IEICE Trans. Fundamentals, vol. E93-A, pp. 1976-1983, Nov. 2010.
4. S. Nitinawarat and P. Narayan, "Secret key generation for correlated Gaussian sources," IEEE Trans. Inform. Theory, vol. 58, no. 6, pp. 3373-3391, June 2012.
5. M. Bloch, "Channel intrinsic randomness," in Proc. of IEEE Int. Symp. on Inf. Theory, June 2010, pp. 2607-2611.
6. J. Muramatsu, H. Koga, and T. Mukouchi, "On the problem of generating mutually independent random sequences," IEICE Trans. Fundamentals, vol. E86-A, no. 5, pp. 1275-1284, May 2003.
7. M. Hayashi, "Exponential decreasing rate of leaked information in universal random privacy amplification," IEEE Trans. Inform. Theory, vol. 57, no. 6, pp. 3989-4001, June 2011.
8. J.-C. Belfiore, "Lattice codes for the compute-and-forward protocol: The flatness factor," in Proc. of IEEE Inf. Theory Workshop, Paraty, Brazil, 2011.
9. C. Ling, L. Luzzi, J.-C. Belfiore, and D. Stehle, "Semantically secure lattice codes for the Gaussian wiretap channel," 2012. [Online]. Available: http://arxiv.org/abs/1210.6673
10. R. Zamir, S. Shamai, and U. Erez, "Nested linear/lattice codes for structured multiterminal binning," IEEE Trans. Inform. Theory, vol. 48, pp. 1250-1276, June 2002.
11. Z. Liu, S. Cheng, A. Liveris, and Z. Xiong, "Slepian-Wolf coded nested lattice quantization for Wyner-Ziv coding: High-rate performance analysis and code design," IEEE Trans. Inform. Theory, vol. 52, no. 10, pp. 4358-4379, Oct. 2006.
12. C. Ling, S. Gao, and J.-C. Belfiore, "Wyner-Ziv coding based on multidimensional nested lattices," IEEE Trans. Commun., vol. 60, no. 5, pp. 1328-1335, May 2012.
13. B. Nazer and M. Gastpar, "Compute-and-forward: Harnessing interference through structured codes," IEEE Trans. Inform. Theory, vol. 57, pp. 6463-6486, Oct. 2011.
14. I. Csiszar, "Almost independence and secrecy capacity," Problems of Information Transmission, vol. 32, pp. 40-47, 1996.
15. U. Erez and R. Zamir, "Achieving 1/2 log(1+SNR) on the AWGN channel with lattice encoding and decoding," IEEE Trans. Inform. Theory, vol. 50, no. 10, pp. 2293-2314, Oct. 2004.
16. D. Krithivasan and S. S. Pradhan, "A proof of the existence of good nested lattices," 2007. [Online]. Available: http://www.eecs.umich.edu/ techreports/systems/cspl/cspl-384.pdf