Name: Anonymous 2013-08-09 2:16
Is it possible to prevent a chat server from knowing who is talking to who?
such that there exists a function negl such that
Pr[A(x,y)=1] < 1/2+negl(x,y)
where Pr is probability and A outputs 1 if the server can correctly guess if x and y are communicating. negl is defined as asymptotically negligible (i.e. negl<1/p(x) where p is some polynomial).
such that there exists a function negl such that
Pr[A(x,y)=1] < 1/2+negl(x,y)
where Pr is probability and A outputs 1 if the server can correctly guess if x and y are communicating. negl is defined as asymptotically negligible (i.e. negl<1/p(x) where p is some polynomial).