论文信息 - How To Withstand Mobile Virus Attacks

How To Withstand Mobile Virus Attacks

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.

Rafail Ostrovsky | Moti Yung | R. Ostrovsky | M. Yung

[1] Algirdas Avizienis,et al. A fault tolerance approach to computer viruses , 1988, Proceedings. 1988 IEEE Symposium on Security and Privacy.

[2] Donald Beaver,et al. Multiparty Computation with Faulty Majority , 1989, CRYPTO.

[3] Silvio Micali,et al. The round complexity of secure protocols , 1990, STOC '90.

[4] Dorothy E. Denning,et al. An Intrusion-Detection Model , 1987, IEEE Transactions on Software Engineering.

[5] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.

[6] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.

[7] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[8] Paul A. Karger,et al. Limiting the Damage Potential of Discretionary Trojan Horses , 1987, 1987 IEEE Symposium on Security and Privacy.

[9] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.

[10] A. Kohn. [Computer viruses]. , 1989, Harefuah.

[11] Silvio Micali,et al. Optimal algorithms for Byzantine agreement , 1988, STOC '88.