Tag Info

New answers tagged

2

As the previous answer says, they are certainly NOT the same. However, there is certainly a connection between them. Specifically, the covert model just says that there is a deterrent parameter $\epsilon$ and the guarantee is that if the adversary tries to cheat then it will be caught with probability at least $\epsilon$. The question that arises is how ...


5

It's not possible because if $B$ knows $b$ and $g^{ab}$, then she can compute $\left(g^{ab}\right)^{b^{-1} \bmod N} = g^a$ (where $N$ is the order of $g$, which is normally prime so that $b^{-1} \bmod N$ exists). EDIT: As noted by poncho in the comments, this assumes we are in a typical discrete logarithm setting, where the order of the group is prime to ...


1

1- $\:$ I believe correctness does not have an exact meaning in this context. It would certainly involve not letting the distinguisher see the transcript, and might involve not letting the distinguisher see the adversary's randomness, and possibly involved not even letting the distinguisher see the auxiliary input. 2- $\:$ ...



Top 50 recent answers are included