Is Square DH hard in Bilinear Groups?
This assumption has been used in cryptographic constructions.  Both the computational and decisions are generally believed hard by the provable security community, but I doubt a reduction to, e.g., DH will be found.  See http://homepage.ruhr-uni-bochum.de/Eike.Kiltz/papers/dh_full.pdf for discussion and references.