Category: Protocols

implements Quantum Electronic Voting Introduction This protocol implements the functionality of Quantum Electronic Voting. The protocol uses two entangled qudits, one as a blank ballot that travels from voter to voter and the second one for computing the election result. The first quantum scheme in this category was introduced by Vaccaro[1] and later improved by[2,3]…

implements Coin Flipping Introduction This protocol allows two remote participants to share a uniformly distributed random bit. The parties do not trust each other and can only use classical and quantum channels to communicate. The protocol allows them to perform what coin tossing for nearby parties performs without the involvement of any trusted third party.…

implements Quantum Electronic Voting Introduction This protocol [1] implements the task of quantum E-voting. The participants in this family of protocols are one or more election authorities, the tallyer, and the voters. The election authorities are only trusted for the purpose of eligibility, and the voters do not share any entangled states with either the…

implements Bit Commitment Introduction This protocol achieves the task of bit commitment securely by using a relativistic scheme. In bit commitment, the committer “commits” to a particular bit value. The receiver knows nothing about the committed bit value until the committer chooses to do so (hiding property). The receiver has a guarantee that once committed,…

implements Quantum Electronic Voting Introduction This protocol[1] achieves the functionality of Quantum Electronic Voting. In this protocol, an untrusted multipartite entanglement source can be used to carry out an election without any election authorities. Related Paper(s) Quantum protocol for electronic voting without election authorities Outline In the first phase of the protocol, each agent is…

implements Byzantine Agreement Introduction This protocol is an efficient solution to the classical task of Byzantine Agreement. It allows multiple players in a network to reach an agreement in the presence of some faulty players. The protocol solves the task in the strongest possible failure model (called Byzantine failures). The quantum protocol is provably faster…

implements Weak String Erasure Introduction This protocol implements Weak String Erasure (WSE) in a prepare-and-measure setup. This is often used as a subroutine in other protocols. Related Paper(s) Unconditional Security From Noisy Quantum Storage Outline Alice and Bob first agree on a duration $\Delta_t$ that should correspond to an estimation of the time needed to…

implements Authentication of Quantum Messages Introduction The Trap Code is a non-interactive scheme for quantum authentication. It appends two additional trap registers in a fixed state, on which a Pauli twirl or a permutation is acted on. It furthermore makes use of error correction codes for encoding the quantum message.   Related Paper(s) acheck Outline…

implements Entanglement Routing Introduction This protocol [1] implements the functionality of Entanglement Routing. They develop routing protocols considering different types of path discovery algorithms, considering a continuous model in which entanglement between a subset of the nodes is produced continuously in the background and an on-demand model where entanglement production starts when a request is…

implements Authentication of Quantum Messages Introduction This protocol provides a non-interactive scheme with classical keys for the sender to encrypt as well as authenticate quantum messages. This was to achieve the task of authentication for quantum states, i.e. it gives the guarantee that the message sent by a party (suppliant) over a communication line is…