Superpolynomial circuit lower bounds for NP

Does there exist a language $L\in NP$ such that every family of Boolean circuits deciding $L$ has superpolynomial size?

Equivalently, is $NP \not\subseteq P/poly$?