English
Related papers

Related papers: A Quantum Detectable Byzantine Agreement Protocol …

200 papers

Byzantine Agreement introduced in [Pease, Shostak, Lamport, 80] is a widely used building block of reliable distributed protocols. It simulates broadcast despite the presence of faulty parties within the network, traditionally using only…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-12-03 Jeffrey Considine , Leonid A. Levin , David Metcalf

We suggest that the Quantum Honest Byzantine Agreement (QHBA) protocol [1] essentially reduces consensus to coincidence. The volume of coincidence is the parameter that drives a receiver to echo its input. A lack of coincidence results in…

Quantum Physics · Physics 2024-12-19 Marcus Edwards

The multi-valued byzantine agreement protocol (MVBA) in the authenticated setting has been widely used as a core to design atomic broadcast and fault-tolerant state machine replication protocols in asynchronous networks. Originating from…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-11-21 Nasit S Sony , Xianzhong Ding

For reaching efficient deterministic synchronous Byzantine agreement upon partially connected networks, the traditional broadcast primitive is extended and integrated with a general framework. With this, the Byzantine agreement is extended…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-03-09 Shaolin Yu , Jihong Zhu , Jiali Yang , Wei Lu

Gao et al. [Phys. Rev. Lett. 101, 208901 (2008)] have described a possible intercept-resend attack for the quantum protocol for detectable Byzantine agreement in Phys. Rev. Lett. 100, 070504 (2008). Here we describe an extension of the…

We develop protocols for preparing a GHZ state and, in general,a pure multi-partite maximally entangled state in a distributed network with apriori quantum entanglement between agents using classical communication and local operations. We…

Quantum Physics · Physics 2007-05-23 Sudhir Kumar Singh , Somesh Kumar , Sudebkumar Prasant Pal

We provide a new protocol for Validated Asynchronous Byzantine Agreement. Validated (multi-valued) Asynchronous Byzantine Agreement is a key building block in constructing Atomic Broadcast and fault-tolerant state machine replication in the…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-11-06 Ittai Abraham , Dahlia Malkhi , Alexander Spiegelman

We present a scheme for quantum communication, where a set of EPR pairs, initially shared by the sender Alice and the receiver Bob, functions as a quantum channel. After insuring the safety of the quantum channel, Alice applies local…

Quantum Physics · Physics 2007-05-23 Feng-Li Yan , Ting Gao

We propose a wide class of distillation schemes for multi-partite entangled states that are CSS-states. Our proposal provides not only superior efficiency, but also new insights on the connection between CSS-states and bipartite graph…

Information Theory · Computer Science 2008-04-05 Kai Chen , Hoi-Kwong Lo

A deterministic direct quantum communication protocol by using swapping quantum entanglement and local unitary operations is proposed in this paper. A set of ordered EPR pairs in one of the four Bell states is used. For each pair, each of…

Quantum Physics · Physics 2007-05-23 Z. J. Zhang , Z. X. Man

Numerous distributed tasks have to be handled in a setting where a fraction of nodes behaves Byzantine, that is, deviates arbitrarily from the intended protocol. Resilient, deterministic protocols rely on the detection of majorities to…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-02-10 Philipp Schneider

We present a protocol for performing entanglement connection between pairs of atomic ensembles in the single excitation regime. Two pairs are prepared in an asynchronous fashion and then connected via a Bell measurement. The resulting state…

Quantum Physics · Physics 2009-11-13 J. Laurat , C. W. Chou , H. Deng , K. S. Choi , D. Felinto , H. de Riedmatten , H. J. Kimble

We present a quantum scheme for signing contracts between two clients (Alice and Bob) using entangled states and the services of a third trusted party (Trent). The trusted party is only contacted for the initialization of the protocol, and…

Quantum Physics · Physics 2019-09-04 P. Yadav , P. Mateus , N. Paunković , A. Souto

Two schemes for sharing an arbitrary two-qubit state based on entanglement swapping are proposed with Bell-state measurements and local unitary operations. One is based on the quantum channel with four Einstein-Podolsky-Rosen (EPR) pairs…

Quantum Physics · Physics 2009-11-11 Fu-Guo Deng , Xi-Han Li , Chun-Yan Li , Ping Zhou , Hong-Yu Zhou

A scheme of quantum authentication is presented. Two parties share Einstein-Podolsky-Rosen (EPR) pairs previously as the authentication key which servers as encoder and decoder. The authentication is accomplished with local controlled-NOT…

Quantum Physics · Physics 2007-05-23 Yong-Sheng Zhang , Chuan-Feng Li , Guang-Can Guo

Multi-valued Byzantine agreement (MVBA) protocols are essential for atomic broadcast and fault-tolerant state machine replication in asynchronous networks. Despite advances, challenges persist in optimizing these protocols for communication…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-11-18 Nasit S Sony , Xianzhong Ding , Mukesh Singhal

Randomisation is a critical tool in designing distributed systems. The common coin primitive, enabling the system members to agree on an unpredictable random number, has proven to be particularly useful. We observe, however, that it is…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-05-25 Luciano Freitas , Petr Kuznetsov , Andrei Tonkikh

Recently, Liu W et al. proposed a two-party quantum private comparison (QPC) protocol using entanglement swapping of Bell entangled state (Commun. Theor. Phys. 57(2012)583-588). Subsequently, Liu W J et al. pointed out that in Liu W et…

Quantum Physics · Physics 2022-05-18 Tian-Yu Ye

To improve the overall efficiency and reliability of Byzantine protocols in large sparse networks, we propose a new system assumption for developing multi-scale fault-tolerant systems, with which several kinds of multi-scale Byzantine…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-03-08 Shaolin Yu , Jihong Zhu , Jiali Yang , Yulong Zhan

Consider an asynchronous system where each node begins with some point in $\mathbb{R}^m$. Given some fixed $\epsilon > 0$, we wish to have every nonfaulty node eventually output a point in $\mathbb{R}^m$, where all outputs are within…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-11-07 Maya Dotan , Gilad Stern , Aviv Zohar