It is very straight-forward and intuitively to achieve addition, subtraction and even generalized polynomial using Beaver's Multiplication Triples. However division seems difficult to achieve on two secret-shared values (each with precision $f$).
Assuming the case of secure two-party computation, there are two secret values
And we want to securely compute
where $c$ is an integer.
So my question is : How to design a such division protocol, or is there any papers? Thanks a lot.