How can we define division operation by using Fully homomorphic encryption Last fews months, I'm working with homomorphic encryption. Now I am dealing with some computational problems with integers or real-numbers (like arithmetic mean, standard deviation) where division is necessary in homomorphic domain. Is there any practical solution of homomorphic division? I'm also looking for practical example.
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.