Anonymous transmission in a noisy quantum network using the W state: Difference between revisions
Line 28: | Line 28: | ||
==Protocol Description== | ==Protocol Description== | ||
<!-- Mathematical step-wise protocol algorithm helpful to write a subroutine. --> | <!-- Mathematical step-wise protocol algorithm helpful to write a subroutine. --> | ||
; Collision detection | |||
: Nodes run the classical collision detection protocol [9] to determine a single sender <math>S</math>. All nodes input 1 if they do wish to be the sender and 0 otherwise. If a single node wants to be the sender, continue. | |||
; Receiver notification | |||
: Nodes run the classical receiver notification protocol [9], where the receiver <math>R</math> is notified of her role. | |||
; State distribution | |||
: A trusted source distributes the <math>N</math>-partite <math>W</math> state. | |||
; Measurement | |||
: All nodes except for <math>S</math> and <math>R</math> measure in the {|0〉,|1〉} basis. | |||
; Anonymous announcement of outcomes | |||
: Nodes use the classical veto protocol [9] which outputs 0 if all the <math>N-2</math> measurement outcomes are 0, and 1 otherwise. If the output is 0 then anonymous entanglement is established, else abort. | |||
; Teleportation | |||
: Sender <math>S</math> teleports the message state |ψ〉 to the receiver <math>R</math>. Classical messagemassociated with teleportationis sent anonymously. The communication is carried outusing the classical logical OR protocol [9] which computes <math>m \oplus rand</math>, where <math>rand</math> is a random 2-bit string input by the receiver <math>R</math>. | |||
==Further Information== | ==Further Information== |
Revision as of 09:05, 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
- Collision detection
- Nodes run the classical collision detection protocol [9] to determine a single sender . All nodes input 1 if they do wish to be the sender and 0 otherwise. If a single node wants to be the sender, continue.
- Receiver notification
- Nodes run the classical receiver notification protocol [9], where the receiver is notified of her role.
- State distribution
- A trusted source distributes the -partite state.
- Measurement
- All nodes except for and measure in the {|0〉,|1〉} basis.
- Anonymous announcement of outcomes
- Nodes use the classical veto protocol [9] which outputs 0 if all the measurement outcomes are 0, and 1 otherwise. If the output is 0 then anonymous entanglement is established, else abort.
- Teleportation
- Sender teleports the message state |ψ〉 to the receiver . Classical messagemassociated with teleportationis sent anonymously. The communication is carried outusing the classical logical OR protocol [9] which computes , where is a random 2-bit string input by the receiver .
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.