Quantum Byzantine Agreement Against Full-information Adversary

• URL: http://arxiv.org/abs/2409.01707v1
• Date: Tue, 3 Sep 2024 08:44:36 GMT
• Title: Quantum Byzantine Agreement Against Full-information Adversary
• Abstract summary: It is feasible to construct a quantum agreement protocol that can effectively handle a full-information adversary. In the quantum full-information setting, participating players can exchange qubits, while the adversary possesses comprehensive and accurate visibility into the system's state and messages.
• Score: 7.31080473170185
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We exhibit that, when given a classical Byzantine agreement protocol designed in the private-channel model, it is feasible to construct a quantum agreement protocol that can effectively handle a full-information adversary. Notably, both protocols have equivalent levels of resilience, round complexity, and communication complexity. In the classical private-channel scenario, participating players are limited to exchanging classical bits, with the adversary lacking knowledge of the exchanged messages. In contrast, in the quantum full-information setting, participating players can exchange qubits, while the adversary possesses comprehensive and accurate visibility into the system's state and messages. By showcasing the reduction from quantum to classical frameworks, this paper demonstrates the strength and flexibility of quantum protocols in addressing security challenges posed by adversaries with increased visibility. It underscores the potential of leveraging quantum principles to improve security measures without compromising on efficiency or resilience. By applying our reduction, we demonstrate quantum advantages in the round complexity of asynchronous Byzantine agreement protocols in the full-information model. It is well known that in the full-information model, any classical protocol requires $\Omega(n)$ rounds to solve Byzantine agreement with probability one even against Fail-stop adversary when resilience $t=\Theta(n)$. We show that quantum protocols can achieve $O(1)$ rounds (i) with resilience $t<n/2$ against a Fail-stop adversary, and (ii) with resilience $t<n/(3+\epsilon)$ against a Byzantine adversary for any constant $\epsilon>0$, therefore surpassing the classical lower bound.

Related papers

• Experimental demonstration of scalable quantum blockchain with exponentially superior quantum communication complexity [22.368056596656675]
  We experimentally demonstrate a scalable quantum blockchain protocol based on weak coherent states.<n>The protocol employs a circular quantum Byzantine agreement mechanism that preserves information-theoretic security.<n>Compared with previous schemes, the protocol requires less than 4% of the quantum communication resources.
  arXiv  Detail & Related papers  (2026-07-14T01:25:28Z)
• Hybrid Consensus with Quantum Sybil Resistance [4.524401636606247]
  We design a consensus protocol that combines classical hybrid protocols with quantum position verification as the Sybil resistance mechanism.<n>Our protocol inherits the benefits of other hybrid protocols, namely the faster confirmation times compared to pure Proof-of-Work protocols.<n>We additionally propose a spam prevention mechanism for our protocol in the Random Oracle model.
  arXiv  Detail & Related papers  (2026-02-25T18:44:24Z)
• Scalable and Highly Fault-Tolerant Circular Quantum Byzantine Agreement [3.997711170980834]
  Quantum Byzantine Agreement (QBA) offers inherent advantages in security and fault tolerance over classical protocols.<n>We propose a multiparty circular QBA protocol that adopts a semi-decentralized architecture, leveraging circular message gathering and quantum digital signatures.<n>Our protocol is experimentally feasible, requiring only weak coherent states, and is compatible with existing star-shaped quantum networks.
  arXiv  Detail & Related papers  (2026-02-12T05:21:11Z)
• Simultaneous Classical and Quantum Communications: Recent Progress and Three Challenges [52.931372025288844]
  We explore novel protocols that enable simultaneous classical and quantum communications.<n>We extend quantum communication capabilities beyond traditional optical bands into the terahertz.<n>We identify open problems that must be addressed to facilitate practical implementation.
  arXiv  Detail & Related papers  (2025-12-11T00:27:08Z)
