On the composable security of weak coin flipping

• URL: http://arxiv.org/abs/2402.15233v3
• Date: Thu, 19 Jun 2025 03:58:45 GMT
• Title: On the composable security of weak coin flipping
• Authors: Jiawei Wu, Yanglin Hu, Akshay Bansal, Marco Tomamichel,
• Abstract summary: Weak coin flipping is a cryptographic primitive in which two mutually distrustful parties generate a shared random bit to agree on a winner via remote communication.<n>While a stand-alone secure weak coin flipping protocol can be constructed from noiseless quantum communication channels, its composability remains unexplored.
• Score: 11.574303525377676
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Weak coin flipping is a cryptographic primitive in which two mutually distrustful parties generate a shared random bit to agree on a winner via remote communication. While a stand-alone secure weak coin flipping protocol can be constructed from noiseless quantum communication channels, its composability remains unexplored. In this work, we demonstrate that no weak coin flipping protocol can be abstracted as a simple black-box resource with composable security. Despite this, we also establish the overall stand-alone security of quantum weak coin flipping protocols under composition in sequential order.

Related papers

• Quantum digital signature based on single-qubit without a trusted third-party [45.41082277680607]
  We propose a brand new quantum digital signature protocol without a trusted third party only with qubit technology to further improve the security. We prove that the protocol has information-theoretical unforgeability. Moreover, it satisfies other important secure properties, including asymmetry, undeniability, and expandability.
  arXiv  Detail & Related papers  (2024-10-17T09:49:29Z)
• Tyche: Collateral-Free Coalition-Resistant Multiparty Lotteries with Arbitrary Payouts [23.27199615640474]
  We propose Tyche, a family of protocols for performing efficient multiparty lotteries. Our protocols are based on a commit-and-reveal approach, requiring only a collision-resistant hash function. We show that our protocols are secure, fair, and some preserve the participants' privacy.
  arXiv  Detail & Related papers  (2024-09-05T12:19:37Z)
• The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
  We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols. Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol. We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• Efficient source-independent quantum conference key agreement [25.617190829449893]
  Quantum conference key agreement (QCKA) enables the unconditional secure distribution of conference keys among multiple participants. We propose a source-independent QCKA scheme utilizing the post-matching method. We introduce an equivalent distributing virtual multi-photon entanglement protocol for providing the unconditional security proof.
  arXiv  Detail & Related papers  (2024-06-25T04:24:06Z)
• Protocols for Quantum Weak Coin Flipping [0.1499944454332829]
  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.
  arXiv  Detail & Related papers  (2024-02-24T16:52:54Z)
• Demonstration of quantum-digital payments [36.136619420474766]
  We show how quantum light can secure daily digital payments by generating inherently unforgeable quantum cryptograms. Unlike previously proposed protocols, our solution does not depend on long-term quantum storage or trusted agents and authenticated channels. It is practical with near-term technology and may herald an era of quantum-enabled security.
  arXiv  Detail & Related papers  (2023-05-23T20:20:14Z)
• Breaking barriers in two-party quantum cryptography via stochastic semidefinite programming [0.0]
  We find a way to switch between bit commitment, weak coin flipping, and oblivious transfer protocols to improve their security. We also use selection to turn trash into treasure yielding the first quantum protocol for Rabin oblivious transfer.
  arXiv  Detail & Related papers  (2023-04-26T00:00:48Z)
• Refined Bitcoin Security-Latency Under Network Delay [35.16231062731263]
  We study how secure a block is after it becomes $k$-deep in the chain. We analyze the race between adversarial and honest chains in three different phases. We find the probability distribution of the growth of the adversarial chains under models similar to those in [Guo, Ren; AFT 2022] when a target block becomes $k$-deep in the chain.
  arXiv  Detail & Related papers  (2022-12-02T18:54:30Z)
• Deploying Convolutional Networks on Untrusted Platforms Using 2D Holographic Reduced Representations [33.26156710843837]
  We create a neural network with a pseudo-encryption style defense that empirically shows robustness to attack. By leveraging Holographic Symbolic Reduced Representations (HRR), we create a neural network with a pseudo-encryption style defense that empirically shows robustness to attack.
  arXiv  Detail & Related papers  (2022-06-13T03:31:39Z)
• 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)
• 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)
• 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)
• 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.