Unbiased bits from sources of weak randomness and probabilistic communication complexity
SIAM Journal on Computing - Special issue on cryptography
Journal of Computer and System Sciences
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Information-theoretic key agreement: from weak to strong secrecy for free
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Secret keys from channel noise
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Common randomness and secret key capacities of two-way channels
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Common randomness and secret key generation with a helper
IEEE Transactions on Information Theory
Broadcast channels with confidential messages
IEEE Transactions on Information Theory
An achievable region for the Gaussian wiretap channel with side information
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Common randomness in information theory and cryptography. I. Secret sharing
IEEE Transactions on Information Theory
Secret key agreement by public discussion from common information
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Secure communication using noisy resources has been first studied in the contexts of secure message transmission (SMT) by Wyner as well as Csiszár-and-Körner, and secret key establishment (SKE) by Ahlswede-and-Csiszár as well as Maurer. The work defines secrecy (resp. secret-key (SK)) capacity as the highest achievable rate of secure transmission (resp. key establishment). Maurer and Wolf later focused on SKE and noticed that the secrecy requirement in the SK capacity definition was weak as it required only the "ratio" between the adversary's information and the key length to be negligible. They suggested a stronger definition of the SK capacity by requiring absolute information leakage to be negligible. They provided an interesting proof for the equality of weak and strong SK capacities in the above scenarios (setups). Followup work has since studied several setups for SKE by considering the weak SK capacity without discussing whether the results also hold for the strong definition. In this paper, we pose the question whether the equality of weak and strong SK capacities can be derived in general for all discrete memoryless communication setups. We also extend this study to message transmission and investigate the equality of weak and strong secrecy capacities. For SKE, we show that weak and strong SK capacities are equal for any setup that allows reliable transmission in any direction. For SMT, the secrecy capacities are equal when the setup allows the sender to use randomness. We furthermore provide trivial counterexamples that show these sufficient conditions are not always necessary for the equality of the capacities. Whether the conditions can be removed or relaxed by tight (necessary and sufficient) conditions remains an interesting question for future.