The Minimum Enclosing Ball (MEB) problem is one of the most fundamental problems in clustering, with applications in operations research, statistics and computational geometry. In this works, we give the first differentially private (DP) fPTAS for the Minimum Enclosing Ball problem, improving both on the runtime and the utility bound of the best known DP-PTAS for the problem, of Ghazi et al. (2020). Given $n$ points in $\R^d$ that are covered by the ball $B(θ_{opt},r_{opt})$, our simple iterative DP-algorithm returns a ball $B(θ,r)$ where $r\leq (1+γ)r_{opt}$ and which leaves at most $\tilde O(\frac{\sqrt d}{γε})$ points uncovered in $\tilde O(\nicefrac n {γ^2})$-time. We also give a local-model version of our algorithm, that leaves at most $\tilde O(\frac{\sqrt {nd}}{γε})$ points uncovered, improving on the $n^{0.67}$-bound of Nissim and Stemmer (2018) (at the expense of other parameters). In addition, we test our algorithm empirically and discuss future open problems.