Category: Protocols

implements Fingerprinting Introduction This protocol allows two quantum clients to distinguish between their quantum inputs while maintaining the privacy of their own input just by comparing the fingerprints of their inputs. The protocol does not permit the two parties to interact directly with each other, hence they send the fingerprints of their respective inputs to…

implements Entanglement Verification Introduction This protocol [1] implement the task of Multipartite entanglement verification in a multinode quantum network. The protocol uses classical communication and measurements of quantum states to verify whether the parties share a GHZ state. We present here a loss tolerant version of the protocol, which doesn’t assume that the source of…

implements Secure Delegated Computation Introduction This protocol [1] provides a method for computing nonlinear functions involving multiple variables using only linear classical computing and limited manipulation of quantum information. To demonstrate this protocol, the pairwise AND function is computed and can be used as a building block for other functions. Related Paper(s) Classical multiparty computation…

implements Quantum Teleportation Introduction This protocol performs the task of Quantum Teleportation by which a quantum state (or information stored in a quantum state) can be transmitted physically from one location (or one party) to another. This protocol requires sharing an entangled state like an EPR pair between two parties and also allowing the parties…

implements Quantum Digital Signature Introduction This protocol achieves the functionality of (Quantum) Digital Signatures (QDS) allowing the exchange of classical messages from sender to multiple recipients, with a guarantee that the signature has come from a genuine sender. This protocol achieves all the properties of QDS. Further it requires the parties to store quantum states…

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…