Protocols for Quantum Weak Coin Flipping
- URL: http://arxiv.org/abs/2402.15855v1
- Date: Sat, 24 Feb 2024 16:52:54 GMT
- Title: Protocols for Quantum Weak Coin Flipping
- Authors: Atul Singh Arora and J\'er\'emie Roland and Chrysoula Vlachou and
Stephan Weis
- Abstract summary: Weak coin flipping is an important cryptographic primitive.
We give exact constructions of related unitary operators.
We illustrate the construction of explicit weak coin flipping protocols.
- Score: 0.1499944454332829
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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. 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.
Related papers
- Pessimism of the Will, Optimism of the Intellect: Fair Protocols with Malicious but Rational Agents [0.6990493129893112]
We present a game-based framework for the study of fairness protocols.
It is based on the notion of strong secure equilibria, and leverages the conceptual and algorithmic toolbox of game theory.
arXiv Detail & Related papers (2024-05-29T10:15:36Z) - Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass.
Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements.
We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
arXiv Detail & Related papers (2024-05-24T17:33:10Z) - Security of hybrid BB84 with heterodyne detection [0.0]
Quantum key distribution (QKD) promises everlasting security based on the laws of physics.
Recent hybrid QKD protocols have been introduced to leverage advantages from both categories.
We provide a rigorous security proof for a protocol introduced by Qi in 2021, where information is encoded in discrete variables.
arXiv Detail & Related papers (2024-02-26T19:00:01Z) - Security of a Continuous-Variable based Quantum Position Verification
Protocol [0.0]
We present and analyze a protocol that utilizes coherent states and its properties.
We prove security of the protocol against any unentangled attackers via entropic uncertainty relations.
We show that attackers who pre-share one continuous-variable EPR pair can break the protocol.
arXiv Detail & Related papers (2023-08-08T09:56:38Z) - Succinct Classical Verification of Quantum Computation [30.91621630752802]
We construct a classically succinct interactive argument for quantum computation (BQP)
Our protocol is secure assuming the post-quantum security of indistinguishability obfuscation (iO) and Learning Errors (LWE)
arXiv Detail & Related papers (2022-06-29T22:19:12Z) - Byzantine-Robust Federated Learning with Optimal Statistical Rates and
Privacy Guarantees [123.0401978870009]
We propose Byzantine-robust federated learning protocols with nearly optimal statistical rates.
We benchmark against competing protocols and show the empirical superiority of the proposed protocols.
Our protocols with bucketing can be naturally combined with privacy-guaranteeing procedures to introduce security against a semi-honest server.
arXiv Detail & Related papers (2022-05-24T04:03:07Z) - Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
We construct the first fully homomorphic encryption scheme with certified deletion.
Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
arXiv Detail & Related papers (2022-03-03T10:07:32Z) - Unbalanced-basis-misalignment tolerant measurement-device-independent
quantum key distribution [22.419105320267523]
Measurement-device-independent quantum key distribution (MDIQKD) is a revolutionary protocol since it is physically immune to all attacks on the detection side.
Some protocols release part of the assumptions in the encoding system to keep the practical security, but the performance would be dramatically reduced.
We present a MDIQKD protocol that requires less knowledge of encoding system to combat the troublesome modulation errors and fluctuations.
arXiv Detail & Related papers (2021-08-27T02:16:20Z) - Geometry of Banach spaces: a new route towards Position Based
Cryptography [65.51757376525798]
We study Position Based Quantum Cryptography (PBQC) from the perspective of geometric functional analysis and its connections with quantum games.
The main question we are interested in asks for the optimal amount of entanglement that a coalition of attackers have to share in order to compromise the security of any PBQC protocol.
We show that the understanding of the type properties of some more involved Banach spaces would allow to drop out the assumptions and lead to unconditional lower bounds on the resources used to attack our protocol.
arXiv Detail & Related papers (2021-03-30T13:55:11Z) - Dispelling Myths on Superposition Attacks: Formal Security Model and
Attack Analyses [0.0]
We propose the first computational security model considering superposition attacks for multiparty protocols.
We show that our new security model is satisfiable by proving the security of the well-known One-Time-Pad protocol.
We use this newly imparted knowledge to construct the first concrete protocol for Secure Two-Party Computation that is resistant to superposition attacks.
arXiv Detail & Related papers (2020-07-01T18:00:54Z) - Composable Security for Multipartite Entanglement Verification [3.4806267677524896]
We present a composably secure protocol allowing $n$ parties to test an entanglement generation resource controlled by a possibly dishonest party.
The test consists only in local quantum operations and authenticated classical communication once a state is shared among them.
Our protocol can typically be used as a subroutine in a Quantum Internet, to securely share a GHZ state among the network before performing a communication or computation protocol.
arXiv Detail & Related papers (2020-04-16T14:33:17Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.