Provably Secure Experimental Quantum Bit-String Generation

L. P. Lamoureux, E. Brainis, D. Amans, J. Barrett, and S. Massar
Phys. Rev. Lett. 94, 050503 – Published 7 February 2005

Abstract

Coin tossing is a cryptographic task in which two parties who do not trust each other aim to generate a common random bit. Using classical communication this is impossible, but nontrivial coin tossing is possible using quantum communication. Here we consider the case when the parties do not want to toss a single coin, but many. This is called bit-string generation. We report the experimental generation of strings of coins which are provably more random than achievable using classical communication. The experiment is based on the “plug and play” scheme developed for quantum cryptography, and therefore well suited for long distance quantum communication.

  • Figure
  • Figure
  • Figure
  • Received 12 July 2004

DOI:https://doi.org/10.1103/PhysRevLett.94.050503

©2005 American Physical Society

Authors & Affiliations

L. P. Lamoureux1, E. Brainis2, D. Amans2, J. Barrett1, and S. Massar1

  • 1Laboratoire d’Information Quantique and Quantum Information and Communication, CP 165, Université Libre de Bruxelles, Avenue F. D. Roosevelt 50, 1050 Bruxelles, Belgium
  • 2Optique et Acoustique, CP 194/5, Université Libre de Bruxelles, Avenue F. D. Roosevelt 50, 1050 Bruxelles, Belgium

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 94, Iss. 5 — 11 February 2005

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×