Is there any additively homomorphic schemes that can make range proof?

I want to know whether there is any additively homomorphic schemes that can make a non-interactive range proof.

For example, I have a pair of public and private key pairs $(K_p,K_v)$ that satisfying a additively homomorphic schemes $E$, and I want to prove that the plaintext of $C=E_{K_p}(m)$ belongs to $[a,b]$, where $m, a$ and $b$ are both positive numbers. Is there any additively homomorphic schemes and non-interactive range proof scheme that I can use to prove the plaintext inside $C$ belongs to $[a,b]$.