# Are there groups where the computational Diffie Hellman problem is easy but the discrete log problem is hard?

I know that there are elliptic curve groups, used in pairing-based cryptography, where the decisional Diffie Hellman problem (ie. given $g$, $g^a$, $g^b$ and $c$, determine if $c = g^{ab}$ is easy but the computational Diffie Hellman problem (given $g$, $g^a$ and $g^b$, find $g^{ab}$) is hard, and I know that if you can solve the discrete log problem (given $g$ and $g^a$ find $a$) you can do both.

But are there groups where you can fairly easily do the Computational Diffie Hellman problem but it's hard to find a discrete log?

-
Welcome to CSE! Notice that formulas can be written in (La)Tex, e.g. $g^{ab}$ renders as $g^{ab}$. –  fgrieu Jan 20 at 11:13
AFAIK there are no know groups where this is the case, but we know no proof that shows they don't exist either. –  CodesInChaos Jan 20 at 14:23