Related papers: A Quantum Detectable Byzantine Agreement Protocol …
We present a hybrid continuous variable-discrete variable entanglement generation protocol using linear optics and homodyne measurements, capable of producing multiple high-fidelity Bell pairs per protocol iteration, with an approximate…
Given a system with $n > 3t + 1$ processes, where $t$ is the tolerated number of faulty ones, we present a fast asynchronous Byzantine agreement protocol that can reach agreement in $O(t)$ expected running time. This improves the $O(n^2)$…
In this paper, a bidirectional quantum teleportation protocol based on Einstein-Podolsky-Rosen (EPR) pairs and entanglement swapping is proposed. In this scheme, two users can simultaneously transmit an unknown single-qubit state to each…
Work on \emph{optimal} protocols for \emph{Eventual Byzantine Agreement} (EBA) -- protocols that, in a precise sense, decide as soon as possible in every run and guarantee that all nonfaulty agents decide on the same value -- has focused on…
In the wake of the decisive impossibility result of Fischer, Lynch, and Paterson for deterministic consensus protocols in the aynchronous model with just one failure, Ben-Or and Bracha demonstrated that the problem could be solved with…
A new protocol for quantum key distribution based on entanglement swapping is presented. In this protocol, both certain key and random key can be generated without any loss of security. It is this property differs our protocol from the…
A set of mutually distrusting participants that want to agree on a common opinion must solve an instance of a Byzantine agreement problem. These problems have been extensively studied in the literature. However, most of the existing…
In the last few years there has been a lot of interest in quantum repeater protocols using only atomic ensembles and linear optics. Here we show that the local generation of high-fidelity entangled pairs of atomic excitations, in…
Distributed control systems require high reliability and availability guarantees despite often being deployed at the edge of network infrastructure. Edge computing resources are less secure and less reliable than centralized resources in…
This work performs an experimental evaluation of four asynchronous binary Byzantine consensus algorithms [11,16,18] in various configurations. In addition to being asynchronous these algorithms run in rounds, tolerate up to one third of…
In this paper, we propose a novel bipartite entanglement purification protocol built upon hashing and upon the guessing random additive noise decoding (GRAND) approach recently devised for classical error correction codes. Our protocol…
The quantum key distribution protocol BB84, published by C. H. Bennett and G. Brassard in 1984, describes how two spatially separated parties can generate a random bit string fully known only to them by transmission of single-qubit quantum…
This paper presents a novel leaderless protocol (FPC-BI: Fast Probabilistic Consensus within Byzantine Infrastructures) with a low communicational complexity and which allows a set of nodes to come to a consensus on a value of a single bit.…
The ability to entangle quantum systems is crucial for many applications in quantum technology, including quantum communication and quantum computing. Here, we propose a new, simple, and versatile setup for deterministically creating Bell…
The $N$-player quantum game is analyzed in the context of an Einstein-Podolsky-Rosen (EPR) experiment. In this setting, a player's strategies are not unitary transformations as in alternate quantum game-theoretic frameworks, but a classical…
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…
We describe a protocol which can be used to generate any N-partite pure quantum state using Einstein-Podolsky-Rosen (EPR) pairs. This protocol employs only local operations and classical communication between the N parties (N-LOCC). In…
At PODC 2014, A. Most\'efaoui, H. Moumen, and M. Raynal presented a new and simple randomized signature-free binary consensus algorithm (denoted here MMR) that copes with the net effect of asynchrony Byzantine behaviors. Assuming message…
We present ezBFT, a novel leaderless, distributed consensus protocol capable of tolerating byzantine faults. ezBFT's main goal is to minimize the client-side latency in WAN deployments. It achieves this by (i) having no designated primary…
This short paper presents a necessary condition for Byzantine $k$-set agreement in (synchronous or asynchronous) message-passing systems and asynchronous shared memory systems where the processes communicate through atomic single-writer…