Let's say that I have a plain computational process that consists of several divisions and I do not want to do it with non-interactive homomorphic encryption.

I would like to ask how can I call this process: Until a division, I do the computations non-interactively. When I face with division operation, here comes interactivity. I should send encrypted numerator and denominator to a party and get the division result back. This second party should not learn the contents of numerator and denominator.

Since I cannot call the process, I cannot find papers to read. I want to use this kind of solution, but I am new to homomorphic encryption. I have experience with non-interactive homomorphic encryption. But I would like to get experience on this interactive one.

I have no idea which scheme I can use and how to implement this.

Let's say that I have a plain computational process that consists of several divisions and I do not want to do it with non-interactive homomorphic encryption.

I would like to ask how can I call this process: Until a division, I do the computations non-interactively. When I face with division operation, here comes interactivity. I should send encrypted numerator and denominator to a party and get the division result back. This second party should not learn the contents of numerator and denominator.

Since I cannot call the process, I cannot find papers to read. I want to use this kind of solution, but I am new to homomorphic encryption. I have experience with non-interactive homomorphic encryption. But I would like to get experience on this interactive one.

I have no idea which scheme I can use and how to implement this. Do I need garbled circuits for this?