Secret-Key Generation Using Compound Sources and One-Way Public Communication
| Autor: | Rafael F. Schaefer, Nima Tavangaran, Holger Boche |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2016 |
| Předmět: |
FOS: Computer and information sciences
021110 strategic defence & security studies Key generation Computer Networks and Communications business.industry Computer science Information Theory (cs.IT) Computer Science - Information Theory 0211 other engineering and technologies 020206 networking & telecommunications Cryptography 02 engineering and technology Function (mathematics) Topology Set (abstract data type) 0202 electrical engineering electronic engineering information engineering Safety Risk Reliability and Quality business Realization (systems) Finite set Randomness Computer Science::Cryptography and Security |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|