The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Secure Arithmetic Computation with No Honest Majority
[article]
2008
arXiv
pre-print
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case of two-party protocols with security against malicious parties, our main goals are to: (1) only make black-box calls to the ring operations and standard cryptographic primitives, and (2) minimize the number of such black-box calls as well as the communication overhead. We present several solutions which differ in their
arXiv:0811.0475v3
fatcat:4jjh2trvqvdutll35lb7cnd44i