Related papers: Multi-party Quantum Byzantine Agreement Without En…
This paper presents the first quantum entanglement establishment scheme for strangers who neither pre-share any secret nor have any authenticated classical channel between them. The proposed protocol requires only the help of two almost…
Quantum communication in general helps deter potential eavesdropping in the course of transmission of bits to enable secure communication between two or more parties. In this paper, we propose a novel quasi-deterministic secure quantum…
This paper presents a new quantum protocol designed to simultaneously transmit information from one source to many recipients. The proposed protocol, which is based on the phenomenon of entanglement, is completely distributed and is…
In communication theory, attacks like eavesdropping or jamming are typically assumed to occur at the channel level, while communication parties are expected to follow established protocols. But what happens if one of the parties turns…
We propose a probabilistic two-party communication complexity scenario with a prior nonmaximally entangled state, which results in less communication than that is required with only classical random correlations. A simple all-optical…
Achieving agreement among distributed parties is a fundamental task in modern systems, underpinning applications such as consensus in blockchains, coordination in cloud infrastructure, and fault tolerance in critical services. However, this…
After analysing the main quantum secret sharing protocol based on the entanglement states, we propose an idea to directly encode the qubit of quantum key distributions, and then present a quantum secret sharing scheme where only product…
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…
It is pointed out that two separated quantum channels and three classical authenticated channels are sufficient resources to achieve detectable broadcast.
We present a multi-party quantum clock synchronization protocol that utilizes shared prior entanglement and broadcast of classical information to synchronize spatially separated clocks. Notably, it is necessary only for any one party to…
We demonstrate that the Byzantine Agreement Problem (BAP) in its weaker version with detectable broadcast, can be solved using continuous variables Gaussian states with Gaussian operations. The protocol uses genuine tripartite symmetric…
Quantum mechanics provides several methods to generate and securely distribute private lists of numbers suitably correlated to solve the Three Byzantine Generals Problem. So far, these methods are based on three-qutrit singlet states,…
We present a protocol for sending a message over a quantum channel with different layers of security that will prevent an eavesdropper from deciphering the message without being detected. The protocol has two versions where the bits are…
Byzantine agreement protocols in asynchronous networks have gained renewed attention due to their independence from network timing assumptions to ensure termination. Traditional asynchronous Byzantine agreement protocols require every party…
In this paper, we give a deterministic two-step Byzantine consensus protocol that achieves safety and liveness. A two-step Byzantine consensus protocol only needs two communication steps to commit in the absence of faults. Most two-step…
In Byzantine agreement with predictions each process begins with an input value and some (unreliable) prediction bits. Recently, it has been shown that with \emph{classification predictions} -- where the predictions predict each process to…
It is shown that with the use of entanglement a specific two party communication task can be done with a systematically smaller expected error than any possible classical protocol could do. The example utilises the very tight correlation…
Byzantine agreement (BA) is a distributed consensus problem where $n$ processors want to reach agreement on an $\ell$-bit message or value, but up to $t$ of the processors are dishonest or faulty. The challenge of this BA problem lies in…
We consider a variation of the multi-party communication complexity scenario where the parties are supplied with an extra resource: particles in an entangled quantum state. We show that, although a prior quantum entanglement cannot be used…
Quantum networks will provide multi-node entanglement over long distances to enable secure communication on a global scale. Traditional quantum communication protocols consume pair-wise entanglement, which is sub-optimal for distributed…