# How to do division using Beaver Multiplication Triples

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

$$[a]\leftarrow\{0,1\}^n, [b]\leftarrow\{0,1\}^n$$

And we want to securely compute

$$c= \Bigl\lfloor\dfrac{a}{b}\Bigr\rfloor$$

where $$c$$ is an integer.

So my question is : How to design a such division protocol, or is there any papers? Thanks a lot.