Near-optimal extractors against quantum storage

DOI10.1145/1806689.1806713zbMath1293.68128arXiv0911.4680OpenAlexW2077372202WikidataQ59792831 ScholiaQ59792831MaRDI QIDQ2875142

Anindya De, Thomas Vidick

Publication date: 13 August 2014

Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0911.4680

zbMATH Keywords

extractorsbounded quantum storagerandom access codes

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (4)

From graphs to keyed quantum hash functions ⋮ A modular framework for quantum-proof randomness extractors ⋮ Better short-seed quantum-proof extractors ⋮ Optimal bounds for parity-oblivious random access codes

This page was built for publication: Near-optimal extractors against quantum storage