How can we define division operation by using Fully homomorphic encryption
In case some assistance from plaintext holder is available:
(1) choose a random, multiply it with the plaintext and also homomoprhic-encrypt the random;
(2) calculate inverse of the product in clear (no encryption);
(3) multiply encrypted random by the inverse.
This is not exactly division, still it outputs the inverse.