A novel remote user authentication and key agreement scheme for mobile client- server environmentMarch 26th, 2013
FiledMarch 26th, 2013of k. To compute k, the adversary must know s or (sC, xC). However, without s and (sC, xC), computing k from Ppub and PKC − XC is as hard as solving the CDH problem. Therefore, Theorem 7 holds.
A novel remote user authentication and key agreement scheme for mobile client- server environmentMarch 26th, 2013
FiledMarch 26th, 2013of k. To compute k, the adversary must know s or (sC, xC). However, without s and (sC, xC), computing k from Ppub and PKC − XC is as hard as solving the CDH problem. Therefore, Theorem 7 holds.