124
click to vote
TCC
2009
Springer
16 years 3 months ago
2009
Springer
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 o...