Quantum weak coin flipping with a single photon

• URL: http://arxiv.org/abs/2002.09005v2
• Date: Wed, 12 Aug 2020 19:41:10 GMT
• Title: Quantum weak coin flipping with a single photon
• Authors: Mathieu Bozzio, Ulysse Chabaud, Iordanis Kerenidis, Eleni Diamanti
• Abstract summary: Weak coin flipping is among the fundamental cryptographic primitives which ensure the security of modern communication networks. We present a practical protocol that requires a single photon and linear optics only. We show that it is fair and balanced even when threshold single-photon detectors are used, and reaches a bias as low as $epsilon=1/sqrt2-1/2approx 0.207$.
• Score: 3.0969191504482247
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Weak coin flipping is among the fundamental cryptographic primitives which ensure the security of modern communication networks. It allows two mistrustful parties to remotely agree on a random bit when they favor opposite outcomes. Unlike other two-party computations, one can achieve information-theoretic security using quantum mechanics only: both parties are prevented from biasing the flip with probability higher than $1/2+\epsilon$, where $\epsilon$ is arbitrarily low. Classically, the dishonest party can always cheat with probability $1$ unless computational assumptions are used. Despite its importance, no physical implementation has been proposed for quantum weak coin flipping. Here, we present a practical protocol that requires a single photon and linear optics only. We show that it is fair and balanced even when threshold single-photon detectors are used, and reaches a bias as low as $\epsilon=1/\sqrt{2}-1/2\approx 0.207$. We further show that the protocol may display quantum advantage over a few hundred meters with state-of-the-art technology.

Related papers

• Improving device-independent weak coin flipping protocols [0.08192907805418585]
  Weak coin flipping is the cryptographic task where Alice and Bob remotely flip a coin but want opposite outcomes. Best protocol was devised over a decade ago by Silman, Chailloux, Aharon, Kerenidis, Pironio, and Massar. We show how one can test $n-1$ out of $n$ devices, and estimate the performance of the remaining device, for later use in the protocol.
  arXiv  Detail & Related papers  (2024-04-25T23:17:37Z)
• Scalable Determination of Multipartite Entanglement in Quantum Networks [1.248349449820389]
  Quantum networks comprised of entangled end nodes serve stronger than the classical correlation for unparalleled quantum internet applications. We show that determining quantum network fidelity and genuine $N$-node entanglement in an untrusted star network requires only $N+1$ measurement settings.
  arXiv  Detail & Related papers  (2023-03-31T02:22:42Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Unconditionally secure relativistic multi-party biased coin flipping and die rolling [0.0]
  We introduce relativistic multi-party biased die rolling protocols, generalizing coin flipping to $M geq 2$ parties and to $N geq 2$ outcomes. Our results prove that the most general random secure multi-party computation, where all parties receive the output and there is no secret input by any party, can be implemented with unconditional security.
  arXiv  Detail & Related papers  (2021-07-19T23:28:32Z)
• Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
  A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
  arXiv  Detail & Related papers  (2020-12-30T18:03:56Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
  We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs" We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM) As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
  arXiv  Detail & Related papers  (2020-09-29T08:41:53Z)
• Breaking simple quantum position verification protocols with little entanglement [0.0]
  INQC evades apparent quantum and relativistic constraints and allows to attack generic quantum position verification protocols. We consider adversaries sharing maximally entangled pairs of qudits and find low-dimensional INQC attacks against the simple practical family of QPV protocols.
  arXiv  Detail & Related papers  (2020-07-31T02:19:55Z)
• Bosonic quantum communication across arbitrarily high loss channels [68.58838842613457]
  A general attenuator $Phi_lambda, sigma$ is a bosonic quantum channel that acts by combining the input with a fixed environment state. We show that for any arbitrary value of $lambda>0$ there exists a suitable single-mode state $sigma(lambda)$. Our result holds even when we fix an energy constraint at the input of the channel, and implies that quantum communication at a constant rate is possible even in the limit of arbitrarily low transmissivity.
  arXiv  Detail & Related papers  (2020-03-19T16:50:11Z)
• Almost Public Quantum Coins [0.1813006808606333]
  A quantum coins scheme, just like the traditional currency coin scheme, all the money states are exact copies of each other. A quantum money scheme can be private, i.e., only the bank can verify the money states, or public. We propose a way to lift any private quantum coin scheme to a scheme that closely resembles a public quantum coin scheme.
  arXiv  Detail & Related papers  (2020-02-27T21:00:57Z)
• Genuine Network Multipartite Entanglement [62.997667081978825]
  We argue that a source capable of distributing bipartite entanglement can, by itself, generate genuine $k$-partite entangled states for any $k$. We provide analytic and numerical witnesses of genuine network entanglement, and we reinterpret many past quantum experiments as demonstrations of this feature.
  arXiv  Detail & Related papers  (2020-02-07T13:26:00Z)

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.