Anonymous transmission in a noisy quantum network using the W state: Difference between revisions
No edit summary |
|||
Line 14: | Line 14: | ||
==Outline== | ==Outline== | ||
<!-- A non-mathematical detailed outline which provides a rough idea of the concerned protocol --> | <!-- A non-mathematical detailed outline which provides a rough idea of the concerned protocol --> | ||
The <math>N</math> nodes first ensure that a single one is willing to send information. They go on with notifying the receiver of its role. They use a trusted source of <math>W</math> states to share entanglement between the <math>N</math> nodes. This is done via a measurement performed by all nodes except the sender and receiver. Entanglement is only established probabilistically, but when it is successful, it can be used to teleport an arbitrary quantum state chosen by <math>S</math>. The classical communication for teleporting the state is performed anonymously. | |||
==Notation== | ==Notation== |
Revision as of 08:32, 12 November 2021
The protocol allows a sender to transmit an arbitrary quantum state to a receiver in an anonymous way and uses the -partite state as a quantum resource.
Assumptions
The protocol relies on a set of classical subroutines (collision detection, receiver notification, veto and logical OR). Their proposed implementation [1] has been shown to be information-theoretically secure in the classical regime, even with an arbitrary number of corrupted participants, assuming the parties share pairwise authenticated private channels and a broadcast channel.
The protocol assumes that the implementations listed above remain secure even in the presence of a quantum adversary.
Outline
The nodes first ensure that a single one is willing to send information. They go on with notifying the receiver of its role. They use a trusted source of states to share entanglement between the nodes. This is done via a measurement performed by all nodes except the sender and receiver. Entanglement is only established probabilistically, but when it is successful, it can be used to teleport an arbitrary quantum state chosen by . The classical communication for teleporting the state is performed anonymously.
Notation
Knowledge Graph
Properties
Protocol Description
Further Information
References
- A. Broadbent and A. Tapp, inAdvances in Cryptology– ASIACRYPT 2007, edited by K. Kurosawa (Springer Berlin Heidelberg, Berlin, Heidelberg, 2007) pp. 410–426.