Abstract
We initiate a study of distributed adversarial model of computation in which faults are non-stationary and can move through the network, analogous to a spread of a virus or a worm. We show how local computations (at each processor) and global computations can be made robust using a constant factor resilience and a polynomial factor redundancy in the computation.