English
Related papers

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

200 papers

Quantum communication resources offer significant advantages for fault-tolerant distributed protocols, particularly in Byzantine Agreement (BA), where reliability against adversarial interference is essential. Quantum Detectable Byzantine…

A multi-step quantum secure direct communication protocol using blocks of multi-particle maximally entangled state is proposed. In this protocol, the particles in a Green-Horne-Zeilinger state are sent from Alice to Bob in batches in…

Quantum Physics · Physics 2009-11-13 Chuan Wang , Fu Guo Deng , Gui Lu Long

We present an efficient quantum entanglement distribution over an arbitrary collective-noise channel. The basic idea in the present scheme is that two parties in quantum communication first transmit the entangled states in the frequency…

Quantum Physics · Physics 2015-05-18 Yu-Bo Sheng , Fu-Guo Deng

In order to avoid the risk of information leakage during the information mutual transmission between two authorized participants, i.e., Alice and Bob, a quantum dialogue protocol based on the entanglement swapping between any two Bell…

Quantum Physics · Physics 2022-05-05 Tian-Yu Ye , Li-Zhen Jiang

Recently, Sun et al. [Quant Inf Proc DOI: 10.1007/s11128-013-0569-x] presented an efficient multi-party quantum key agreement (QKA) protocol by employing single particles and unitary operations. The aim of this protocol is to fairly and…

Quantum Physics · Physics 2014-06-24 Wei Huang , Qiao-Yan Wen , Bin Liu , Qi Su , Fei Gao

There have been several reductions from multivalued consensus to binary consensus over the past 20 years. To the best of our knowledge, none of them solved it for Byzantine asynchronous settings. In this paper, we close this gap. Moreover,…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-08-08 Shir Cohen , Idit Keidar

As Byzantine Agreement (BA) protocols find application in large-scale decentralized cryptocurrencies, an increasingly important problem is to design BA protocols with improved communication complexity. A few existing works have shown how to…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-02-18 Ittai Abraham , T-H. Hubert Chan , Danny Dolev , Kartik Nayak , Rafael Pass , Ling Ren , Elaine Shi

The Byzantine agreement problem requires a set of $n$ processes to agree on a value sent by a transmitter, despite a subset of $b$ processes behaving in an arbitrary, i.e. Byzantine, manner and sending corrupted messages to all processes in…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-11-30 Cheng Wang , Carole Delporte-Gallet , Hugues Fauconnier , Rachid Guerraoui , Anne-Marie Kermarrec

In recent times, secure quantum communication in layered networks has emerged as an important area of study. In this paper, we harness the potential offered by multidimensional states in secure quantum communication with only one quantum…

Quantum Physics · Physics 2023-10-31 Rajni Bala , Sooryansh Asthana , V. Ravishankar

Quantum secret sharing is one of the most important and interesting quantum information processing task. In quantum secret sharing, information is split among several parties such that only one of them is able to recover the qubit exactly…

Quantum Physics · Physics 2010-11-15 Satyabrata Adhikari

This paper explores how reliable broadcast can be implemented without signatures when facing a dual adversary that can both corrupt processes and remove messages. More precisely, we consider an asynchronous $n$-process message-passing…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-09-02 Timothé Albouy , Davide Frey , Michel Raynal , François Taïani

This paper presents a random coding scheme with which two nodes can exchange information with guaranteed integrity over a two-way Byzantine relay. This coding scheme is employed to obtain an inner bound on the capacity region with…

Information Theory · Computer Science 2013-02-04 Eric Graves , Tan Wong

Secret sharing is a procedure for sharing a secret among a number of participants such that only the qualified subsets of participants have the ability to reconstruct the secret. Even in the presence of eavesdropping, secret sharing can be…

Quantum Physics · Physics 2015-05-13 Qin Li , W. H. Chan , Dong-Yang Long

Quantum key agreement requires all participants to recover the shared key together, so it is crucial to resist the participant attack. In this paper, we propose a verifiable multi-party quantum key agreement protocol based on the six-qubit…

Quantum Physics · Physics 2021-07-21 Li-Juan Liu , Zhi-Hui Li

Quantum Conference Key Agreement (QCKA) protocols are designed to allow multiple parties to agree on a shared secret key, secure against computationally unbounded adversaries. In this paper, we consider a high-dimensional QCKA protocol and…

Quantum Physics · Physics 2022-02-02 Omar Amer , Walter O. Krawec

The first two party Quantum Key Agreement (QKA) protocol, based on quantum teleportation, was proposed by Zhou et al. (Electronics Letters 40.18 (2004): 1149-1150). In this protocol, to obtain the key bit string, one of the parties use a…

Quantum Physics · Physics 2020-11-03 Nayana Das , Ritajit Majumdar

The paper presents general protocols for quantum teleportation between multiparties. It is shown how N parties can teleport N unknown quantum states to M other parties with the use of N+M qudits in the maximally entangled state. It is also…

Quantum Physics · Physics 2007-05-23 Andrzej Grudka

We present Authenticated Multiuser Quantum Direct Communication(MQDC) protocols using entanglement swapping. Quantum direct communication is believed to be a safe way to send a secret message without quantum key distribution. The…

Quantum Physics · Physics 2007-05-23 Changho Hong , Jiin Kim , Hwayean Lee , Hyungjin Yang

Semi-quantum protocols that allow some of the users to remain classical are proposed for a large class of problems associated with secure communication and secure multiparty computation. Specifically, first time semi-quantum protocols are…

Quantum Physics · Physics 2022-06-10 Chitra Shukla , Kishore Thapliyal , Anirban Pathak

It is well known that a trusted setup allows one to solve the Byzantine agreement problem in the presence of $t<n/2$ corruptions, bypassing the setup-free $t<n/3$ barrier. Alas, the overwhelming majority of protocols in the literature have…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-10-17 Daniel Collins , Yuval Efron , Jovan Komatovic
‹ Prev 1 4 5 6 7 8 10 Next ›