skip to main content
10.1145/2213977.2213984acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
research-article

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

Published:19 May 2012Publication History

ABSTRACT

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.

Skip Supplemental Material Section

Supplemental Material

stoc_1b_2.mp4

References

  1. A. Ambainis, A. Nayak, A. Ta-Shma, and U. Vazirani. Dense quantum coding and quantum finite automata. Journal of the ACM, 49(4):496--511, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. J. S. Bell. On the Einstein-Podolsky-Rosen paradox. Physics, 1:195--200, 1964.Google ScholarGoogle Scholar
  3. J. S. Bell. On the problem of hidden variables in quantum theory. Rev. Mod. Phys., 38:447--452, 1966.Google ScholarGoogle ScholarCross RefCross Ref
  4. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput., 13:850--864, November 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt. Proposed experiment to test local hidden-variable theories. Phys. Rev. Lett., 23:880--884, 1969.Google ScholarGoogle Scholar
  6. R. Colbeck. Quantum And Relativistic Protocols For Secure Multi-Party Computation. PhD thesis, Trinity College, University of Cambridge, Nov. 2009.Google ScholarGoogle Scholar
  7. R. Colbeck and A. Kent. Private randomness expansion with untrusted devices. Journal of Physics A: Mathematical and Theoretical, 44(9):095305, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  8. R. Colbeck and R. Renner. Free randomness amplification. arXiv:1105.3195, 2011.Google ScholarGoogle Scholar
  9. A. De, C. Portmann, R. Renner, and T. Vidick. Trevisan's extractor in the presence of quantum side information. CoRR, abs/0912.5, 2009.Google ScholarGoogle Scholar
  10. A. De and T. Vidick. Near-optimal extractors against quantum storage. In Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pages 161--170, New York, NY, USA, 2010. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. A. Einstein, P. Podolsky, and N. Rosen. Can quantum-mechanical description of physical reality be considered complete? Phys. Rev., 47:777--780, 1935.Google ScholarGoogle Scholar
  12. S. Fehr, R. Gelles, and C. Schaffner. Security and composability of randomness expansion from Bell inequalities. Technical report arXiv:1111.6052, 2011.Google ScholarGoogle Scholar
  13. D. Gavinsky, J. Kempe, I. Kerenidis, R. Raz, and R. de Wolf. Exponential separation for one-way quantum communication complexity, with applications to cryptography. SIAM Journal of Computing, 38(5):1695--1708, 2008. Preliminary version in phProc. of STOC 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. V. Guruswami, C. Umans, and S. Vadhan. Unbalanced expanders and randomness extractors from parvaresh-vardy codes. In Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity, CCC '07, pages 96--108, Washington, DC, USA, 2007. IEEE Computer Society. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. T. Hartman and R. Raz. On the distribution of the number of roots of polynomials and explicit weak designs. Random Structures and Algorithms, 23(3):235--263, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. R. Impagliazzo, R. Jaiswal, and V. Kabanets. Approximately list-decoding direct product codes and uniform hardness amplification. In Foundations of Computer Science, 2006. FOCS '06. 47th Annual IEEE Symposium on, pages 187 --196, oct. 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. A. Knuth, D. Yao. Algorithms and Complexity: New Directions and Recent Results, Chapter The complexity of nonuniform random number generation. Academic Press, 1976.Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. R. König, R. Renner, and C. Schaffner. The operational meaning of min- and max-entropy. IEEE Transactions on Information Theory, 55(9):4337--4347, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. R. König and B. Terhal. The bounded storage model in presence of a quantum adversary. IEEE Transactions on Information Theory, 54(2):749--762, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. M. Nielsen and I. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. S. Pironio, A. Acin, S. Massar, A. B. De La Giroday, D. N. Matsukevich, P. Maunz, S. Olmschenk, D. Hayes, L. Luo, T. A. Manning, and et al. Random numbers certified by Bell's theorem. Nature, 464(7291):10, 2009.Google ScholarGoogle Scholar
  22. S. Pironio and S. Massar. Security of practical private randomness generation. Technical report arXiv:1111.6056, 2011.Google ScholarGoogle Scholar
  23. R. Renner. Security of Quantum Key Distribution. PhD thesis, Swiss Federal Institute of Technology Zurich, Sept. 2005.Google ScholarGoogle Scholar
  24. M. Santha and U. V. Vazirani. Generating quasi-random sequences from slightly-random sources. In Proceedings of the 25th Annual Symposium on Foundations of Computer Science, pages 434--440, Washington, DC, USA, 1984. IEEE Computer Society. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. R. Shaltiel. Recent developments in explicit constructions of extractors. Bulletin of the European Association for Theoretical Computer Science, 77:67--95, June 2002.Google ScholarGoogle Scholar
  26. A. Shamir. On the generation of cryptographically strong pseudorandom sequences. ACM Trans. Comput. Syst., 1:38--44, February 1983. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. A. Ta-Shma. Short seed extractors against quantum storage. In Proceedings of the 41st annual ACM symposium on Theory of computing, STOC '09, pages 401--408, New York, NY, USA, 2009. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. G. Taylor and G. Cox. Behind intel's new random-number generator. IEEE Spectrum, September 2011.Google ScholarGoogle Scholar
  29. L. Trevisan. Extractors and pseudorandom generators. J. ACM, 48:860--879, July 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. A. C. Yao. Theory and application of trapdoor functions. In Proceedings of the 23rd IEEE Annual Symposium on Foundations of Computer Science (FOCS), SFCS '82, pages 80--91, Washington, DC, USA, 1982. Google ScholarGoogle ScholarCross RefCross Ref
  31. D. Zuckerman. General weak random sources. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pages 534--543. IEEE Comput. Soc. Press, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

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

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        STOC '12: Proceedings of the forty-fourth annual ACM symposium on Theory of computing
        May 2012
        1310 pages
        ISBN:9781450312455
        DOI:10.1145/2213977

        Copyright © 2012 ACM

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 19 May 2012

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate1,469of4,586submissions,32%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!