Optimal bounds for quantum bit commitment

Printer-friendly versionSend by emailPDF version
Date: 
2011-10-22
Author(s): 

A. Chailloux, I. Kerenidis

Reference: 

Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2011)

Bit commitment is a fundamental cryptographic primitive with numerous applications. Quantum information allows for bit commitment schemes in the information theoretic setting where no dishonest party can perfectly cheat. The previously best-known quantum protocol by Ambainis achieved a cheating probability of at most 3/4, while Kitaev showed that no quantum protocol can have cheating probability less than 1/sqrt{2}. Closing this gap has since been an important and open question. In this paper, the authors provide the optimal bound for quantum bit commitment.