In this paper, we suggest protocols for secure computation of the sum, product,
and some other functions of two or more elements of an arbitrary constructible ring,
without using any one-way functions. A new input that we offer here is that, in
contrast with other proposals, we conceal “intermediate results” of a computation.
For example, when we compute the sum of k numbers, only the final result is known
to the parties; partial sums are not known to anybody. Other applications of our
method include voting/rating over insecure channels and a rather elegant and efficient
solution of the “two millionaires problem”.