A Lattice Coding Scheme for Secret Key Generation from Gaussian Markov Tree Sources

Vatedka, Shashank and Kashyap, Navin (2016) A Lattice Coding Scheme for Secret Key Generation from Gaussian Markov Tree Sources. In: IEEE International Symposium on Information Theory (ISIT), JUL 10-15, 2016, Barcelona, SPAIN, pp. 515-519.

PDF IEEE_Int_Sym_Int_The_515_2016.pdf - Published Version Restricted to Registered users only Download (376kB) | Request a copy

Abstract

In this article, we study the problem of secret key generation in the multiterminal source model, where the terminals have access to correlated Gaussian sources. We assume that the sources form a Markov chain on a tree. We give a nested lattice-based key generation scheme whose computational complexity is polynomial in the number, N, of independent and identically distributed samples observed by each source. We also compute the achievable secret key rate and give a class of examples where our scheme is optimal in the fine quantization limit. However, we also give examples that show that our scheme is not always optimal in the limit of fine quantization.

Item Type:	Conference Proceedings
Series.:	IEEE International Symposium on Information Theory
Additional Information:	Copy right for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	09 Feb 2017 09:05
Last Modified:	09 Feb 2017 09:05
URI:	http://eprints.iisc.ac.in/id/eprint/56193

Actions (login required)

View Item