Category: QuantumProtocolZoo

implements Interactive Verification of Quantum Computation Introduction The aim of the protocol is to verify NP-complete problems in the context of communication complexity, so in the case in which the amount of communication between the involved parties is a resource. By definition, if a problem is in NP then it is possible to verify efficiently…

implements Copy Protection Introduction This protocol achieves the functionality of Copy Protection allowing a Vendor to send a program to a Client such that the Client cannot duplicate it.  Related Paper(s) Quantum copy-protection of compute-and-compare programs in the quantum random oracle model Outline Any Copy Protection protocol consists of two algorithms: Protect and Eval. For the family of…

implements Copy Protection Introduction This protocol achieves the functionality of Copy Protection allowing a Vendor to send a program to a Client such that the Client cannot duplicate it. This protocol, in particular, achieves copy-protection for ‘compute-and-compare’ programs. Related Paper(s) Quantum copy-protection of compute-and-compare programs in the quantum random oracle model Outline Any Copy Protection…

implements Quantum Electronic Voting Introduction This protocol implements the functionality of Quantum E-voting. The protocol uses an entangled state with a special property as a blank ballot and is self-tallying, i.e. the voters, without the presence of any trusted authority or tallier, need to verify that they share specific quantum states. Related Paper(s) Self-tallying quantum…

implements Coin Flipping Introduction Quantum Weak Coin Flipping (QWCF) is a cryptographic primitive that allows two remote and distrustful parties, Alice and Bob, to generate a random bit, such that each party has a known and opposite preferred outcome. In other words, the outcome of the flip will designate a winner and a loser. The…

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…