Matrix analysis
Privacy amplification by public discussion
SIAM Journal on Computing - Special issue on cryptography
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Composition and integrity preservation of secure reactive systems
Proceedings of the 7th ACM conference on Computer and communications security
Quantum computation and quantum information
Quantum computation and quantum information
The Quantum Communication Complexity of Sampling
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Optimal Randomizer Efficiency in the Bounded-Storage Model
Journal of Cryptology
The universal composable security of quantum key distribution
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Generalized privacy amplification
IEEE Transactions on Information Theory - Part 2
Proof of security of quantum key distribution with two-way classical communications
IEEE Transactions on Information Theory
Cryptography In the Bounded Quantum-Storage Model
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Composable Security in the Bounded-Quantum-Storage Model
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Composing Quantum Protocols in a Classical Environment
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
New bounds on classical and quantum one-way communication complexity
Theoretical Computer Science
General paradigm for distilling classical key from quantum states
IEEE Transactions on Information Theory
Smooth entropies and the quantum information spectrum
IEEE Transactions on Information Theory
Min- and max-relative entropies and a new entanglement monotone
IEEE Transactions on Information Theory
A fully quantum asymptotic equipartition property
IEEE Transactions on Information Theory
Security of trusted repeater quantum key distribution networks
Journal of Computer Security - EU-Funded ICT Research on Trust and Security
Unifying classical and quantum key distillation
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Secure identification and QKD in the bounded-quantum-storage model
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
A tight high-order entropic quantum uncertainty relation with applications
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Randomness extraction via δ-biased masking in the presence of a quantum attacker
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Duality between smooth min- and max-entropies
IEEE Transactions on Information Theory
Secure two-party quantum evaluation of unitaries against specious adversaries
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Sampling in a quantum population, and applications
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Two-source extractors secure against quantum adversaries
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
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
Security of quantum key distribution with bit and basis dependent detector flaws
Quantum Information & Computation
Information vs. disturbance in dimension D
Quantum Information & Computation
Getting something out of nothing
Quantum Information & Computation
Security of quantum key distribution using weak coherent states with nonrandom phases
Quantum Information & Computation
Security proof of quantum key distribution with detection efficiency mismatch
Quantum Information & Computation
Simple and tight bounds for information reconciliation and privacy amplification
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
The universal composable security of quantum key distribution
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
A quantum cipher with near optimal key-recycling
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Efficient device-independent quantum key distribution
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Oblivious transfer and linear functions
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
A real-time privacy amplification scheme in quantum key distribution
ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology
| Hi-index | 0.30 |
Privacy amplification is the art of shrinking a partially secret string Z to a highly secret key S. We show that, even if an adversary holds quantum information about the initial string Z, the key S obtained by two-universal hashing is secure, according to a universally composable security definition. Additionally, we give an asymptotically optimal lower bound on the length of the extractable key S in terms of the adversary's (quantum) knowledge about Z. Our result has applications in quantum cryptography. In particular, it implies that many of the known quantum key distribution protocols are universally composable.