• Enhanced Rényi Entropy-Based Post-Quantum Key Agreement with Provable Security and Information-Theoretic Guarantees [0.0]
  This paper presents an enhanced post-quantum key agreement protocol based on R'enyi entropy, addressing vulnerabilities in the original construction while preserving information-theoretic security properties.<n>We develop a theoretical framework leveraging entropy-preserving operations and secret-shared verification to achieve provable amplification against quantum adversaries.<n>Key innovations include a confidentiality-preserving verification mechanism using distributed oracle commitments, tightened min-entropy bounds with guaranteed non-negativity, and composable security proofs in the quantum universal composability framework.
  arXiv  Detail & Related papers  (2025-08-28T00:42:49Z)
• Authenticated Sublinear Quantum Private Information Retrieval [12.91566002502802]
  This paper introduces a novel lower bound on communication complexity using quantum relative entropy and mutual information. By leveraging Uhlmann's lemma and quantum Pinsker inequalities, the authors establish tighter bounds for information-theoretic security.
  arXiv  Detail & Related papers  (2025-04-05T03:30:04Z)
• Quantum position verification in one shot: parallel repetition of the $f$-BB84 and $f$-routing protocols [0.0]
  We show that security for a one-round protocol can rely on the size of the classical information rather than quantum resources. We establish parallel repetition of the $f$-BB84 and $f$-routing QPV protocols.
  arXiv  Detail & Related papers  (2025-03-12T17:00:32Z)
• Implementing an information-theoretically secure Byzantine agreement with quantum signed message solution [9.643164830645038]
  Byzantine agreement (BA) enables all honest nodes in a decentralized network to reach consensus. We propose a quantum signed Byzantine agreement (QSBA) protocol based on the quantum signed message (QSM) scheme. Our protocol achieves information-theoretic security using only QKD-shared key resources between network nodes.
  arXiv  Detail & Related papers  (2025-02-08T10:30:37Z)
• Application of $α$-order Information Metrics for Secure Communication in Quantum Physical Layer Design [45.41082277680607]
  We study the $alpha$-order information-theoretic metrics based on R'enyi entropy.<n>We apply our framework to a practical scenario involving BPSK modulation over a lossy bosonic channel.
  arXiv  Detail & Related papers  (2025-02-07T03:44:11Z)
• Oblivious Transfer from Zero-Knowledge Proofs, or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States [0.0]
  We turn any classical Zero-Knowledge (ZK) protocol into a composable (quantum) oblivious transfer (OT) protocol. We provide the first round-optimal (2-message) quantum OT protocol secure in the random oracle model. At the heart of our construction lies a new method that allows us to prove properties on a received quantum state without revealing additional information.
  arXiv  Detail & Related papers  (2023-03-02T18:38:15Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Single-qubit loss-tolerant quantum position verification protocol secure against entangled attackers [0.0]
  We study the exact loss-tolerance of the most popular protocol for QPV, which is based on BB84 states. We show how these results transfer to the variant protocol which combines $n$ bits of classical information with a single qubit.
  arXiv  Detail & Related papers  (2022-12-07T14:39:56Z)
• On the Role of Quantum Communication and Loss in Attacks on Quantum Position Verification [0.0]
  We show that any protocol secure against classical communication can be transformed into a protocol secure against quantum communication. We observe that any multi-round QPV protocol can be attacked with a linear amount of entanglement if the loss is high enough.
  arXiv  Detail & Related papers  (2022-08-08T18:01:22Z)
• Classical analogue of quantum superdense coding and communication advantage of a single quantum system [0.0]
  We show that a qubit communication without any assistance of classical shared randomness can achieve the goal. We also study communication utility of a class of non-classical toy systems described by symmetric polygonal state spaces.
  arXiv  Detail & Related papers  (2022-02-14T15:29:59Z)
• Commitment capacity of classical-quantum channels [70.51146080031752]
  We define various notions of commitment capacity for classical-quantum channels. We prove matching upper and lower bound on it in terms of the conditional entropy.
  arXiv  Detail & Related papers  (2022-01-17T10:41:50Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• A single-qubit position verification protocol that is secure against multi-qubit attacks [2.3857747529378917]
  We show that minimal quantum resources, in the form of a single qubit, combined with classical communication are sufficient to thwart quantum adversaries. More precisely, we show that the adversaries using an increasing amount of entanglement can be combatted solely by increasing the number of classical bits used in the protocol.
  arXiv  Detail & Related papers  (2021-04-13T15:48:11Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• 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)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)

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.