There’s several Diffie‑Hellman problems names like weak decisional Diffie Hellman problem or strong Diffie‑Hellman problem.
My case is the following : given finite field’s elements g ; d whose discrete logarithm is unknown, the attacker needs to compute integers a ; b and a' ; b' such as *g^(a)×d^b = g^(a\')×d^(b\')* where a≠a'.
What’s the name of this Diffie Hellman assumption variant ? Is it proven to be as hard as the discrete logarithm problem in the case of the elliptic’s curve variant ?