Elements of information theory
Elements of information theory
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
New bounds in secret-key agreement: the gap between formation and secrecy extraction
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Unconditionally secure key agreement and the intrinsic conditional information
IEEE Transactions on Information Theory
Secrecy capacities for multiple terminals
IEEE Transactions on Information Theory
Secrecy Capacities for Multiterminal Channel Models
IEEE Transactions on Information Theory
On information theoretic security: mathematical models and techniques
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
| Hi-index | 754.84 |
This is the second part of a two-part paper on information-theoretically secure secret key agreement. This part covers the secret key capacity under the channel model. In this model, multiple terminals wish to create a shared secret key that is secure from an eavesdropper with unlimited computational resources. The terminals are all connected to a noiseless and authenticated but insecure channel, called the "public channel." Furthermore, the terminals have access to a secure but noisy discrete memoryless broadcast channel (DMBC). The first terminal can choose a sequence of inputs to the DMBC, which has outputs at the other terminals and at the eavesdropper. After each channel use, the terminals can engage in arbitrarily many rounds of interactive authenticated communication over the public channel. At the end, each legitimate terminal should be able to generate the secret key. In this paper, we derive new lower and upper bounds on the secrecy capacity. In each case, an example is provided to show that the new bound represents a strict improvement over the previously best known bound. This part of the paper is not standalone, and is written under the assumption that the reader has access to Part I, which is published in the same issue.