Common Contracts

2 similar null contracts

A novel remote user authentication and key agreement scheme for mobile client- server environment
March 26th, 2013
  • Filed
    March 26th, 2013

of 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.

AutoNDA by SimpleDocs
A novel remote user authentication and key agreement scheme for mobile client- server environment
March 26th, 2013
  • Filed
    March 26th, 2013

of 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.

Time is Money Join Law Insider Premium to draft better contracts faster.