SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Quantum circuits with mixed states
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Why quantum bit commitment and ideal quantum coin tossing are impossible
PhysComp96 Proceedings of the fourth workshop on Physics and computation
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A proof of the security of quantum key distribution (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Interaction in quantum communication and the complexity of set disjointness
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Unconditional security in quantum cryptography
Journal of the ACM (JACM)
Quantum computation and quantum information
Quantum computation and quantum information
Perfectly concealing quantum bit commitment from any quantum one-way permutation
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Cryptographic distinguishability measures for quantum-mechanical states
IEEE Transactions on Information Theory
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Quantum coin-flipping-based authentication
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Exact Quantum Algorithms for the Leader Election Problem
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.01 |
We present a new protocol and two lower bounds for quantum coin flipping. In our protocol, no dishonest party can achieve one outcome with probability more than 0.75. Then we show that out protocol is optimal among 3-round protocols of a certain form.For arbitrary quantum protocols, we show that if a protocol achieves a bias of at most ε, it must use at least Ω(log log 1ε) rounds of communication. This implies that the parallel repetition fails for quantum coin flipping. (The bias of a protocol cannot be arbitrarily decreased by running several copies of it in parallel.)