Parallel Device-Independent Quantum Key Distribution

Preprint English OPEN
Jain, Rahul ; Miller, Carl A. ; Shi, Yaoyun (2017)
  • Subject: Quantum Physics

A prominent application of quantum cryptography is the distribution of cryptographic keys that are provably secure. Recently, such security proofs were extended by Vazirani and Vidick (Physical Review Letters, 113, 140501, 2014) to the device-independent (DI) scenario, where the users do not need to trust the integrity of the underlying quantum devices. The protocols analyzed by them and by subsequent authors all require a sequential execution of N multiplayer games, where N is the security parameter. In this work, we prove unconditional security of a protocol where all games are executed in parallel. Besides decreasing the number of time-steps necessary for key generation, this result reduces the security requirements for DI-QKD by allowing arbitrary information leakage of each user's inputs within his or her lab. To the best of our knowledge, this is the first parallel security proof for a fully device-independent QKD protocol. Our protocol tolerates a constant level of device imprecision and achieves a linear key rate.
  • References (36)
    36 references, page 1 of 4

    [1] David Adrian, Karthikeyan Bhargavan, Zakir Durumeric, Pierrick Gaudry, Matthew Green 0001, J. Alex Halderman, Nadia Heninger, Drew Springall, Emmanuel Thom´e, Luke Valenta, Benjamin VanderSloot, Eric Wustrow, Santiago Zanella B´eguelin, and Paul Zimmermann. Imperfect forward secrecy: How diffie-hellman fails in practice. In Indrajit Ray, Ninghui Li, and Christopher Kruegel, editors, Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12-6, 2015, pages 5-17. ACM, 2015.

    [2] Rotem Arnon-Friedman, Renato Renner, and Thomas Vidick. Simple and tight deviceindependent security proofs. arXiv:1607.01797, 2016.

    [3] Mohammad Bavairan, Thomas Vidick, and Henry Yuen. Anchoring games for parallel repetition, 2015. arXiv:1509.07466.

    [4] Michael Ben-Or, Michal Horodecki, Debbie W Leung, Dominic Mayers, and Jonathan Oppenheim. The universal composable security of quantum key distribution. In Theory of Cryptography Conference, pages 386-406. Springer, 2005.

    [5] C. H. Bennett and G. Brassard. Quantum cryptography: Public key distribution and coin tossing. In Proceedings of IEEE international Conference on Computers, Systems and Signal Processing, Bangalore, India, page 175, New York, 1984. IEEE Press.

    [6] Andr´e Chailloux and Giannicola Scarpa. Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost, pages 296-307. Springer Berlin Heidelberg, Berlin, Heidelberg, 2014.

    [7] Kai-Min Chung, Xiaodi Wu, and Henry Yuen. Parallel repetition for entangled k-player games via fast quantum search. In Proceedings of the 30th Conference on Computational Complexity, pages 512-536. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2015.

    [8] Roger Colbeck and Adrian Kent. Private randomness expansion with untrusted devices. Journal of Physics A: Mathematical and Theoretical, 44(9):095305, 2011.

    [9] Aymard de Touzalin, Charles Marcus, Freeke Heijman, Ignacio Richard Murray, , and Tommaso Calarco. Quantum http://qurope.eu/system/files/u7/93056_Quantum%20Manifesto_WEB.pdf.

    [10] W. Diffie and M. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22(6):644-654, November 1976.

  • Metrics
    No metrics available
Share - Bookmark