English
Related papers

Related papers: Multi-party Quantum Byzantine Agreement Without En…

200 papers

Quantum metrology and quantum communications are typically considered as distinct applications in the broader portfolio of quantum technologies. However, there are cases where we might want to combine the two and recent proposals have shown…

Quantum Physics · Physics 2023-02-08 Sean William Moore , Jacob Andrew Dunningham

A quantum key distribution and identification protocol is proposed, which is based on entanglement swapping. Through choosing particles by twos from the sequence and performing Bell measurements, two communicators can detect eavesdropping,…

Quantum Physics · Physics 2007-05-23 Fei Gao , Fenzhuo Guo , Qiaoyan Wen , Fuchen Zhu

In this paper, we investigate properties of some multi-particle entangled states and, from the properties applying the secret sharing present a new type of quantum key distribution protocols as generalization of quantum key distribution…

Quantum Physics · Physics 2007-05-23 Sora Choi , Jinsoo Kim , Dong Pyo Chi

We propose a high-efficiency three-party quantum key agreement protocol, by utilizing two-photon polarization-entangled Bell states and a few single-photon polarization states as the information carriers, and we use the quantum dense coding…

Quantum Physics · Physics 2019-06-26 Wan-Ting He , Jun Wang , Tian-Tian Zhang , Faris Alzahrani , Aatef Hobiny , Tasawar Hayat , Fu-Guo Deng

We present a multiparty simultaneous quantum identity authentication protocol based on entanglement swapping. In our protocol, the multi-user can be authenticated by a trusted third party simultaneously.

Quantum Physics · Physics 2009-11-13 Jian Wang , Quan Zhang , Chao-jing Tang

We show that any number of parties can coherently exchange any one pure quantum state for another, without communication, given prior shared entanglement. Two applications of this fact to the study of multi-prover quantum interactive proof…

Quantum Physics · Physics 2011-03-11 Debbie Leung , Ben Toner , John Watrous

Randomized algorithm that achieves multi-valued Byzantine agreement with high probability, and achieves optimal complexity.

Distributed, Parallel, and Cluster Computing · Computer Science 2010-07-29 Guanfeng Liang , Nitin Vaidya

Blind quantum computation (BQC) protocols enable quantum algorithms to be executed on third-party quantum agents while keeping the data and algorithm confidential. The previous proposals for measurement-based BQC require preparing a highly…

Quantum Physics · Physics 2023-09-20 Shuxiang Cao

We show that all multi-partite pure states can, under local operations, be transformed into bi-partite pairwise entangled states in a "lossless fashion": An arbitrary distinguished party will keep pairwise entanglement with all other…

Quantum Physics · Physics 2015-05-13 Dong Yang , Jens Eisert

Quantum key distribution (QKD) is a provably secure way for two distant parties to establish a common secret key, which then can be used in a classical cryptographic scheme. Using quantum entanglement, one can reduce the necessary…

Quantum Physics · Physics 2016-08-10 E. A. Aguilar , R. Ramanathan , J. Kofler , M. Pawlowski

Sharing entangled pairs between non-signaling parties via entanglement swapping constitutes a striking demonstration of the nonlocality of quantum mechanics and a crucial building block for future quantum technologies. In this work, we…

Quantum Physics · Physics 2026-01-28 Santeri Huhtanen , Yousef Mafi , Ali G. Moghaddam , Teemu Ojanen

We proposed a framework of quantum-enhanced logic-based blockchain, which improves the efficiency and power of quantum-secured blockchain. The efficiency is improved by using a new quantum honest-success Byzantine agreement protocol to…

Quantum Physics · Physics 2018-07-17 Xin Sun , Quanlong Wang , Piotr Kulicki , Xishun Zhao

In this paper, we present a hybrid bidirectional controlled quantum communication protocol between two parties, initiated by a Mentor. Initially, the two main parties and the controller do not share a common quantum entanglement; instead,…

Quantum Physics · Physics 2025-03-11 Manoj Kumar Manda , Mitali Sisodia , Plaban Saha , Binayak S. Choudhury

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

In this paper, we present an efficient deterministic algorithm for consensus in presence of Byzantine failures. Our algorithm achieves consensus on an $L$-bit value with communication complexity $O(nL + n^4 L^{0.5} + n^6)$ bits, in a…

Distributed, Parallel, and Cluster Computing · Computer Science 2011-01-19 Guanfeng Liang , Nitin Vaidya

In this paper, a three-party secure semiquantum summation protocol, which can calculate the modulo 2 addition of the private bits from one quantum participant and two classical participants, is constructed by only using single qubits as the…

Quantum Physics · Physics 2022-06-15 Jia-Li , Hu , Tian-Yu Ye

In the burgeoning domain of distributed quantum computing, achieving consensus amidst adversarial settings remains a pivotal challenge. We introduce an enhancement to the Quantum Byzantine Agreement (QBA) protocol, uniquely incorporating…

Quantum Physics · Physics 2023-11-07 Matthew Prest , Kuan-Cheng Chen

Sharing genuine multipartite entanglement by considering collective use of copies of biseparable states, which are entangled across all bipartitions but lack genuine multipartite entanglement at the single-copy level, plays a central role…

Quantum Physics · Physics 2026-01-26 Swati Choudhary , Ujjwal Sen , Saronath Halder

Large scale cryptocurrencies require the participation of millions of participants and support economic activity of billions of dollars, which has led to new lines of work in binary Byzantine Agreement (BBA) and consensus. The new work aims…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-04-07 Thaddeus Dryja , Quanquan C. Liu , Neha Narula

We consider the problem of approximate consensus in mobile networks containing Byzantine nodes. We assume that each correct node can communicate only with its neighbors and has no knowledge of the global topology. As all nodes have moving…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-06-04 Chuanyou Li , Michel Hurfin , Yun Wang