Quantum-proof multi-source randomness extractors in the Markov model

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 and the security of only some types of extractors was shown.

[1]  R. Renner,et al.  Quantum Conditional Mutual Information and Approximate Markov Chains , 2014, Communications in Mathematical Physics.

[2]  Jaikumar Radhakrishnan,et al.  Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators , 2000, SIAM J. Discret. Math..

[3]  Karol Horodecki,et al.  Robust Device-Independent Randomness Amplification with Few Devices , 2013, 1310.4544.

[4]  Ran Raz,et al.  Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography , 2008, SIAM J. Comput..

[5]  Anindya De,et al.  Trevisan's Extractor in the Presence of Quantum Side Information , 2009, SIAM J. Comput..

[6]  Mario Berta,et al.  Quantum Bilinear Optimization , 2015, SIAM J. Optim..

[7]  Mario Berta,et al.  Quantum-Proof Randomness Extractors via Operator Space Theory , 2014, IEEE Transactions on Information Theory.

[8]  Xin Li,et al.  Improved Constructions of Two-Source Extractors , 2015, Electron. Colloquium Comput. Complex..

[9]  Xiaodi Wu,et al.  Multi-Source Randomness Extractors Against Quantum Side Information, and their Applications , 2014, Electron. Colloquium Comput. Complex..

[10]  Robert König,et al.  Universally Composable Privacy Amplification Against Quantum Adversaries , 2004, TCC.

[11]  Masahito Hayashi,et al.  More efficient privacy amplification with less random seeds , 2013, 2015 IEEE International Symposium on Information Theory (ISIT).

[12]  Umesh V. Vazirani,et al.  Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources , 1987, Comb..

[13]  Wolfgang Mauerer,et al.  A modular framework for randomness extraction based on Trevisan's construction , 2012, ArXiv.

[14]  A. Winter,et al.  Communications in Mathematical Physics Structure of States Which Satisfy Strong Subadditivity of Quantum Entropy with Equality , 2022 .

[15]  Barbara M. Terhal,et al.  The Bounded-Storage Model in the Presence of a Quantum Adversary , 2008, IEEE Transactions on Information Theory.

[16]  A. Winter.  ‘‘Extrinsic’’ and ‘‘Intrinsic’’ Data in Quantum Measurements: Asymptotic Convex Decomposition of Positive Operator Valued Measures , 2001, quant-ph/0109050.

[17]  M. Plesch,et al.  Device-independent randomness amplification with a single device , 2013, 1305.0990.

[18]  Karol Horodecki,et al.  Realistic noise-tolerant randomness amplification using finite number of devices , 2016, Nature Communications.

[19]  Rodrigo Gallego,et al.  Robust amplification of Santha-Vazirani sources with three devices , 2015 .

[20]  Julia Kempe,et al.  Two-Source Extractors Secure Against Quantum Adversaries , 2010, Theory Comput..

[21]  I. Chuang,et al.  Quantum Computation and Quantum Information: Introduction to the Tenth Anniversary Edition , 2010 .

[22]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[23]  Yaoyun Shi,et al.  Physical Randomness Extractors: Generating Random Numbers with Minimal Assumptions , 2014, 1402.4797.

[24]  Marco Tomamichel,et al.  Duality Between Smooth Min- and Max-Entropies , 2009, IEEE Transactions on Information Theory.

[25]  Marco Tomamichel,et al.  Tight finite-key analysis for quantum cryptography , 2011, Nature Communications.

[26]  Miklos Santha,et al.  Generating Quasi-random Sequences from Semi-random Sources , 1986, J. Comput. Syst. Sci..

[27]  Leonid A. Levin,et al.  Pseudo-random generation from one-way functions , 1989, STOC '89.

[28]  Valerio Scarani.  The device-independent outlook on quantum physics (lecture notes on the power of Bell's theorem) , 2013 .

[29]  Xin Li,et al.  Three-Source Extractors for Polylogarithmic Min-Entropy , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[30]  L. Fortnow,et al.  Recent Developments in Explicit Constructions of Extractors , 2002, Bull. EATCS.

[31]  David Zuckerman,et al.  Explicit two-source extractors and resilient functions , 2016, Electron. Colloquium Comput. Complex..

[32]  Renato Renner,et al.  The impossibility of non-signaling privacy amplification , 2009, Theor. Comput. Sci..

[33]  Luca Trevisan,et al.  Extractors and pseudorandom generators , 2001, JACM.

[34]  Ran Raz,et al.  Extractors with weak random seeds , 2005, STOC '05.

[35]  Ran Raz,et al.  Improved Randomness Extraction from Two Independent Sources , 2004, APPROX-RANDOM.

[36]  Renato Renner,et al.  Security of quantum key distribution , 2005, Ausgezeichnete Informatikdissertationen.

[37]  Anup Rao,et al.  Extractors for a constant number of polynomially small min-entropy independent sources , 2006, STOC '06.

[38]  Miguel Navascués,et al.  Robust and versatile black-box certification of quantum devices. , 2014, Physical review letters.

[39]  Umesh V. Vazirani,et al.  Classical command of quantum systems , 2013, Nature.