How to withstand mobile virus attacks (extended abstract)

Rafail Ostrovsky, Moti M. Yung · 1991

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

Read the paper · More papers on PaperTik