Write
262
edits
GHZ-based Quantum Anonymous Transmission: Difference between revisions
no edit summary
No edit summary |
|||
| Line 1: | Line 1: | ||
The GHZ-based quantum anonymous transmission protocol implements the task of [[Quantum Anonymous Transmission]] in a <math> | The GHZ-based quantum anonymous transmission protocol implements the task of [[Quantum Anonymous Transmission]] in a <math>n</math>-node quantum network. The protocol uses <math>n</math>-partite [[GHZ state]] to enable two parties, sender <math>S</math> and receiver <math>R</math>, to establish a link which they use to transmit a quantum message. Importantly, the quantum message is transmitted in a way that the identity of <math>S</math> is unknown to every other node, and the identity of <math>R</math> is known only to <math>S</math>. | ||
'''Tags:''' [[:Category: Quantum Enhanced Classical Functionality|Quantum Enhanced Classical Functionality]][[Category: Quantum Enhanced Classical Functionality]], [[:Category: Multi Party Protocols|Multi Party Protocols]] [[Category: Multi Party Protocols]], [[:Category:Specific Task|Specific Task]][[Category:Specific Task]], GHZ state, anonymous transmission | '''Tags:''' [[:Category: Quantum Enhanced Classical Functionality|Quantum Enhanced Classical Functionality]][[Category: Quantum Enhanced Classical Functionality]], [[:Category: Multi Party Protocols|Multi Party Protocols]] [[Category: Multi Party Protocols]], [[:Category:Specific Task|Specific Task]][[Category:Specific Task]], GHZ state, anonymous transmission | ||
| Line 11: | Line 11: | ||
The presented GHZ-based quantum anounymous transmission protocol is based on the work of [[GHZ State based Quantum Anonymous Transmission#Refrences|(6)]]. The goal of the protocol is to transmit a quantum state <math>|\psi</math> from the sender <math>S</math> to the receiver <math>R</math>, while keeping the identities of <math>S</math> and <math>R</math> anonymous. We assume that there is exactly one receiver which is determined before the start of the protocol. The protocol consists of the following steps. | The presented GHZ-based quantum anounymous transmission protocol is based on the work of [[GHZ State based Quantum Anonymous Transmission#Refrences|(6)]]. The goal of the protocol is to transmit a quantum state <math>|\psi</math> from the sender <math>S</math> to the receiver <math>R</math>, while keeping the identities of <math>S</math> and <math>R</math> anonymous. We assume that there is exactly one receiver which is determined before the start of the protocol. The protocol consists of the following steps. | ||
* ''Collision detection:'' Nodes run a collision detection protocol to determine a single sender <math>S</math>. | * ''Collision detection:'' Nodes run a collision detection protocol to determine a single sender <math>S</math>. | ||
* ''State distribution:'' A trusted source distributes the <math> | * ''State distribution:'' A trusted source distributes the <math>n</math>-partite GHZ state. | ||
* ''Anonymous entanglement:'' <math> | * ''Anonymous entanglement:'' <math>n-2</math> nodes (all except for <math>S</math> and <math>R</math>) measure in the <math>X</math> basis and broadcast their measurement outcome. <math>S</math> and <math>R</math> broadcast random dummy bits. The parity of measurement outcomes allows to establish an entangled link between <math>S</math> and <math>R</math> which is called [[anonymous entanglement]] (AE). | ||
* ''Teleportation:'' Sender <math>S</math> teleports the message state <math>|\psi\rangle</math> to the receiver <math>R</math> using the established anonymous entanglement. Classical message <math>m</math> associated with teleportation is also sent anonymously. | * ''Teleportation:'' Sender <math>S</math> teleports the message state <math>|\psi\rangle</math> to the receiver <math>R</math> using the established anonymous entanglement. Classical message <math>m</math> associated with teleportation is also sent anonymously. | ||
==Notation== | ==Notation== | ||
* <math> | * <math>n</math> number of network nodes taking part in the anonymous transmission. | ||
* <math>|\psi\rangle</math> quantum message which the sender wants to send anonymously | * <math>|\psi\rangle</math> quantum message which the sender wants to send anonymously | ||
* <math>S</math> the sender of the quantum message | * <math>S</math> the sender of the quantum message | ||
| Line 28: | Line 28: | ||
==Properties== | ==Properties== | ||
See [[Quantum Anonymous Transmission]] for the precise security definition. [[GHZ State based Quantum Anonymous Transmission#Pseudocode|Pseudocode]] implements secure anonymous transmission, i.e. it hides the identities of the sender and the receiver from other nodes in the network. That is, the maximum probability that adversaries guess the identity of <math>S</math> or <math>R</math> given all the classical and quantum information they have available at the end of the protocol is no larger than the uncertainty the adversaries have about the identities of <math>S</math> and <math>R</math> before the protocol begins. More formally, the anonymous transmission protocol with the GHZ state, [[GHZ State based Quantum Anonymous Transmission#Pseudocode|Pseudocode]], is sender- and receiver-secure:</br> | See [[Quantum Anonymous Transmission]] for the precise security definition. [[GHZ State based Quantum Anonymous Transmission#Pseudocode|Pseudocode]] implements secure anonymous transmission, i.e. it hides the identities of the sender and the receiver from other nodes in the network. That is, the maximum probability that adversaries guess the identity of <math>S</math> or <math>R</math> given all the classical and quantum information they have available at the end of the protocol is no larger than the uncertainty the adversaries have about the identities of <math>S</math> and <math>R</math> before the protocol begins. More formally, the anonymous transmission protocol with the GHZ state, [[GHZ State based Quantum Anonymous Transmission#Pseudocode|Pseudocode]], is sender- and receiver-secure:</br> | ||
<math>P_{\text{guess}}[S|C,S\notin \mathcal{A}] \leq \max_{i\in[ | <math>P_{\text{guess}}[S|C,S\notin \mathcal{A}] \leq \max_{i\in[n]} P[S=i|S\notin \mathcal{A}] = \frac{1}{n-t},</math></br> | ||
<math>P_{\text{guess}}[R|C,S\notin \mathcal{A}] \leq \max_{i\in[ | <math>P_{\text{guess}}[R|C,S\notin \mathcal{A}] \leq \max_{i\in[n]} P[R=i|S\notin \mathcal{A}] = \frac{1}{n-t},</math></br> | ||
where <math>\mathcal{A}</math> is the subset of <math>t</math> adversaries among <math> | where <math>\mathcal{A}</math> is the subset of <math>t</math> adversaries among <math>n</math> nodes and <math>C</math> is the register that contains all classical and quantum side information accessible to the adversaries. Note that this implies that the protocol is also traceless, since even if the adversary hijacks any <math>t\leq n-2</math> players and gains access to all of their classical and quantum information after the end of the protocol, she cannot learn the identities of <math>S</math> and <math>R</math>. For a formal argument see [[GHZ State based Quantum Anonymous Transmission#References|(6)]]. | ||
==Pseudo Code== | ==Pseudo Code== | ||
Receiver <math>R</math> is determined before the start of the protocol. <math>S</math> holds a message qubit <math>|\psi\rangle</math>. | Receiver <math>R</math> is determined before the start of the protocol. <math>S</math> holds a message qubit <math>|\psi\rangle</math>. | ||
# Nodes run a collision detection protocol and determine a single sender <math>S</math>. | # Nodes run a collision detection protocol and determine a single sender <math>S</math>. | ||
# A trusted source distributes <math> | # A trusted source distributes <math>n</math>-partite GHZ state to every player, <math>|GHZ\rangle = \frac{1}{\sqrt{2}} (|0^n\rangle + |1^n\rangle)</math>. | ||
* Anonymous entanglement: | * Anonymous entanglement: | ||
## Sender <math>S</math> and receiver <math>R</math> do not do anything to their part of the state. | ## Sender <math>S</math> and receiver <math>R</math> do not do anything to their part of the state. | ||
## Every player <math>j \in [ | ## Every player <math>j \in [n] \setminus \{S,R\}</math>: | ||
### Applies a Hadamard transform to her qubit, | ### Applies a Hadamard transform to her qubit, | ||
### Measures this qubit in the computational basis with outcome <math>m_j</math>, | ### Measures this qubit in the computational basis with outcome <math>m_j</math>, | ||
| Line 45: | Line 45: | ||
## <math>S</math> applies a phase flip <math>Z</math> to her qubit if <math>b=1</math>. | ## <math>S</math> applies a phase flip <math>Z</math> to her qubit if <math>b=1</math>. | ||
## <math>R</math> picks a random bit <math>b' \in_R \{ 0,1 \}</math> and broadcasts <math>b'</math>. | ## <math>R</math> picks a random bit <math>b' \in_R \{ 0,1 \}</math> and broadcasts <math>b'</math>. | ||
## <math>R</math> applies a phase flip <math>Z</math> to her qubit, if <math>b \oplus \bigoplus_{j \in [ | ## <math>R</math> applies a phase flip <math>Z</math> to her qubit, if <math>b \oplus \bigoplus_{j \in [n] \setminus \{S,R\}} m_j = 1</math>. <div style='text-align: right;'>''<math>S</math> and <math>R</math> share anonymous entanglement <math>|\Gamma\rangle_{SR} = \frac{1}{\sqrt{2}} (|00\rangle + |11\rangle)</math>.''</div> | ||
# <math>S</math> uses the quantum teleportation circuit with input <math>|\psi\rangle</math> and anonymous entanglement <math>|\Gamma\rangle_{SR}</math>, and obtains measurement outcomes <math>m_0, m_1</math>. | # <math>S</math> uses the quantum teleportation circuit with input <math>|\psi\rangle</math> and anonymous entanglement <math>|\Gamma\rangle_{SR}</math>, and obtains measurement outcomes <math>m_0, m_1</math>. | ||
# The players run a protocol to anonymously send bits <math>m_0,m_1</math> from <math>S</math> to <math>R</math> (see Discussion for details). | # The players run a protocol to anonymously send bits <math>m_0,m_1</math> from <math>S</math> to <math>R</math> (see Discussion for details). | ||
| Line 51: | Line 51: | ||
==Further Information== | ==Further Information== | ||
* To determine the sender <math>S</math> (Step 1) one can run either a classical collision detection protocol of [[GHZ State based Quantum Anonymous Transmission#References|(4)]] or a quantum collision detection protocol of [[GHZ State based Quantum Anonymous Transmission#References|(6)]]. The quantum version of the protocol requires additional <math>(\left\lceil \log | * To determine the sender <math>S</math> (Step 1) one can run either a classical collision detection protocol of [[GHZ State based Quantum Anonymous Transmission#References|(4)]] or a quantum collision detection protocol of [[GHZ State based Quantum Anonymous Transmission#References|(6)]]. The quantum version of the protocol requires additional <math>(\left\lceil \log n \right\rceil + 1)</math> GHZ states. | ||
* To determine the receiver <math>R</math> during the protocol one can incorporate an additional step using a classical receiver notification protocol of [[GHZ State based Quantum Anonymous Transmission#References|(4)]]. | * To determine the receiver <math>R</math> during the protocol one can incorporate an additional step using a classical receiver notification protocol of [[GHZ State based Quantum Anonymous Transmission#References|(4)]]. | ||
* To send classical teleportation bits <math>m_0,m_1</math> (Step 5) the players can run a classical logical OR protocol of [[GHZ State based Quantum Anonymous Transmission#References|(4)]] or anonymous transmission protocol for classical bits with quantum resources of [[GHZ State based Quantum Anonymous Transmission#References|(6)]]. The quantum protocol requires one additional GHZ state for transmitting one classical bit. | * To send classical teleportation bits <math>m_0,m_1</math> (Step 5) the players can run a classical logical OR protocol of [[GHZ State based Quantum Anonymous Transmission#References|(4)]] or anonymous transmission protocol for classical bits with quantum resources of [[GHZ State based Quantum Anonymous Transmission#References|(6)]]. The quantum protocol requires one additional GHZ state for transmitting one classical bit. | ||