Editing GHZ-based Quantum Anonymous Transmission

Jump to navigation Jump to search
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then publish the changes below to finish undoing the edit.

Latest revision Your text
Line 30: Line 30:


==Properties==
==Properties==
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 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>
Please note that all contributions to Quantum Protocol Zoo may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see Quantum Protocol Zoo:Copyrights for details). Do not submit copyrighted work without permission!

To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:

Cancel Editing help (opens in new window)

Template used on this page: