Separating Logspace from Polynomial time
Circuit depth lower bounds (equivalently, formula size lower bounds) are probably the most natural approach:  A Super-$\log^2(n)$ depth lower bound for a problem in $\mathsf P$ would separate $\mathsf P$ from $\mathsf L$, and the Karchmer-Wigderson communication complexity technique may be the natural one for that.