Major conjectures used to prove complexity lower bounds?
The unique games conjecture has recently been one of the most fruitful assumptions for proving good lower bounds, although it is more controversial than most assumptions about complexity class separation.  See On the Unique Games Conjecture for a list of consequences.