Write
262
edits
Anonymous Transmission: Difference between revisions
→Properties
m (Bob moved page Quantum Anonymous Transmission to Anonymous Transmission) |
|||
| Line 16: | Line 16: | ||
==Properties== | ==Properties== | ||
Security of a anonymous transmission protocol is defined in terms of the guessing probability, i.e., the maximum probability that adversaries guess the identity of the sender <math>S</math> or receiver <math>R</math> given all the classical and quantum information they have available at the end of the protocol. | Security of a anonymous transmission protocol is defined in terms of the guessing probability, i.e., the maximum probability that adversaries guess the identity of the sender <math>S</math> or receiver <math>R</math> given all the classical and quantum information they have available at the end of the protocol. | ||
*'''Guessing probability''' Let <math>\mathcal{A}</math> be a subset of adversaries among <math> | *'''Guessing probability''' Let <math>\mathcal{A}</math> be a subset of adversaries among <math>n</math> nodes. Let <math>C</math> be the register that contains all classical and quantum side information accessible to the adversaries. Then, the probability of adversaries guessing the sender is given by | ||
<math> P_{\text{guess}}[S|C, S\notin \mathcal{A}] = \max_{\{M^i\}} \sum_{i \in [ | <math> P_{\text{guess}}[S|C, S\notin \mathcal{A}] = \max_{\{M^i\}} \sum_{i \in [n]} P[S=i|S\notin \mathcal{A}] \text{Tr}[M^i \cdot \rho_{C|S=i} ],</math></br> | ||
where the maximization is taken over the set of POVMs <math>{\{M^i\}}</math> for the adversaries and <math>\rho_{C|S=i}</math> is the state of the adversaries at the end of the protocol, given that node <math>i</math> is the sender | where the maximization is taken over the set of POVMs <math>{\{M^i\}}</math> for the adversaries and <math>\rho_{C|S=i}</math> is the state of the adversaries at the end of the protocol, given that node <math>i</math> is the sender | ||
*'''Sender-security''' We say that an anonymous transmission protocol is ''sender-secure'' if, given that the sender is honest, the probability of the adversary guessing the sender is </br> | *'''Sender-security''' We say that an anonymous transmission protocol is ''sender-secure'' if, given that the sender is honest, the probability of the adversary guessing the sender is </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}].</math></br> | ||
*'''Receiver-security''' We say that an anonymous transmission protocol is ''receiver-secure'' if, given that the receiver is honest, the probability of the adversary guessing the receiver is:</br> | *'''Receiver-security''' We say that an anonymous transmission protocol is ''receiver-secure'' if, given that the receiver is honest, the probability of the adversary guessing the receiver is:</br> | ||
<math>P_{\text{guess}}[R|C,R\notin \mathcal{A}] \leq \max_{i\in[ | <math>P_{\text{guess}}[R|C,R\notin \mathcal{A}] \leq \max_{i\in[n]} P[R=i|R\notin \mathcal{A}]</math> | ||
==Further Information== | ==Further Information== | ||