Various forms of the extension problem are discussed for linear codes de ned over nite rings. The extension theorem for symmetrized weight compositions over nite Frobenius rings is...
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...