2016/01/27 by Nima Tavangaran, Holger Boche, Tavangaran, Nima +3 · 1 citation
Computer Science · Engineering · #FOS: Computer and information sciences #Information Theory (cs.IT) #Physical Unclonable Functions (PUFs) and Hardware Security #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.1601.07513
openalex publication_date 2016/01/27 · openalex created_date 2022/10/03 · openalex updated_date 2026/07/28
In the classical Secret-Key generation model, Common Randomness is generated\nby two terminals based on the observation of correlated components of a common\nsource, while keeping it secret from a non-legitimate observer. It is assumed\nthat the statistics of the source are known to all participants. In this work,\nthe Secret-Key generation based on a compound source is studied where the\nrealization of the source statistic is unknown. The protocol should guarantee\nthe security and reliability of the generated Secret-Key, simultaneously for\nall possible realizations of the compound source. A single-letter lower-bound\nof the Secret-Key capacity for a finite compound source is derived as a\nfunction of the public communication rate constraint. A multi-letter capacity\nformula is further computed for a finite compound source for the case in which\nthe public communication is unconstrained. Finally a single-letter capacity\nformula is derived for a degraded compound source with an arbitrary set of\nsource states and a finite set of marginal states.\n