Weak coin flipping with small bias

Authors:
I. Kerenidis;A. Nayak
Affiliations:
Computer Science Division, University of California, Berkeley, CA;The Mathematical Sciences Research Institute, 1000 Centennial Drive, Berkeley, CA
Venue:
Information Processing Letters
Year:
2004

Citing 4
Cited 3

Why quantum bit commitment and ideal quantum coin tossing are impossible

PhysComp96 Proceedings of the fourth workshop on Physics and computation
Quantum bit escrow

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A new protocol and lower bounds for quantum coin flipping

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum computation and quantum information

Quantum computation and quantum information

Tight bounds for classical and quantum coin flipping

TCC'11 Proceedings of the 8th conference on Theory of cryptography
On the existence of loss-tolerant quantum oblivious transfer protocols

Quantum Information & Computation
Lower bounds for quantum oblivious transfer

Quantum Information & Computation

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper presents a quantum protocol that demonstrates that weak coin flipping with bias ≈ 0.239, less than 1/4, is possible. A bias of 1/4 was the smallest known, and followed from the strong coin flipping protocol of Ambainis in [33rd STOC, 2001] (also proposed by Spekkens and Rudolph [Phys. Rev. A 65 (2002) 012310]). Protocols with yet smaller bias ≈ 0.207 have independently been discovered by Ambainis (2001) and Spekkens and Rudolph [Phys. Rev. Lett. 89 (2002) 227901]. We also present an alternative Strong coin flipping protocol with bias 1/4 with analysis simpler than that of Ambainis [33rd STOC, 2001].