How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
On the generation of cryptographically strong pseudorandom sequences
ACM Transactions on Computer Systems (TOCS)
Extractors and pseudorandom generators
Journal of the ACM (JACM)
Quantum computation and quantum information
Quantum computation and quantum information
Dense quantum coding and quantum finite automata
Journal of the ACM (JACM)
On the distribution of the number of roots of polynomials and explicit weak designs
Random Structures & Algorithms
Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Generating Quasi-Random Sequences From Slightly-Random Sources
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
SFCS '90 Proceedings of the 31st Annual 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
The operational meaning of min- and max-entropy
IEEE Transactions on Information Theory
Near-optimal extractors against quantum storage
Proceedings of the forty-second ACM symposium on Theory of computing
The Bounded-Storage Model in the Presence of a Quantum Adversary
IEEE Transactions on Information Theory
Robust device independent quantum key distribution
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |
We introduce a protocol through which a pair of quantum mechanical devices may be used to generate n bits that are ε-close in statistical distance from n uniformly distributed bits, starting from a seed of O(log n log 1/ε) uniform bits. The bits generated are certifiably random based only on a simple statistical test that can be performed by the user, and on the assumption that the devices do not communicate in the middle of each phase of the protocol. No other assumptions are placed on the devices' inner workings. A modified protocol uses a seed of O(log3 n) uniformly random bits to generate n bits that are poly-1(n)-indistinguishable from uniform even from the point of view of a quantum adversary who may have had prior access to the devices, and may be entangled with them.