Multi-Key Generation Over a Cellular Model With a Helper

Huishuai Zhang, Yingbin Liang, Lifeng Lai, Shlomo Shamai ShitzIEEE Trans. Information Theory 2017 · OpenReview

Abstract

The problem of simultaneously generating multiple keys for a cellular source model with a helper is investigated. In the model considered, there are four terminals, X <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> , X <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> , X <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> , and X <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sub> , each of which observes one component of a vector source. Terminal X <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> wishes to generate two secret keys K <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> and K <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> , respectively, with terminals X <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> and X <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> under the help of terminal X <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sub> . All terminals are allowed to communicate over a public channel. An eavesdropper is assumed to have access to the public discussion. Both symmetric and asymmetric key generations are considered. In symmetric key generation models, model 1a (with a trusted helper) requires that the two keys are concealed from the eavesdropper, and model 1b (with an untrusted helper) further requires that the two keys are concealed from the helper in addition to the eavesdropper. The asymmetric key generation models 2a and 2b are the same as symmetric key generation models 1a and 1b, respectively, except that the key K <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> is further required to be concealed from terminal X1. For all models studied, the key capacity region is established by designing a unified achievable strategy to achieve the cut-set outer bounds. We also study the problem of generating more than two keys and characterize its key capacity region when all the cellular terminals are required to generate independent keys with the base station.
BibTeX
@article{zhang2017multi,
  author = {Huishuai Zhang and Yingbin Liang and Lifeng Lai and Shlomo Shamai Shitz},
  title = {{Multi-Key Generation Over a Cellular Model With a Helper}},
  journal = {IEEE Trans. Information Theory},
  year = {2017},
  url = {https://openreview.net/forum?id=LVcvKrXj9BL},
}

Loading related content...

Figure