We consider the problem of multiterminal secret key agreement (SKA) in
wiretapped source model where terminals have access to samples of correlated
random variables from a publicly known joint probability distribution. The
adversary has access to a side information variable, that is correlated with
terminals’ variables. We focus on a special type of terminal variables in this
model, known as Tree-PIN, where the relation between variables of the terminals
can be represented by a tree. The study of Tree-PIN source model is of
practical importance as it can be realized in wireless network environments. We
derive the wiretap secret key capacity of Tree-PIN with independent leakage,
and give lower and upper bounds on the maximum achievable secret key length in
finite-length regime. We then prove an upper bound and a lower bound for the
wiretap secret key capacity of a wiretapped PIN and give two conditions for
which these bounds are tight. We also extend our main result to two other
related models and prove their corresponding capacities. At the end, we argue
how our analysis suggests that public interaction is required for achieving the
multiterminal WSK capacity.

Go to Source of this post
Author Of this post: <a href="http://arxiv.org/find/cs/1/au:+Poostindouz_A/0/1/0/all/0/1">Alireza Poostindouz</a>, <a href="http://arxiv.org/find/cs/1/au:+Safavi_Naini_R/0/1/0/all/0/1">Reihaneh Safavi-Naini</a>

By admin