Towards Characterizing When Information-Theoretic Secret Key Agreement Is Possible
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
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
Unconditionally secure key agreement and the intrinsic conditional information
IEEE Transactions on Information Theory
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Journal of Computer and System Sciences - Special issue: STOC 2003
Key agreement from weak bit agreement
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Information Theoretic Security
Foundations and Trends in Communications and Information Theory
General paradigm for distilling classical key from quantum states
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Secrecy generation for multiple input multiple output channel models
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Unifying classical and quantum key distillation
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Information-theoretic key agreement of multiple terminals: part I
IEEE Transactions on Information Theory
Information-theoretic key agreement of multiple terminal: part II: channel model
IEEE Transactions on Information Theory
Secret key generation for a pairwise independent network model
IEEE Transactions on Information Theory
A non-distillability criterion for secret correlations
Quantum Information & Computation
Equiangular spherical codes in quantum cryptography
Quantum Information & Computation
New monotones and lower bounds in unconditional two-party computation
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Can bipartite classical information be activated?
Quantum Information & Computation
| Hi-index | 0.30 |
Perfectly secret message transmission can be realized with only partially secret and weakly correlated information shared by the parties as soon as this information allows for the extraction of information-theoretically secret bits. The best known upper bound on the rate S at which such key bits can be generated has been the intrinsic information of the distribution modeling the parties', including the adversary's, knowledge. Based on a new property of the secret-key rate S, we introduce a conditional mutual information measure which is a stronger upper bound on S. Having thus seen that the intrinsic information of a distribution P is not always suitable for determining the number of secret bits extractable from P, we prove a different significance of it in the same context: It is a lower bound on the number of key bits required to generate P by public communication. Taken together, these two results imply that sometimes, (a possibly arbitrarily large fraction of) the correlation contained in distributed information cannot be extracted in the form of secret keys by any protocol.