Information-theoretic Lower Bounds for Convex Optimization with Erroneous Oracles