Protocols for Quantum Weak Coin Flipping

arXiv:2402.15855v1 Announce Type: cross
Abstract: Weak coin flipping is an important cryptographic primitive -- it is the strongest known secure two-party computation primitive that classically becomes secure only under certain assumptions (e.g. computational hardness), while quantumly there exist protocols that achieve arbitrarily close to perfect security. This breakthrough result was established by Mochon in 2007 [arXiv:0711.4114]. However, his proof relied on the existence of certain unitary operators which was established by a non-constructive argument. Consequently, explicit protocols have remained elusive. …

arxiv computation computational cryptographic cs.cr important party perfect protocols quant-ph quantum result security under