How to withstand mobile virus attacks

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 1991, Pages 51-59

  Ostrovsky, Rafail ^a   Yung, Moti ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VIRUSES; VIRUSES;

CONSTANT FACTORS; LOCAL COMPUTATION; MODEL OF COMPUTATION; NONSTATIONARY; POLYNOMIAL FACTOR; VIRUS ATTACKS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 85027164480     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/112600.112605     Document Type: Conference Paper

References (31)

1. L. Adelman Abstract Theory of Computer Viruses CRYPTO 88.
2. Bar Ilan J. and D. Beaver, Non-Cryptographic Secure Computation in Constant Rounds PODC 1989, ACM .
3. Beaver D., S. Micali and P. Rogaway, The Round Complexity of Secure Protocols, STOC 1990, ACM, pp. 503-513.
4. Beaver D., S. Goldwasser Multiparty Computation with Faulty Majority FOCS 1989, IEEE, pp. 468-473.
5. Ben-Or M., S. Goldwasser and A. Wigderson, Completeness Theorem for Noncryptographic Fault-tolerant Distributed Computing, STOC 1988, ACM, pp. 1-10.
6. Ben-Or M. and G. El-Yaniv., Manuscript.
7. D. Chaum, C. Crepeau and I. Damgard, Multiparty Unconditionally Secure Protocols, STOC 1988, ACM, pp. 11-19.
8. F. Cohen, Computer Viruses, P h. D. dissertation, UCS, 1986.
9. I. Cidon, I. Goapl, and S. Kutten, New Models and Algorithms for Future Networks, 7th ACM PODC, pp. 75-89.
10. D. Denning, An Intrusion-Detection Model, IEEE Sym. on Security and Privacy, 1986, pp. 118-131.
11. E. W. Dijkstra, Self-Stabilizing Systems in spite of Distributed Control, CACM1, 1974, pp. 643-644.
12. D. Dolev, C. Dwork, O. Waarts and M. Yung, Perfectly Secure Message Transmission, FOCS 1990, IEEE.
13. J. Driscoll, N. Sarnak, D. Sleator, and R. Tarjan, Making Data Structure Persistent, STOC 1986, ACM.
14. M. Eichin and J. Rochlis, With Microscope and Tweezers: An Analysis of the Internet Virus of November 1988, IEEE Sym. on Security and Privacy, 1989, pp. 326-343.
15. P. Feldman and S. Micali, An Optimal Algorithms For Synchronous Byzantine Agreement, STOC 1988, ACM, pp. 148-161.
16. P. Feldman Optimal Algorithms for Byzantine Agreement, MIT Ph.D. Thesis, 1988.
17. M. Franklin and M. Yung, Parallel Secure Distributed Computing, manuscript.
18. Z. Galil, S. Haber and M. Yung, Cryptographic Computations and the Public-Key Model, The 7th Crypto 1987, Springer-Verlag, pp. 135-155.
19. O. Goldreich, S. Micali and A. Wigderson, Proofs that Yield Nothing But their Validity, FOCS 1986, IEEE, pp. 174-187.
20. O. Goldreich, S. Micali and A. Wigderson, How to Play any Mental Poker, STOC 1987, ACM, pp. 218-229.
21. S. Goldwasser, S. Micali and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, STOC 1985, ACM, pp. 291-304.
22. M. Joseph, and A. Avizienis, A Fault-Tolerance Approach to Computer Viruses, IEEE Sym. on Security and Privacy, 1988, pp. 52-58.
23. P.A. Kager, Limiting the Damage Potential of Discretionary Trojan Horses, IEEE Sym. on Security and Privacy, 1987, pp. 32-37.
24. Jeff Kephart and Steve White, Directed-Graph Epidemiological Models of Computer Viruses, IBM Research Report, also in IEEE Sym. on Security and Privacy, 1991.
25. S. Micali and P. Rogaway Secure Computation, a manuscript.
26. S. Micali and T. Rabin. Collective Coin Tossing without Assumptions nor Broadcast, Crypto-90.
27. J. Piccioto, The Design of an Effective Auditing Subsystem, IEEE Sym. on Security and Privacy, 1987, pp. 13-22.
28. M. Pease, R. Shostak, and L. Lamport Reaching agreement in the presence of faults, JACM, 27(2), 1980.
29. S-P. Shieh, and V. Gligor, Auditing the Use of Covert Channels in Secure Systems, IEEE Sym. on Security and Privacy, 1990, pp. 285-295.
30. T. Rabin and M. Ben-Or, Verifiable Secret Sharing and Multiparty Protocols with Honest Majority, STOC 1989, ACM, pp. 73-85.
31. Steve White, Personal Communication.