Certifiable quantum dice: or, true random number generation secure against quantum adversaries

We introduce a protocol through which a pair of quantum mechanical devices may be used to generate n bits that are ε-close in statistical distance from n uniformly distributed bits, starting from a seed of O(log n log 1/ε) uniform bits. The bits generated are certifiably random based only on a simple statistical test that can be performed by the user, and on the assumption that the devices do not communicate in the middle of each phase of the protocol. No other assumptions are placed on the devices' inner workings. A modified protocol uses a seed of O(log3 n) uniformly random bits to generate n bits that are poly-1(n)-indistinguishable from uniform even from the point of view of a quantum adversary who may have had prior access to the devices, and may be entangled with them.

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

[2]  Ronen Shaltiel,et al.  Recent Developments in Explicit Constructions of Extractors , 2002, Bull. EATCS.

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

[4]  Manuel Blum,et al.  How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

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

[6]  Andrew Chi-Chih Yao,et al.  Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[7]  Andris Ambainis,et al.  Dense quantum coding and quantum finite automata , 2002, JACM.

[8]  David Zuckerman,et al.  General weak random sources , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[9]  Stefano Pironio,et al.  Security of practical private randomness generation , 2011, 1111.6056.

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

[11]  Robert König,et al.  The Operational Meaning of Min- and Max-Entropy , 2008, IEEE Transactions on Information Theory.

[12]  Amnon Ta-Shma.  Short Seed Extractors against Quantum Storage , 2011, SIAM J. Comput..

[13]  Miklos Santha,et al.  Generating Quasi-Random Sequences from Slightly-Random Sources (Extended Abstract) , 1984, FOCS.

[14]  Ran Raz,et al.  On the distribution of the number of roots of polynomials and explicit weak designs , 2003, Random Struct. Algorithms.

[15]  Anindya De,et al.  Near-optimal extractors against quantum storage , 2010, STOC '10.

[16]  Adrian Kent,et al.  Private randomness expansion with untrusted devices , 2010, 1011.4474.

[17]  Stefano Pironio,et al.  Random numbers certified by Bell’s theorem , 2009, Nature.

[18]  Albert Einstein,et al.  Can Quantum-Mechanical Description of Physical Reality Be Considered Complete? , 1935 .

[19]  A. Shimony,et al.  Proposed Experiment to Test Local Hidden Variable Theories. , 1969 .

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

[21]  B. E. Eckbo,et al.  Appendix , 1826, Epilepsy Research.

[22]  Joseph F. Traub,et al.  Algorithms and Complexity: New Directions and Recent Results , 1976 .

[23]  Adi Shamir,et al.  On the generation of cryptographically strong pseudorandom sequences , 1981, TOCS.

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

[25]  Serge Fehr,et al.  Security and Composability of Randomness Expansion from Bell Inequalities , 2011, ArXiv.

[26]  Russell Impagliazzo,et al.  Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification , 2006, FOCS.

[27]  Enkatesan G Uruswami.  Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes , 2008 .

[28]  Roger Colbeck,et al.  Quantum And Relativistic Protocols For Secure Multi-Party Computation , 2009, 0911.3814.

[29]  R. Mcweeny.  On the Einstein-Podolsky-Rosen Paradox , 2000 .

[30]  Renato Renner,et al.  Free Randomness Amplification , 2011 .