A modular framework for quantum-proof randomness extractors
From MaRDI portal
Publication:2400201
DOI10.1007/s10773-016-3137-1zbMath1371.81082OpenAlexW2518384616MaRDI QIDQ2400201
Jingyi Cui, Yipeng Liu, Jian-Sheng Guo
Publication date: 28 August 2017
Published in: International Journal of Theoretical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10773-016-3137-1
Quantum computation (81P68) Error probability in coding theory (94B70) Quantum algorithms and complexity in the theory of computing (68Q12)
Cites Work
- Unnamed Item
- Unnamed Item
- Randomness is linear in space
- Extractors from Reed-Muller codes
- Near-optimal extractors against quantum storage
- Certifiable quantum dice
- More Efficient Privacy Amplification With Less Random Seeds via Dual Universal Hash Function
- Trevisan's Extractor in the Presence of Quantum Side Information
- SECURITY OF QUANTUM KEY DISTRIBUTION
- Simple extractors for all min-entropies and a new pseudorandom generator
- Extractors
- The Bounded-Storage Model in the Presence of a Quantum Adversary
- Privacy Amplification by Public Discussion
- The Operational Meaning of Min- and Max-Entropy
- True Random Number Generators Secure in a Changing Environment
- Leftover Hashing Against Quantum Side Information
- Sampling of Min-Entropy Relative to Quantum Knowledge
- Quantum-Proof Randomness Extractors via Operator Space Theory
- Extractors and pseudorandom generators
This page was built for publication: A modular framework for quantum-proof randomness extractors
