Papers
Topics
Authors
Recent
Search
2000 character limit reached

Seedless extractors for device-independent quantum cryptography

Published 7 Mar 2024 in quant-ph | (2403.04713v2)

Abstract: Device-independent (DI) quantum cryptography aims at providing secure cryptography with minimal trust in, or characterisation of, the underlying quantum devices. A key step in DI protocols is randomness extraction (or privacy amplification), which typically requires a \textit{seed} of additional bits with sufficient entropy and statistical independence from any bits generated during the protocol. In this work, we propose a method for extraction in DI protocols that does not require a seed and is secure against computationally unbounded quantum adversaries. The core idea is to use the Bell violation of the raw data, rather than its min-entropy, as the extractor promise. We present a complete security proof in a model where the experiment uses memoryless measurement devices acting on an arbitrary joint (across all rounds) state. Our results mark a first step in this alternative, seedless, approach to extraction in DI protocols.

Authors (2)
Definition Search Book Streamline Icon: https://streamlinehq.com
References (49)
  1. Device-independent security of quantum cryptography against collective attacks. Physical Review Letters, 98(23):230501, 2007.
  2. Device-independent quantum key distribution secure against collective attacks. New Journal of Physics, 11(4):045021, 2009.
  3. John S Bell. On the Einstein Podolsky Rosen paradox. Physics Physique Fizika, 1(3):195, 1964.
  4. Quantum cryptography with imperfect apparatus. In Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No. 98CB36280), pages 503–509. IEEE, 1998.
  5. Fully device independent quantum key distribution. Communications of the ACM, 62(4):133–133, 2019.
  6. Advances in device-independent quantum key distribution. npj Quantum Information, 9(1):10, 2023.
  7. Experimental quantum key distribution certified by Bell’s theorem. Nature, 607(7920):682–686, 2022.
  8. Renato Renner. Security of quantum key distribution. International Journal of Quantum Information, 6(01):1–127, 2008.
  9. Device independent security of quantum key distribution from monogamy-of-entanglement games. arXiv preprint arXiv:2312.04079, 2023.
  10. Private randomness expansion with untrusted devices. Journal of Physics A: Mathematical and Theoretical, 44(9):095305, 2011.
  11. Certified randomness in quantum physics. Nature, 540(7632):213–219, 2016.
  12. Free randomness can be amplified. Nature Physics, 8(6):450–453, 2012.
  13. Device-independent oblivious transfer from the bounded-quantum-storage-model and computational assumptions. New Journal of Physics, 25(5):053019, 2023.
  14. Device-independent verifiable blind quantum computation. arXiv preprint arXiv:1502.02563, 2015.
  15. Srijita Kundu and Ernest Y-Z Tan. Device-independent uncloneable encryption. arXiv preprint arXiv:2210.01058, 2022.
  16. Quantum-proof multi-source randomness extractors in the markov model. arXiv preprint arXiv:1510.06743, 2015.
  17. Randomness extraction from somewhat dependent sources. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2022.
  18. Xin Li. Two source extractors for asymptotically optimal entropy, and (many) more. arXiv preprint arXiv:2303.06802, 2023.
  19. Postprocessing for quantum random-number generators: Entropy evaluation and randomness extraction. Physical Review A, 87(6):062327, 2013.
  20. Cryptomite: A versatile and user-friendly library of randomness extractors. arXiv preprint arXiv:2402.09481, 2024.
  21. Proposed experiment to test local hidden-variable theories. Physical Review Letters, 23(15):880, 1969.
  22. All the self-testings of the singlet for two binary measurements. New Journal of Physics, 18(2):025021, 2016.
  23. Generating quasi-random sequences from semi-random sources. Journal of computer and system sciences, 33(1):75–87, 1986.
  24. Von Neumann. Various techniques used in connection with random digits. Notes by GE Forsythe, pages 36–38, 1951.
  25. Deterministic extractors for affine sources over large fields. Combinatorica, 28(4):415–440, 2008.
  26. Deterministic extractors for bit-fixing sources by obtaining an independent seed. SIAM Journal on Computing, 36(4):1072–1094, 2006.
  27. Deterministic extractors for small-space sources. In Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pages 691–700, 2006.
  28. Optimal deterministic extractors for generalized santha-vazirani sources. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018.
  29. Xin Li. Improved two-source extractors, and affine extractors for polylogarithmic entropy. In 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pages 168–177. IEEE, 2016.
  30. Extractors for sumset sources. In Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, pages 299–311, 2016.
  31. Eshan Chattopadhyay. Recent advances in randomness extraction. Entropy, 24(7):880, 2022.
  32. Nonlocality and communication complexity. Reviews of modern physics, 82(1):665, 2010.
  33. Lluis Masanes. Universally composable privacy amplification from causality constraints. Physical Review Letters, 102(14):140501, 2009.
  34. Full randomness from arbitrarily deterministic events. Nature Communications, 4(1):2654, 2013.
  35. Device-independent quantum key distribution with arbitrarily small nonlocality. arXiv preprint arXiv:2309.09650, 2023.
  36. Máté Farkas. Unbounded device-independent quantum key rates from arbitrarily small non-locality. arXiv preprint arXiv:2310.08635, 2023.
  37. Randomness amplification under minimal fundamental assumptions on the devices. Physical Review Letters, 117(23):230501, 2016.
  38. Practical no-signalling proof randomness amplification using Hardy paradoxes and its experimental implementation. arXiv preprint arXiv:1810.11648, 2018.
  39. Device-independent randomness amplification and privatization. IEEE Journal on Selected Areas in Information Theory, 1(2):568–584, 2020.
  40. No-signaling-proof randomness extraction from public weak sources. arXiv preprint arXiv:2108.08819, 2021.
  41. Practical randomness amplification and privatisation with implementations on quantum computers. Quantum, 7:969, 2023.
  42. Secure device-independent quantum key distribution with causally independent measurement devices. Nature Communications, 2(1):238, 2011.
  43. Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pages 136–145. IEEE, 2001.
  44. On the imbedding of normed rings into the ring of operators in Hilbert space. Matematicheskii Sbornik, 12(2):197–217, 1943.
  45. Efficient seedless extractors from linear error-correcting codes. Article in preparation, 2024.
  46. Bell tests with min-entropy sources. arXiv preprint arXiv:1304.3598, 2013.
  47. A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations. New Journal of Physics, 10(7):073013, 2008.
  48. Full security of quantum key distribution from no-signaling constraints. IEEE Transactions on Information Theory, 60(8):4973–4986, 2014.
  49. Improved device-independent randomness expansion rates using two sided randomness. New Journal of Physics, 25(9):093035, 2023.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 2 tweets with 16 likes about this paper.