Provably Secure Experimental Quantum Bit-String Generation
- 7 February 2005
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 94 (5), 050503
- https://doi.org/10.1103/physrevlett.94.050503
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.Keywords
Other Versions
This publication has 8 references indexed in Scilit:
- Experimental Quantum Coin TossingPhysical Review Letters, 2005
- Security of quantum bit-string generationPhysical Review A, 2004
- Quantum coin tossing and bit-string generation in the presence of noisePhysical Review A, 2004
- Proposal for founding mistrustful quantum cryptography on coin tossingPhysical Review A, 2003
- Quantum Protocol for Cheat-Sensitive Weak Coin FlippingPhysical Review Letters, 2002
- Degrees of concealment and bindingness in quantum bit commitment protocolsPhysical Review A, 2001
- Why quantum bit commitment and ideal quantum coin tossing are impossiblePhysica D: Nonlinear Phenomena, 1998
- Automated ‘plug & play’ quantum key distributionElectronics Letters, 1998