Secret key generation for correlated gaussian sources

IEEE Transactions on Information Theory

Volumn 58, Issue 6, 2012, Pages 3373-3391

  Nitinawarat, Sirin ^a   Narayan, Prakash ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Linear code; multiterminal Gaussian source model; nested lattice code; public communication; quantization; secret key capacity; strong secrecy

Indexed keywords

GAUSSIAN SOURCES; LINEAR CODES; NESTED LATTICE CODES; PUBLIC COMMUNICATIONS; QUANTIZATION; SECRET KEY; STRONG SECRECY;

COMMUNICATION; DATA COMPRESSION;

GAUSSIAN DISTRIBUTION;

EID: 84861398796     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2012.2184075     Document Type: Conference Paper

References (25)

1. R. Ahlswede and I. Csiszár, "Common randomness in information theory and cryptography. I. Secret sharing," IEEE Trans. Inf. Theory, vol. 39, no. 4, pp. 1121-1132, Jul. 1993.
2. C. Bennett, G. Brassard, C. Crépeau, and U. M. Maurer, "Generalized privacy amplification," IEEE Trans. Inf. Theory, vol. 41, no. 6, pp. 1915-1923, Nov. 1995.
3. C. H. Bennett, G. Brassard, and J.-M. Robert, "Privacy amplification by public discussion," SIAM J. Comput., vol. 17, pp. 210-229, Apr. 1988.
4. C. Cachin, "Entropy measures and unconditional security in cryptography," Ph.D. dissertation, ETH Zürich, Zürich, Switzerland, 1997.
5. J. H. Conway and N. J. A. Sloane, Sphere Packing, Lattices and Groups. New York: Springer-Verlag, 1988.
6. I. Csiszár, "Linear codes for sources and source networks: Error exponents, universal coding," IEEE Trans. Inf. Theory, vol. 28, no. 4, pp. 585-592, Jul. 1982. (Pubitemid 12525110)
7. I. Csiszár, "Almost independence and secrecy capacity," Probl. Pered. Inf., vol. 32, pp. 48-57, 1996.
8. I. Csiszár and P. Narayan, "Common randomness and secret key generation with a helper," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 344-366, Mar. 2000. (Pubitemid 30582727)
9. I. Csiszár and P. Narayan, "Secrecy capacities for multiple terminals," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3047-3061, Dec. 2004.
10. I. Csiszár and P. Narayan, "Secrecy capacities for multiterminal channel models," IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2437-2452, Jun. 2008.
11. A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications. New York: Springer-Verlag, 1998.
12. U. Erez and R. Zamir, "Achieving Abc on the AWGN channel with lattice encoding and decoding," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2293-2314, Oct. 2004.
13. 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. (Pubitemid 41448587)
14. G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed. Oxford, U.K.: Oxford Univ. Press, 1979.
15. Y. Liang, H. V. Poor, and S. S. Shitz, "Information theoretic security," Found. Trends Commun. Inf. Theory, vol. 5, pp. 355-580, 2008.
16. U. M. Maurer, "Secret key agreement by public discussion from common information," IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 733-742, May 1993.
17. U. M. Maurer, "The strong secret key rate of discrete random triples," in Communications and Cryptography: Two Sides of One Tapestry, R. E. Blahut, Ed. et al. Norwell, MA: Kluwer, 1994, ch. 26, pp. 271-285.
18. U. M. Maurer and S. Wolf, "Information-theoretic key agreement: From weak to strong secrecy for free," in Advances in Cryptology-EUROCRYPT 2000. New York: Springer-Verlag, 2000, vol. LNCS-1807, pp. 352-368.
19. G. Poltyrev, "On coding without restrictions for the AWGN channel," IEEE Trans. Inf. Theory, vol. 40, no. 2, pp. 409-417, Mar. 1994.
20. A. B. Wagner, S. Tavildar, and P. Viswanath, "Rate region of the quadratic Gaussian two-encoder source-coding problem," IEEE Trans. Inf. Theory, vol. 54, no. 5, pp. 1938-1961, May 2008. (Pubitemid 351689542)
21. S. Watanabe and Y. Oohama, "Secret key agreement from vector Gaussian sources by rate limited communication," IEEE Trans. Inf. Forensics Security., vol. 6, no. 3, pp. 1556-6013, Sep. 2011.
22. A. D.Wyner and J. Ziv, "The rate-distortion function for source coding with side information at the decoder," IEEE Trans. Inf. Theory, vol. 22, no. 1, pp. 1-10, Jan. 1976.
23. R. Zamir and M. Feder, "On universal quantization by randomized uniform/lattice quantizer," IEEE Trans. Inf. Theory, vol. 38, no. 2, pp. 428-436, Mar. 1992.
24. R. Zamir and M. Feder, "On lattice quantization noise," IEEE Trans. Inf. Theory, vol. 42, no. 4, pp. 1152-1159, Jul. 1996. (Pubitemid 126773745)
25. R. Zamir, S. Shamai, and U. Erez, "Nested linear/lattice codes for structured multiterminal binning," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1250-1276, Jun. 2002. (Pubitemid 34759844)