On identification secret sharing schemes
Information and Computation
General theory of information transfer: Updated
Discrete Applied Mathematics
New converses in the theory of identification via channels
IEEE Transactions on Information Theory
Common randomness and secret key generation with a helper
IEEE Transactions on Information Theory
The common randomness capacity of a network of discrete memoryless channels
IEEE Transactions on Information Theory
On identification capacity of infinite alphabets or continuous-time channels
IEEE Transactions on Information Theory
Common randomness in information theory and cryptography. I. Secret sharing
IEEE Transactions on Information Theory
New directions in the theory of identification via channels
IEEE Transactions on Information Theory
Wiretap channel with secure rate-limited feedback
IEEE Transactions on Information Theory
Secret key establishment over noisy channels
FPS'11 Proceedings of the 4th Canada-France MITACS conference on Foundations and Practice of Security
Bibliography of publications by Rudolf Ahlswede
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.06 |
We analyze wire-tape channels with secure feedback from the legitimate receiver. We present a lower bound on the transmission capacity (Theorem 1), which we conjecture to be tight and which is proved to be tight (Corollary 1) for Wyner's original (degraded) wire-tape channel and also for the reversely degraded wire-tape channel for which the legitimate receiver gets a degraded version from the enemy (Corollary 2). Somewhat surprisingly we completely determine the capacities of secure common randomness (Theorem 2) and secure identification (Theorem 3 and Corollary 3). Unlike for the DMC, these quantities are different here, because identification is linked to non-secure common randomness.