Complexity class NP and MA
The same hardness assumption that implies P=BPP also implies NP=MA (at least according to the complexity zoo).

Even if the hardness assumption is wrong, separating NP from MA would be a huge achievement, since it would imply that P is different from NP (as MA is in the polynomial hierarchy).