Inoculation strategies for victims of viruses and the sum-of-squares partition problem

Journal of Computer and System Sciences

Volumn 72, Issue 6, 2006, Pages 1077-1093

  Aspnes, James ^a   Chang, Kevin ^a   Yampolskiy, Aleksandr ^a  

^a Yale University   (United States)

Author keywords

Computer virus model; Economics of security; Price of anarchy; Security externalities; Sum of squares partition

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; GAME THEORY; GRAPH THEORY; PROBLEM SOLVING;

COMPUTER VIRUS MODEL; ECONOMICS OF SECURITY; NASH EQUILIBRIA; PRICE OF ANARCHY; SECURITY EXTERNALITIES; SUM-OF-SQUARES PARTITION;

COMPUTER VIRUSES;

EID: 33746689683     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2006.02.003     Document Type: Article

References (31)

1. Bailey N.T. The Mathematical Theory of Infectious Diseases and Its Applications (1975), Hafner Press
2. Frauenthal J.C. Mathematical Modeling in Epidemiology (1980), Springer-Verlag, New York
3. J.O. Kephart, S.R. White, Directed-graph epidemiological models of computer viruses, in: IEEE Symposium on Security and Privacy, 1991, pp. 343-361
4. J.O. Kephart, D.M. Chess, S.R. White, Computers and epidemiology, in: IEEE Spectrum, 1993, pp. 20-26
5. J.O. Kephart, S.R. White, Measuring and modeling computer virus prevalence, in: Proceedings of the IEEE Symposium on Security and Privacy, 1993, p. 2
6. C. Wang, J.C. Knight, M.C. Elder, On computer viral infection and the effect of immunization, in: ACSAC, 2000, pp. 246-256
7. Pastor-Satorras R., and Vespignani A. Epidemics and immunization scale-free networks. In: Bornholdt S., and Schuster H. (Eds). Handbook of Graphs and Networks: From the Genome to the Internet (2002), Wiley-VCH, Berlin 113-132
8. Pastor-Satorras R., and Vespignani A. Immunization of complex networks. Phys. Rev. Lett. 65 (2002)
9. C. Zou, D. Towsley, W. Gong, Email virus propagation modeling and analysis, Technical Report CSE-03-04, University of Massachusetts, Amherst, 2002
10. Kesten H. Percolation Theory for Mathematicians, vol. 2 (1982), Birkhäuser, Boston
11. Anderson R. Why information security is hard-an economic perspective. available at (2001). http://www.cl.cam.ac.uk/~rja14/econsec.html
12. J. Aspnes, J. Feigenbaum, M. Mitzenmacher, D. Parkes, Towards better definitions and measures of Internet security, in: Workshop on Large-Scale Network Security and Deployment Obstacles, 2003
13. K. Hoo, How much is enough? A risk-management approach to computer security, Consortium for Research on Information Security Policy (CRISP), Working Paper, 2000
14. Campbell K., Gordon L.A., Loeb M.P., and Zhou L. The economic cost of publicly announced information security breaches: Empirical evidence from the stock market. J. Comput. Secur. 11 3 (2003) 431-448
15. Gordon L.A., and Loeb M.P. The economics of information security investment. ACM Trans. Inform. System Secur. (2002) 438-457
16. S.N. Hamilton, W.L. Miller, A. Ott, O.S. Saydjari, The role of game theory in information warfare, in: 4th Information Survivability Workshop, ISW-2001/2002, Vancouver, Canada, 2002
17. S.N. Hamilton, W.L. Miller, A. Ott, O.S. Saydjari, Challenges in applying game theory to the domain of information warfare, in: 4th Information Survivability Workshop, ISW-2001/2002, Vancouver, Canada, 2002
18. Syverson P.F. A different look at secure distributed computation. IEEE Computer Security Foundations Workshop, CSFW 10 (1997), IEEE Comput. Soc. Press 109-115
19. M.G.H. Bell, The measurement of reliability in stochastic transport networks, in: Proceedings of 2001 Intelligent Transportation Systems, 2001, pp. 1183-1188
20. Kunreuther H., and Heal G. Interdependent security. Special Issue on Terrorist Risks. J. Risk Uncertainty 26 (2003) 231-249
21. Kearns M., and Ortiz L. Algorithms for interdependent security games. In: Thrun S., Saul L., and Schölkopf B. (Eds). Advances in Neural Information Processing Systems vol. 16 (2004), MIT Press, Cambridge, MA
22. Leighton T., and Rao S. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. Assoc. Comput. Machinery 46 6 (1999) 787-832
23. S. Arora, S. Rao, U. Vazirani, Expander flows, geometric embeddings and graph partitioning, in: Proceedings of the 36th Annual ACM Symposium on the Theory of Computing, 2004, pp. 222-231
24. Feige U., and Krauthgamer R. A polylogarithmic approximation of the minimum bisection. SIAM J. Comput. 31 (2002) 1090-1118
25. Even G., Naor J., Rao S., and Schieber B. Fast approximate graph partitioning algorithms. SIAM J. Comput. 28 (1999) 2187-2214
26. E. Koutsoupias, C. Papadimitriou, Worst-case equilibria, in: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, 1999, pp. 403-413
27. A. Agarwal, M. Charikar, K. Makarychev, Y. Makarychev, O(sqrt(log n)) approximation algorithms for min uncut, min 2CNF deletion, and directed cut problems, in: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005, pp. 573-581
28. Hastad J. Some optimal inapproximability results. Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing (1997), ACM Press, New York, NY 1-10
29. S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani, D. Sivakumar, On the hardness of approximating multicut and sparsest-cut, in: IEEE Conference on Computational Complexity, 2005, pp. 144-153
30. 1, in: Proceedings of the 46th IEEE Symposium on Foundations of Computer Science, 2005, pp. 53-62
31. S. Khot, On the power of unique 2-prover 1-round games, in: Proceedings of the 34th Annual ACM Symposium on the Theory of Computing, 2002, pp. 767-775