Secret-key capacity of infinite compound sources with communication rate constraint
Secret-key capacity of infinite compound sources with communication rate constraint
复制标题
通信速率约束下的无限复合源密钥容量
DOI：
10.1109/icc.2017.7996617
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Rafael F. Schaefer
中科院分区：
文献类型：
--
作者：
Nima Tavangaran;H. Boche;Rafael F. Schaefer
For secret-key generation by using a compound source, the actual statistics of the source are unknown to the participants. It is assumed that the probability distribution of the source belongs to a set which is known to the participants. The secret-key generation protocol should guarantee in this case the reliability and security of the generated secret-key simultaneously for all possible source statistics which belong to this set. At the same time, the communication rate between the legitimate users should not exceed a given communication rate parameter. In this work, this problem is studied for the case where the set of source states is arbitrary (possibly infinite) and the set of marginals (transmitter's states) is finite. The secret-key capacity is completely characterized as a function of the forward communication rate parameter between the legitimate users.
影响因子：
2.5
作者：
Rafael F. Schaefer;S. Loyka
通讯作者：
Rafael F. Schaefer;S. Loyka
影响因子：
8.1
作者：
Fettweis, Gerhard P.
通讯作者：
Fettweis, Gerhard P.