We show that the size of a minimal zero test set for $t$-sparse $n$-variate polynomials over ${\mathbb F}_3$ is of order $(2n)^{\lfloor \log t \rfloor} (1 + \Theta(1/n))$, thereby significantly improving the best previously known lower bound ([5]).