Matrix refreshing provides leakage-resilient computation under continual local leakage
A simple refresh mechanism using uniform invertible matrices secures shares against local leakage achieving statistical distance at most C·T·2^{6λ-n/9} after T refreshes with λ bits leakage per party.