Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Smooth entropies and the quantum information spectrum
IEEE Transactions on Information Theory
A tight high-order entropic quantum uncertainty relation with applications
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Generalized privacy amplification
IEEE Transactions on Information Theory - Part 2
A fully quantum asymptotic equipartition property
IEEE Transactions on Information Theory
Quantum entropic security and approximate quantum encryption
IEEE Transactions on Information Theory
Duality between smooth min- and max-entropies
IEEE Transactions on Information Theory
Asymptotically optimal discrimination between pure quantum states
TQC'10 Proceedings of the 5th conference on Theory of quantum computation, communication, and cryptography
A conceptually simple proof of the quantum reverse Shannon theorem
TQC'10 Proceedings of the 5th conference on Theory of quantum computation, communication, and cryptography
Secure authentication from a weak key, without leaking information
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Quantum-resilient randomness extraction
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Robust cryptography in the noisy-quantum-storage model
Quantum Information & Computation
Better short-seed quantum-proof extractors
Theoretical Computer Science
Certifiable quantum dice: or, true random number generation secure against quantum adversaries
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
An intuitive proof of the data processing inequality
Quantum Information & Computation
Key-leakage evaluation of authentication in quantum key distribution with finite resources
Quantum Information Processing
Uncertainty principle guarantees genuine source of intrinsic randomness
Quantum Information Processing
| Hi-index | 755.02 |
In this paper, we show that the conditional min-entropy Hmin (A\B)of a bipartite state ρAB is directly related to the maximum achievable overlap with a maximally entangled state if only local actions on the B-part of ρAB are allowed. In the special case where A is classical, this overlap corresponds to the probability of guessing A given B. In a similar vein, we connect the conditional max-entropy Hmax (A\B) to the maximum fidelity of ρAB with a product state that is completely mixed on A. In the case where A is classical, this corresponds to the security of A when used as a secret key in the presence of an adversary holding B.Because min- and max-entropies are known to characterize information-processing tasks such as randomness extraction and state merging, our results establish a direct connection between these tasks and basic operational problems. For example, they imply that the (logarithm of the) probability of guessing A given B is a lower bound on the number of uniform secret bits that can be extracted from A relative to an adversary holding B.