Hyper-Encryption and Everlasting Security
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Information-Theoretic Cryptography
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Linking Classical and Quantum Key Agreement: Is There ``Bound Information''?
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Oblivious Transfer in the Bounded Storage Model
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Key agreement from weak bit agreement
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Robust key generation from signal envelopes in wireless networks
Proceedings of the 14th ACM conference on Computer and communications security
On the effectiveness of secret key extraction from wireless signal strength in real environments
Proceedings of the 15th annual international conference on Mobile computing and networking
BodyNets '09 Proceedings of the Fourth International Conference on Body Area Networks
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
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
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
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
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
Information theoretic security based on bounded observability
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
A non-distillability criterion for secret correlations
Quantum Information & Computation
Equiangular spherical codes in quantum cryptography
Quantum Information & Computation
Time-shift attack in practical quantum cryptosystems
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
White-light interferometric method for secure key distribution
The Journal of Supercomputing
Can bipartite classical information be activated?
Quantum Information & Computation
Hi-index | 754.96 |
This paper is concerned with secret-key agreement by public discussion. Assume that two parties Alice and Bob and an adversary Eve have access to independent realizations of random variables X, Y, and Z, respectively, with joint distribution PXYZ. The secret-key rate S(X;Y||Z) has been defined as the maximal rate at which Alice and Bob can generate a secret key by communication over an insecure, but authenticated channel such that Eve's information about this key is arbitrarily small. We define a new conditional mutual information measure, the intrinsic conditional mutual information between S and Y when given Z, denoted by I(X;Y↓Z), which is an upper bound on S(X;Y||Z). The special scenarios are analyzed where X, Y, and Z are generated by sending a binary random variable R, for example a signal broadcast by a satellite, over independent channels, or two scenarios in which Z is generated by sending X and Y over erasure channels. In the first two scenarios it can be shown that the secret-key rate is strictly positive if and only if I(X;Y↓Z) is strictly positive. For the third scenario, a new protocol is presented which allows secret-key agreement even when all the previously known protocols fail