Combinatorica - Theory of Computing
Unbiased bits from sources of weak randomness and probabilistic communication complexity
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
Extractors and pseudorandom generators
Journal of the ACM (JACM)
Quantum computation and quantum information
Quantum computation and quantum information
Quantum Entanglement and the Communication Complexity of the Inner Product Function
QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
Extractors with weak random seeds
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Limits on the ability of quantum states to convey classical messages
Journal of the ACM (JACM)
Strengths and Weaknesses of Quantum Fingerprinting
CCC '06 Proceedings of the 21st 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
Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity
SIAM Journal on Computing
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Randomness extraction via δ-biased masking in the presence of a quantum attacker
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Near-optimal extractors against quantum storage
Proceedings of the forty-second ACM symposium on Theory of computing
Universally composable privacy amplification against quantum adversaries
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
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
| Hi-index | 0.00 |
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two quantum adversaries store a bounded amount of information. Our main result is a two-source extractor secure against quantumadversaries, with parameters closely matching the classical case and tight in several instances. Moreover, the extractor is secure even if the adversaries share entanglement. The construction is the Chor-Goldreich [5] two-source inner product extractor and its multibit variant by Dodis et al. [9]. Previously, research in this area focused on the construction of seeded extractors secure against quantum adversaries; the multi-source setting poses new challenges, among which is the presence of entanglement that could potentially break the independence of the sources.