Secret-Key Capacity of Infinite Compound Sources with Communication Rate Constraint

被引：0

作者：

Tavangaran, Nima ^{[1
]}

Boche, Holger ^{[1
]}

Schaefer, Rafael F. ^{[2
]}

机构：

[1] Tech Univ Munich, Munich, Germany

[2] Tech Univ Berlin, Berlin, Germany

来源：

2017 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC) | 2017年

关键词：

Compound source; secret-key capacity; common randomness; COMMON RANDOMNESS; INFORMATION;

D O I：

暂无

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

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.

引用

页数：6

共 20 条

[1] COMMON RANDOMNESS IN INFORMATION-THEORY AND CRYPTOGRAPHY .1. SECRET SHARING [J].