Short seed extractors against quantum storage
Proceedings of the forty-first annual ACM symposium on Theory of computing
New bounds on classical and quantum one-way communication complexity
Theoretical Computer Science
Near-optimal extractors against quantum storage
Proceedings of the forty-second ACM symposium on Theory of computing
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
Quantum-resilient randomness extraction
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Short Seed Extractors against Quantum Storage
SIAM Journal on Computing
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
Building one-time memories from isolated qubits: (extended abstract)
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 754.84 |
An extractor is a function that is used to extract randomness. Given an imperfect random source X and a uniform seed Y, the output E(X,Y) is close to uniform. We study properties of such functions in the presence of prior quantum information about X, with a particular focus on cryptographic applications. We prove that certain extractors are suitable for key expansion in the bounded-storage model where the adversary has a limited amount of quantum memory. For extractors with one-bit output we show that the extracted bit is essentially equally secure as in the case where the adversary has classical resources. We prove the security of certain constructions that output multiple bits in the bounded-storage model.