On the Complexity of Random Satisfiability Problems with Planted Solutions