Write
262
edits
Line 22: | Line 22: | ||
<math>P_{\text{guess}}[S|C,S\notin \mathcal{A}] \leq \max_{i\in[n]} P[S=i|S\notin \mathcal{A}].</math></br> | <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[n]} P[R=i|R\notin \mathcal{A}]</math>. | <math>P_{\text{guess}}[R|C,R\notin \mathcal{A}] \leq \max_{i\in[n]} P[R=i|R\notin \mathcal{A}]</math>.</br> | ||
The above definitions are general and hold for any adversarial scenario, in particular for an [[active adversary]]. | |||
==Further Information== | ==Further Information== |