Skip to main content
SpringerLink
Log in

Two-Source Extractors Secure against Quantum Adversaries

  • Conference paper
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (RANDOM 2010, APPROX 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6302))

Abstract

We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two quantum adversaries store a bounded amount of information. Our main result is a two-source extractor secure against quantum adversaries, with parameters closely matching the classical case and tight in several instances. Moreover, the extractor is secure even if the adversaries share entanglement. The construction is the Chor-Goldreich [5] two-source inner product extractor and its multi-bit variant by Dodis et al. [9]. Previously, research in this area focused on the construction of seeded extractors secure against quantum adversaries; the multi-source setting poses new challenges, among which is the presence of entanglement that could potentially break the independence of the sources.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bell, J.S.: On the Einstein-Podolsky-Rosen paradox. Physics 1, 195–200 (1964)

    Google Scholar 

  2. Ben-Aroya, A., Ta-Shma, A.: Better short-seed extractors against quantum knowledge. CoRR abs/1004.3737 (2010)

    Google Scholar 

  3. Bennett, C.H., Wiesner, S.J.: Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. Phys. Rev. Lett. 69(20), 2881–2884 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bourgain, J.: More on the sum-product phenomenon in prime fields and its applications. IJNT 1(1), 1–32 (2005)

    MATH  MathSciNet  Google Scholar 

  5. Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput. 17(2), 230–261 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  6. Cleve, R., van Dam, W., Nielsen, M., Tapp, A.: Quantum entanglement and the communication complexity of the inner product function. In: Williams, C.P. (ed.) QCQC 1998. LNCS, vol. 1509, pp. 61–74. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  7. De, A., Portmann, C., Vidick, T., Renner, R.: Trevisan’s extractor in the presence of quantum side information. CoRR abs/0912.5514 (2009)

    Google Scholar 

  8. De, A., Vidick, T.: Near-optimal extractors against quantum storage. In: Proc. of STOC (2010) (to appear)

    Google Scholar 

  9. Dodis, Y., Elbaz, A., Oliveira, R., Raz, R.: Improved randomness extraction from two independent sources. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol. 3122, pp. 334–344. Springer, Heidelberg (2004)

    Google Scholar 

  10. Dodis, Y., Oliveira, R.: On extracting private randomness over a public channel. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. 2764, pp. 252–263. Springer, Heidelberg (2003)

    Google Scholar 

  11. Fehr, S., Schaffner, C.: Randomness extraction via delta-biased masking in the presence of a quantum attacker. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 465–481. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Gavinsky, D., Kempe, J., Kerenidis, I., Raz, R., de Wolf, R.: Exponential separation for one-way quantum communication complexity, with applications to cryptography. SIAM J. Comput. 38(5), 1695–1708 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  13. Gavinsky, D., Kempe, J., Regev, O., de Wolf, R.: Bounded-error quantum state identification and exponential separations in communication complexity. SIAM J. Comput. 39(1), 1–24 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  14. Gavinsky, D., Kempe, J., de Wolf, R.: Strengths and weaknesses of quantum fingerprinting. In: Proc. of CCC, pp. 288–298 (2006)

    Google Scholar 

  15. Goldreich, O.: Three xor-lemmas - an exposition. ECCC 2(56) (1995)

    Google Scholar 

  16. Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions (extended abstracts). In: Proc. of STOC, pp. 12–24 (1989)

    Google Scholar 

  17. Kalai, Y.T., Li, X., Rao, A.: 2-source extractors under computational assumptions and cryptography with defective randomness. In: Proc. of FOCS, pp. 617–626 (2009)

    Google Scholar 

  18. Kasher, R., Kempe, J.: Two-source extractors secure against quantum adversaries. CoRR abs/1005.0512 (2009)

    Google Scholar 

  19. König, R., Maurer, U.M., Renner, R.: On the power of quantum memory. IEEE Trans. Inform. Theory 51(7), 2391–2401 (2005)

    Article  MathSciNet  Google Scholar 

  20. König, R.T., Terhal, B.M.: The bounded-storage model in the presence of a quantum adversary. IEEE Trans. Inform. Theory 54(2), 749–762 (2008)

    Article  MathSciNet  Google Scholar 

  21. Nayak, A., Salzman, J.: Limits on the ability of quantum states to convey classical messages. Journal of the ACM 53(1), 184–206 (2006)

    Article  MathSciNet  Google Scholar 

  22. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information, 1st edn. Cambridge University Press, Cambridge (2000)

    MATH  Google Scholar 

  23. Raz, R.: Extractors with weak random seeds. In: Proc. of STOC, pp. 11–20 (2005)

    Google Scholar 

  24. Renner, R.: Security of Quantum Key Distribution. Ph.D. thesis, ETH Zurich (September 2005), http://arxiv.org/abs/quant-ph/0512258

  25. Renner, R., König, R.: Universally composable privacy amplification against quantum adversaries. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 407–425. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  26. Santha, M., Vazirani, U.V.: Generating quasi-random sequences from slightly-random sources (extended abstract). In: Proc. of FOCS, pp. 434–440 (1984)

    Google Scholar 

  27. Shaltiel, R.: Recent developments in explicit constructions of extractors. Bulletin of the EATCS 77, 67–95 (2002)

    MATH  MathSciNet  Google Scholar 

  28. Ta-Shma, A.: Short seed extractors against quantum storage. In: Proc. of STOC, pp. 401–408 (2009)

    Google Scholar 

  29. Tomamichel, M., Schaffner, C., Smith, A., Renner, R.: Leftover hashing against quantum side information. In: Proc. of ISIT (to appear, 2010)

    Google Scholar 

  30. Trevisan, L.: Extractors and pseudorandom generators. Journal of the ACM 48(4), 860–879 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  31. Vazirani, U.V.: Strong communication complexity or generating quasirandom sequences form two communicating semi-random sources. Combinatorica 7(4), 375–392 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  32. de Wolf, R.: Personal communication (2010)

    Google Scholar 

  33. Yao, A.C.C.: Theory and applications of trapdoor functions (extended abstract). In: Proc. of FOCS, pp. 80–91 (1982)

    Google Scholar 

  34. Zuckerman, D.: General weak random sources. In: Proc. of FOCS, pp. 534–543 (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Tel Aviv University,  

    Roy Kasher & Julia Kempe

Authors
  1. Roy Kasher
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Julia Kempe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universitat Politecnica de Catalunya, Departament de Llenguatges i Sistemes Informatics, Campus Nord - Ed Omega, Desp. 235, Jordi Girona, 1-3, 08034, Barcelona, Spain

    Maria Serna

  2. Department of Computer Science, University of Haifa, Mount Carmel, 31905, Haifa, Israel

    Ronen Shaltiel

  3. Department of Computer Science, University of Kiel, Olshausenstrasse 40, 24098, Kiel, Germany

    Klaus Jansen

  4. University of Geneva, Centre Universitaire d’Informatique, Battelle Bat. A, 7 rte de Drize, 1227, Carouge, Switzerland

    José Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kasher, R., Kempe, J. (2010). Two-Source Extractors Secure against Quantum Adversaries. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. RANDOM APPROX 2010 2010. Lecture Notes in Computer Science, vol 6302. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15369-3_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15369-3_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15368-6

  • Online ISBN: 978-3-642-15369-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation