Author: JuliaM
-
Trap Code for Quantum Authentication
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…
-
Polynomial Code based Quantum Authentication
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…
-
Verifiable Quantum Anonymous Transmission
implements Anonymous Transmission Introduction This example protocol implements the task of Anonymous Transmission in a multi-node quantum network. The protocol uses an untrusted $n$-partite GHZ state to enable two nodes, Sender and Receiver, to establish a link which they use to transmit a quantum message. In addition to adversarial nodes, the source of the GHZ…
-
GHZ-based Quantum Anonymous Transmission
implements Anonymous Transmission Introduction This protocol implements the task of Anonymous Transmission in a multiple node quantum network. The protocol uses $n$-partite GHZ state to enable two nodes, sender and receiver, to establish a link which they use to transmit a quantum message. Importantly, the quantum message is transmitted in a way that the identity…
-
Prepare-and-Measure Certified Deletion
implements Quantum Encryption with Certified Deletion Introduction This protocol implements the functionality of Quantum Encryption with Certified Deletion using single-qubit state preparation and measurement. This scheme is limited to the single-use, private-key setting. Related Paper(s) Quantum encryption with certified deletion Outline The scheme consists of 5 circuits: Key: This circuit generates the key used in…
-
Quantum Secret Sharing
Functionality Description Quantum Secret Sharing (QSS) allows to transfer a quantum state (or a classical message encoded as quantum state), referred to as the secret, from Alice to Bob but only with the consent of a third-party, Charlie. A QSS protocol is generalizable to an arbitrary number of parties consisting of one sender, one recipient,…
-
Quantum Encryption with Certified Deletion
Functionality Description This functionality allows encryption of classical data into a quantum ciphertext so that the recipient of the ciphertext can produce a deletion certificate (a classical string) which proves to the originator that the recipient can no longer obtain the original plaintext should the decryption key be revealed. A Certified Deletion Encryption (CDE) scheme…
-
Quantum Conference Key Agreement
Functionality Description Conference key agreement (CKA), or multipartite key distribution is a cryptographic task where more than two parties wish to establish a common secret key. It is possible to compose bipartite QKD protocols to accomplish this task. However, protocols based on multipartite quantum correlations may be more efficient and practical in future large scale…
-
Entanglement Routing
Functionality Description Entanglement routing allows a quantum network to generate long distance entanglement between two or multiple nodes. A Quantum router is a device used to transmit quantum information over long distances along a quantum network using entanglement swapping between routers. As quantum information transmissivity decays exponentially in function of the distance, quantum routers are…
-
Quantum Electronic Voting
Functionality Description (Quantum) E-voting allows the process of vote casting and counting with the help of quantum communication and quantum mechanical systems. This functionality comes with a guarantee that votes remain secret i.e. no one can link a voter to his vote, and comes with properties of verifiability and impossibility of double voting. Electronic voting…
