Conditionally-perfect secrecy and a provably-secure randomized cipher
Journal of Cryptology - Eurocrypt '90
Journal of Computer and System Sciences
Pseudorandom generators without the XOR lemma
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Extractors and pseudorandom generators
Journal of the ACM (JACM)
Dense quantum coding and quantum finite automata
Journal of the ACM (JACM)
Extracting all the randomness and reducing the error in Trevisan's extractors
Journal of Computer and System Sciences - STOC 1999
On the distribution of the number of roots of polynomials and explicit weak designs
Random Structures & Algorithms
Encryption against Storage-Bounded Adversaries from On-Line Strong Extractors
Journal of Cryptology
Optimal Randomizer Efficiency in the Bounded-Storage Model
Journal of Cryptology
The complexity of constructing pseudorandom generators from hard functions
Computational Complexity
Limits on the ability of quantum states to convey classical messages
Journal of the ACM (JACM)
Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Short seed extractors against quantum storage
Proceedings of the forty-first annual ACM symposium on Theory of computing
SIAM Journal on Computing
Randomness extraction via δ-biased masking in the presence of a quantum attacker
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Combinatorial bounds for list decoding
IEEE Transactions on Information Theory
On the power of quantum memory
IEEE Transactions on Information Theory
The Bounded-Storage Model in the Presence of a Quantum Adversary
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
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
Hi-index | 0.00 |
We show that Trevisan's extractor and its variants [22,19] are secure against bounded quantum storage adversaries. One instantiation gives the first such extractor to achieve an output length Θ(K-b), where K is the source's entropy and b the adversary's storage, together with a poly-logarithmic seed length. Another instantiation achieves a logarithmic key length, with a slightly smaller output length Θ((K-b)/Kγ) for any γ0. In contrast, the previous best construction [21] could only extract (K/b)1/15 bits. Some of our constructions have the additional advantage that every bit of the output is a function of only a polylogarithmic number of bits from the source, which is crucial for some cryptographic applications. Our argument is based on bounds for a generalization of quantum random access codes, which we call quantum functional access codes. This is crucial as it lets us avoid the local list-decoding algorithm central to the approach in [21], which was the source of the multiplicative overhead.