Unconditionally secure relativistic multi-party biased coin flipping and die rolling

• URL: http://arxiv.org/abs/2107.09196v2
• Date: Thu, 9 Sep 2021 21:51:50 GMT
• Title: Unconditionally secure relativistic multi-party biased coin flipping and die rolling
• Authors: Dami\'an Pital\'ua-Garc\'ia
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce relativistic multi-party biased die rolling protocols, generalizing coin flipping to $M \geq 2$ parties and to $N \geq 2$ outcomes for any chosen outcome biases, and show them unconditionally secure. 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. Our protocols extend Kent's [A. Kent, Phys. Rev. Lett. 83, 5382 (1999)] two-party unbiased coin flipping protocol, do not require any quantum communication, are practical to implement with current technology, and to our knowledge are the first multi-party relativistic cryptographic protocols.

Related papers

• Experimental Secure Multiparty Computation from Quantum Oblivious Transfer with Bit Commitment [13.244842672008811]
  Secure multiparty computation can be realized using oblivious transfer as a primitive function. We present an experimental implementation of a quantum-secure quantum oblivious transfer protocol. In our experiments, two banks can identify common suspicious accounts without disclosing any other data.
  arXiv  Detail & Related papers  (2024-11-07T09:29:12Z)
• Generalized Hybrid Search and Applications to Blockchain and Hash Function Security [50.16790546184646]
  We first examine the hardness of solving various search problems by hybrid quantum-classical strategies. We then construct a hybrid quantum-classical search algorithm and analyze its success probability.
  arXiv  Detail & Related papers  (2023-11-07T04:59:02Z)
• Simple Opinion Dynamics for No-Regret Learning [38.61048016579232]
  We study a cooperative multi-agent bandit setting in the distributed GOSSIP model. We introduce and analyze families of memoryless and time-independent protocols for this setting. For stationary reward settings, we prove for the first time that these simple protocols exhibit best-of-both-worlds behavior.
  arXiv  Detail & Related papers  (2023-06-14T17:59:15Z)
• Semi-device independent nonlocality certification for near-term quantum networks [46.37108901286964]
  Bell tests are the most rigorous method for verifying entanglement in quantum networks. If there is any signaling between the parties, then the violation of Bell inequalities can no longer be used. We propose a semi-device independent protocol that allows us to numerically correct for effects of correlations in experimental probability distributions.
  arXiv  Detail & Related papers  (2023-05-23T14:39:08Z)
• Secure multi-party quantum summation based on quantum Fourier transform [0.0]
  The proposed protocol can resist both the outside attacks and the participant attacks. One party cannot obtain other parties' private integer strings; and it is secure for the colluding attack performed by at most n-2 parties, where n is the number of parties.
  arXiv  Detail & Related papers  (2022-05-12T14:36:18Z)
• A constant lower bound for any quantum protocol for secure function evaluation [0.0]
  We show that perfect (or near perfect) security is impossible, even for quantum protocols. Constant lower bounds are of practical interest since they imply the impossibility to arbitrarily amplify the security of quantum protocols.
  arXiv  Detail & Related papers  (2022-03-15T21:40:48Z)
• 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)
• 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)
• A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip [2.469280630208887]
  In a coin-flipping protocol, a computationally adversary can choose which parties to corrupt along the protocol execution. We prove that no $n$-party protocol (of any round complexity) is resilient to $omega(sqrtn)$ corruptions.
  arXiv  Detail & Related papers  (2020-05-04T15:29:11Z)
• Quantum weak coin flipping with a single photon [3.0969191504482247]
  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$.
  arXiv  Detail & Related papers  (2020-02-20T20:30:16Z)
• 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.