Stealthy keyless secret key generation from degraded sources
Stealthy keyless secret key generation from degraded sources
复制标题
从降级来源生成隐形无钥匙密钥
DOI：
10.1109/acssc.2017.8335126
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Rafael F. Schaefer
中科院分区：
文献类型：
--
作者：
Pin;C. Janda;Eduard Axel Jorswieck;Rafael F. Schaefer
为了隐藏通信行为，我们可以在不同的场景和需求下采取隐蔽或隐形的通信方式。但是，当合法用户的信道比窃听者差时，合法用户可能需要额外的密钥来实现隐藏。普通的密钥生成（SKG）方案可能会因为公开讨论打破隐藏而引起威利的注意。因此，在这项工作中，我们研究了如何隐藏SKG本身，特别是根据隐身约束。我们证明，如果合法Alice和Bob（即分别为X和Y）观察到的公共随机源之间的虚拟信道比Bob和Willie（即分别为Y和Z）之间的虚拟信道更有能力，则可以实现与没有隐身约束情况下相同的隐身SK率。更进一步，如果（X， Y， Z）形成一个马尔可夫链，则具有隐身约束的SKG的关键容量可以免费获得。
To conceal the behavior of communications, we may adopt covert or stealthy communications under different scenarios and demands. However, when legitimate users have worse channels than the eavesdropper, the legitimate users may need additional keys to attain the concealment. Normal secret key generation (SKG) schemes may raise Willie's attention due to the public discussion breaking the concealment. Therefore, in this work, we investigate how to conceal the SKG itself, especially according to the stealth constraint. We prove that if the virtual channel between the common random source observed by the legitimate Alice and Bob, namely, X and Y, respectively, is more capable than that between Bob and Willie (the warden), namely, Y and Z, respectively, the same stealthy SK rate as in the case without stealth constraint can be achieved. Furthermore, if (X, Y, Z) form a Markov chain, then the key capacity of the SKG with the stealth constraint can be achieved for free.
DOI：
10.3390/e22060679
发表时间：
2020-06-18
期刊：
Entropy (Basel, Switzerland)
影响因子：
--
作者：
Lin PH;Janda CR;Jorswieck EA;Schaefer RF
通讯作者：
Schaefer RF