I've seen that it's widely accepted that before Gentry's breakthrough (which is not practical yet) in 2009 there were no known full homomorphic encryption scheme.
I've read here in another answer that:
"...there are many known partially homomorphic cryptosystems, each one can either multiply or add numbers."
Now here on some interactive webpage allowing to test Paillier here:
I can do [(A+B)*C], hence doing both addition and multiplication (?).
Why is Paillier not fully homomorphic seen that it can do both addition and multiplication?