TY - GEN
T1 - Quantum-proof multi-source randomness extractors in the Markov model
AU - Arnon-Friedman, Rotem
AU - Portmann, Christopher
AU - Scholz, Volkher B.
N1 - This project was supported by the European Research Council (ERC) via grant No. 258932, by the Swiss National Science Foundation (SNSF) via the National Centre of Competence in Research “QSIT”, by the European Commission via the project “RAQUEL”, and by the US Air Force Office of Scientific Research (AFOSR) via grant FA9550-16-1-0245. †VBS was also supported by the EC through grants ERC QUTE (NR 197868). The majority of this work was carried out while VBS was at ETH. We thank Mario Berta, Omar Fawzi and Thomas Vidick for helpful comments and discussions.
PY - 2016/9/1
Y1 - 2016/9/1
N2 - Randomness extractors, widely used in classical and quantum cryptography and other fields of computer science, e.g., derandomization, are functions which generate almost uniform randomness from weak sources of randomness. In the quantum setting one must take into account the quantum side information held by an adversary which might be used to break the security of the extractor. In the case of seeded extractors the presence of quantum side information has been extensively studied. For multi-source extractors one can easily see that high conditional min-entropy is not sufficient to guarantee security against arbitrary side information, even in the classical case. Hence, the interesting question is under which models of (both quantum and classical) side information multi-source extractors remain secure. In this work we suggest a natural model of side information, which we call the Markov model, and prove that any multi-source extractor remains secure in the presence of quantum side information of this type (albeit with weaker parameters). This improves on previous results in which more restricted models were considered or the security of only some types of extractors was shown.
AB - Randomness extractors, widely used in classical and quantum cryptography and other fields of computer science, e.g., derandomization, are functions which generate almost uniform randomness from weak sources of randomness. In the quantum setting one must take into account the quantum side information held by an adversary which might be used to break the security of the extractor. In the case of seeded extractors the presence of quantum side information has been extensively studied. For multi-source extractors one can easily see that high conditional min-entropy is not sufficient to guarantee security against arbitrary side information, even in the classical case. Hence, the interesting question is under which models of (both quantum and classical) side information multi-source extractors remain secure. In this work we suggest a natural model of side information, which we call the Markov model, and prove that any multi-source extractor remains secure in the presence of quantum side information of this type (albeit with weaker parameters). This improves on previous results in which more restricted models were considered or the security of only some types of extractors was shown.
UR - https://www.scopus.com/pages/publications/84990207048
U2 - 10.4230/LIPIcs.TQC.2016.2
DO - 10.4230/LIPIcs.TQC.2016.2
M3 - منشور من مؤتمر
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 11th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2016
A2 - Broadbent, Anne
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 11th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2016
Y2 - 27 September 2016 through 29 September 2016
ER -