Secret-Key Generation Using Compound Sources and One-Way Public Communication

被引：19

作者：

Tavangaran, Nima ^{[1
]}

Boche, Holger ^{[1
]}

Schaefer, Rafael F. ^{[2
,3
]}

机构：

[1] Tech Univ Munich, Lehrstuhl Theoret Informat Tech, D-80290 Munich, Germany

[2] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA

[3] Tech Univ Berlin, Informat Theory & Applicat Chair, D-10587 Berlin, Germany

来源：

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY | 2017年 / 12卷 / 01期

关键词：

Compound source; secret-key capacity; common randomness; hypothesis testing; COMMON RANDOMNESS; INFORMATION-THEORY; CRYPTOGRAPHY; CAPACITY;

D O I：

10.1109/TIFS.2016.2611484

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In the classical secret-key generation model, common randomness is generated by two terminals based on the observation of correlated components of a common source, while keeping it secret from a non-legitimate observer. It is assumed that the statistics of the source are known to all participants. In this paper, the secret-key generation based on a compound source is studied where the realization of the source statistic is unknown. The protocol should guarantee the security and reliability of the generated secret-key, simultaneously for all possible realizations of the compound source. A single-letter lower-bound of the secret-key capacity for a finite compound source is derived as a function of the public communication rate constraint. A multi-letter capacity formula is further computed for a finite compound source for the case in which the public communication is unconstrained. Finally, a single-letter capacity formula is derived for a degraded compound source with an arbitrary (possibly infinite) set of source states and a finite set of marginal states.

引用

页码：227 / 241

页数：15

共 37 条

[21] On the distribution of roots of certain algebraic equations with integer coefficients [J].

Fekete, M .

MATHEMATISCHE ZEITSCHRIFT, 1923, 17 :228-249

[22]

Fettweis G., 2014, TACTILE INTERNET

[23]

Gacs P., 1973, Problems of Control and Information Theory, V2, P149

[24]

Grigorescu A., 2015, THESIS

[25] ASYMPTOTICALLY OPTIMAL TESTS FOR MULTINOMIAL DISTRIBUTIONS [J].

HOEFFDING, W .

ANNALS OF MATHEMATICAL STATISTICS, 1965, 36 (02) :369-408

[26] Biometric Security from an Information -Theoretical Perspective [J].

Ignatenko, Tanya ;

Willems, Frans M. J. .

FOUNDATIONS AND TRENDS IN COMMUNICATIONS AND INFORMATION THEORY, 2010, 7 (2-3) :135-316

[27]

Jahn J.-H., 1978, THESIS

[28]

Lai L., 2010, IEEE T INF FOREN SEC, V6, P122

[29] Compound Wiretap Channels [J].

Liang, Yingbin ;

Kramer, Gerhard ;

Poor, H. Vincent ;

Shamai , Shlomo .

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2009,

[30]

Maurer U, 2000, LECT NOTES COMPUT SC, V1807, P351

← 1 2 3 4 →