Year: 2025
Type: article
Abstract: Weak coin flipping is an important cryptographic primitive$\unicode{x2013}$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. In this work, we give exact constructions of related unitary operators. These, together with a new formalism, yield a family of protocols approaching perfect security thereby also simplifying Mochon's proof of existence. We illustrate the construction of explicit weak coin flipping protocols by considering concrete examples (from the aforementioned family of protocols) that are more secure than all previously known protocols. 76 pages. This is the TheoretiCS journal version
Source: TheoretiCS
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
Funders: National Science Foundation, U.S. Department of Defense, Gordon and Betty Moore Foundation, European Commission, Fonds De La Recherche Scientifique - FNRS, QuantERA, Multidisciplinary University Research Initiative, Simons Institute for the Theory of Computing, University of California Berkeley, Institute for Quantum Information and Matter, California Institute of Technology, Fundação para a Ciência e a Tecnologia, Fonds pour la Formation à la Recherche dans l’Industrie et dans l’Agriculture
Awards: G1578237752, G2074083719, G2144570049, G2282369628, G2975900969, Instituto de Telecomunicações, G3462782470, G3850789590, G3884855522, G3891694003, G434337789, Instituto de Telecomunicações, G5475635744, TAS::57 3600::TAS (MURI) 'SCALABLE CERTIFICATION OF QUANTUM COMPUTING DEVICES AND NETWORKS', Quantum cryptography for common users and secure multi-party computation, G6997658380, G7148304117, G8163048266
OpenAlex ID: W4416718039
FWCI:
Cites:
Cited by:
Related to: