The well-known Shamir secret sharing scheme uses polynomial interpolation to recover a shared secret. The scheme and its application to secure computation generalizes to algebraic curve based schemes (Chen-Cramer 2006). For secure computation against an active adversary a scheme needs to be strongly multiplicative. We show that this can be achieved by using what we call strongly self-orthogonal codes. (Joint work with various authors)