Category: Protocols

implements Quantum Key Distribution Introduction This example protocol[1] implements the task of Quantum Key Distribution (QKD). The protocol enables two parties to establish a classical secret key by preparing and measuring qubits. The output of the protocol is a classical secret key which is completely unknown to any third party, namely an eavesdropper. Related Paper(s) Quantum cryptography:…

implements Quantum Digital Signature Introduction This protocol [1] provides a quantum digital signature scheme where the public (known to all) and private (secret key preserved with the seller) keys are classical in nature, however the signature has a quantum nature. This scheme is based on public-key cryptography where the seller’s identity is used to generate…

implements Quantum Digital Signature Introduction The example protocol achieves the functionality of Quantum Digital Signature (QDS) by allowing exchange of messages using the procedure studied in Prepare and Measure Quantum Digital Signature but without trusting one’s measurement devices, thus making the protocol device independent. It uses the security proof of MDI-QKD to the QDS scheme…

implements Quantum Digital Signature Introduction This protocol [1] achieves the task of Quantum Digital Signature which allows for the exchange of single or multiple bit classical messages from sender to multiple recipients such that parties are required to prepare and measure quantum states instantly without having to store them. For simplicity, most protocols take into…

implements Secure Verifiable Client-Server Delegated Quantum Computation Introduction This protocol achieves the functionality of Secure Verifiable Delegated Quantum Computation, which enables a client with limited quantum technology to delegate a computation to an untrusted but powerful quantum server in such a manner that the privacy of the computation is maintained. This protocol introduces verifiability as…

implements Secure Client-Server Delegated Computation Introduction The example protocol achieves the functionality of Secure Client- Server Delegated Computation by assigning quantum computation to an untrusted device while maintaining privacy of the input, output and computation of the client. The client requires to be able to prepare and send quantum states while the server requires to…

implements Quantum Money Introduction The classical money scheme involves the Bank distributing notes to untrusted users. Each note has a unique serial number attached to it and this number provides a basis for the verification of the note when the user wants to use it for a transaction. However, in the classical world, nothing prevents…

implements Quantum Money Introduction This example protocol is a private-key protocol which implements Quantum Money, a unique object generated by a Trusted Third Party (TTP). It is then circulated among untrusted clients (Transferability). Each client should be able to prove the authenticity of his owned quantum money to a verifier. On the other hand, an…

implements Oblivious Transfer Introduction Oblivious transfer (OT) is a two-party cryptographic primitive described as follows: Sender sends two bits/qubits to the receiver and the receiver can choose to receive only one of them. The protocol is secure when none of the parties obtain an information they are not supposed to obtain i.e. sender does not…

implements Leader Election Introduction This protocol allows multiple remote participants to select a leader among them randomly. The parties do not trust each other and can use both classical and quantum channels to communicate. It is an extension of the coin tossing problem to multiple players. Related Paper(s) Quantum Leader Election Outline When the number…