Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A provably-secure strongly-randomized cipher
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
More deterministic simulation in logspace
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On extracting randomness from weak random sources (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A Pseudorandom Generator from any One-way Function
SIAM Journal on Computing
Universal Hashing and Authentication Codes
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
How to Fool an Unbounded Adversary with a Short Key
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Correcting errors without leaking partial information
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Simple construction of almost k-wise independent random variables
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Secure identification and QKD in the bounded-quantum-storage model
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
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
Universally composable privacy amplification against quantum adversaries
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Entropic security and the encryption of high entropy messages
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Oblivious transfer and linear functions
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Generalized privacy amplification
IEEE Transactions on Information Theory - Part 2
Everlasting security in the bounded storage model
IEEE Transactions on Information Theory
Near-optimal extractors against quantum storage
Proceedings of the forty-second ACM symposium on Theory of computing
Quantum entropic security and approximate quantum encryption
IEEE Transactions on Information Theory
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
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
Better short-seed quantum-proof extractors
Theoretical Computer Science
Hi-index | 0.06 |
Randomness extraction is of fundamental importance for information-theoretic cryptography. It allows to transform a raw key about which an attacker has some limited knowledge into a fully secure random key, on which the attacker has essentially no information. Up to date, only very few randomness-extraction techniques are known to work against an attacker holding quantum information on the raw key. This is very much in contrast to the classical (non-quantum) setting, which is much better understood and for which a vast amount of different techniques are known and proven to work. We prove a new randomness-extraction technique, which is known to work in the classical setting, to be secure against a quantum attacker as well. Randomness extraction is done by xor'ing a so-called δ-biased mask to the raw key. Our result allows to extend the classical applications of this extractor to the quantum setting. We discuss the following two applications. We show how to encrypt a long message with a short key, information-theoretically secure against a quantum attacker, provided that the attacker has enough quantum uncertainty on the message. This generalizes the concept of entropically-secure encryption to the case of a quantum attacker. As second application, we show how to do errorcorrection without leaking partial information to a quantum attacker. Such a technique is useful in settings where the raw key may contain errors, since standard error-correction techniques may provide the attacker with information on, say, a secret key that was used to obtain the raw key.