Two-source extractors secure against quantum adversaries

DOI10.4086/TOC.2012.V008A021MaRDI QIDQ2913822zbMATH OpenOpenAlexFDO

Authors Roy Kasher, Julia Kempe

Publication date 27 September 2012

Published in Theory of Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4086/toc.2012.v008a021

zbMATH Keywords

entanglementextractorsquantum informationweak sources

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Two-source extractors secure against quantum adversaries
• Better short-seed quantum-proof extractors
• The Bounded-Storage Model in the Presence of a Quantum Adversary
• Near-optimal extractors against quantum storage
• Quantum-proof multi-source randomness extractors in the Markov model

Cites work

• Better short-seed quantum-proof extractors
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• Extractors with weak random seeds

Cited in

(7)

• Near-optimal extractors against quantum storage
• Quantum-resilient randomness extraction. (Invited talk)
• Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
• Two-source extractors secure against quantum adversaries
• On the Impossibility of Extracting Classical Randomness Using a Quantum Computer
• The Bounded-Storage Model in the Presence of a Quantum Adversary
• Two-sources randomness extractors in finite fields and in elliptic curves

This page was built for publication: Two-source extractors secure against quantum adversaries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2913822)