Complexity theoretic limitations on learning DNF's

Using the recently developed framework of [Daniely et al], we show that under a natural assumption on the complexity of refuting random K-SAT formulas, learning DNF formulas is hard. Furthermore, the same assumption entails the hardness of virtually all learning problems that were previously shown hard under cryptographic assumptions.