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
Interaction in quantum communication and the complexity of set disjointness
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Weak coin flipping with small bias
Information Processing Letters
Toward a general theory of quantum games
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Can quantum mechanics help distributed computing?
ACM SIGACT News
Tight bounds for classical and quantum coin flipping
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Optimization of coherent attacks in generalizations of the BB84 quantum bit commitment protocol
Quantum Information & Computation
Quantum communication protocols using the vacuum
Quantum Information & Computation
Semi-loss-tolerant strong coin flipping protocol using EPR pairs
Quantum Information & Computation
On the existence of loss-tolerant quantum oblivious transfer protocols
Quantum Information & Computation
Lower bounds for quantum oblivious transfer
Quantum Information & Computation
| Hi-index | 0.00 |
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 our protocol is optimal for a certain type of quantum protocols.For arbitrary quantum protocols, we show that if a protocol achieves a bias of at most epsilon, it must use at least \Omega(\log \log \frac{1}{\epsilon}) 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.)