DocumentCode
2515199
Title
Secret key generation for correlated Gaussian sources
Author
Nitinawarat, Sirin
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of Maryland, College Park, MD
fYear
2008
fDate
6-11 July 2008
Firstpage
702
Lastpage
706
Abstract
We consider secret key (SK) generation by two terminals, each of which observes an i.i.d. source which is correlated with the other; the two sources are jointly Gaussian with known distribution. The terminals are then allowed to communicate with each other, possibly interactively in many rounds and without rate restrictions, over a noiseless two-way public channel. Randomization is permitted at each terminal. The goal is for the terminals to generate a SK comprising discrete common randomness which is concealed from an eavesdropper that has access to the public interterminal communication. We establish that this maximum rate of SK generation, i.e., SK capacity, is, as expected, the per-symbol mutual information I of the correlated sources. Our main technical contribution is a new scheme for achieving SK capacity using structured codes. In our scheme, vector quantization at rate R nats/source symbol of the source at terminal 1 is performed by employing nested lattice codes with dithering. Then, a SK is generated by the terminals from the quantized random sequence at terminal 1 and the (unquantized) Gaussian source at terminal 2, using both lossy and lossless data compression techniques. Our algorithm, using a rate-R lattice quantizer, achieves a maximum SK rate of 1/2 log 1/(e-2I+(1-e-2I)e-2R), which tends to the SK capacity I with increasing R. Thus, our result also specifies the associated tradeoff between quantization rate R and the maximum achievable SK rate. This tradeoff is shown to be optimum among a certain restricted class of schemes for SK generation that involve quantization at rate R of a Gaussian source at one terminal.
Keywords
Gaussian processes; cryptography; random processes; source coding; vector quantisation; SK capacity; correlated Gaussian sources; lattice codes; per-symbol mutual information; quantization; quantized random sequence; randomization; rate-R lattice quantizer; secret key generation; structured codes; vector quantization; Character generation; Chromium; Data compression; Distributed computing; Educational institutions; Lattices; Mutual information; Network address translation; Random sequences; Vector quantization;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Conference_Location
Toronto, ON
Print_ISBN
978-1-4244-2256-2
Electronic_ISBN
978-1-4244-2257-9
Type
conf
DOI
10.1109/ISIT.2008.4595077
Filename
4595077
Link To Document