GHZ-based Quantum Anonymous Transmission: Difference between revisions

No edit summary
Line 27: Line 27:


==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]] given below 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,
<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}}[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[n]} P[R=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[n]} P[R=i|S\notin \mathcal{A}] = \frac{1}{n-t},</math></br>
Write
262

edits