Optimal voting strategy against rational attackers

6th International Conference on Risks and Security of Internet and Systems, CRiSIS 2011

Volumn , Issue , 2011, Pages

  Wang, Li ^a   Zheng, Li ^a   Ren, Shangping ^a   Kwiaty, Kevin ^b  

^a Illinois Institute of Technology   (United States)

^b AIR FORCE RESEARCH LABORATORY   (United States)

Author keywords

Attacker defender Problem; Game Thoery; Reliability; Voting Strategy

Indexed keywords

ATTACKER-DEFENDER PROBLEM; GAME PROBLEM; GAME THOERY; IMPROVE-A; OPTIMAL NUMBER; TWO-PERSON ZERO-SUM GAME; VOTING ALGORITHM; VOTING PROCESS; VOTING STRATEGIES;

ALGORITHMS; FAULT TOLERANCE; GAME THEORY; INTERNET; OPTIMIZATION; RELIABILITY;

SECURITY OF DATA;

EID: 81155126270     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CRiSIS.2011.6061841     Document Type: Conference Paper

References (31)

1. V. M. Bier, A. Nagaraj, and V. Abhichandani. Protection of simple series and parallel systems with components of different values. Reliability Engineering & System Safety, 87(3):315-323, 2005.
2. J. J. Bloch, D. S. Daniels, and A. Z. Spector. A weighted voting algorithm for replicated directories. J. ACM, 34:859-909, Oct. 1987.
3. L. Chen and A. Avizienis. N-version programming: A fault-tolerance approach to reliability of software operation. In Digest of Papers FTCS-8: Eighth Annual International Conference on Fault Tolerant Computing, pages 3 - 9, June 1978.
4. T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson. Introduction to Algorithms. McGraw-Hill Higher Education, 2nd edition, 2001.
5. D. Davcev. A dynamic voting scheme in distributed systems. Software Engineering, IEEE Transactions on, 15(1):93-97, Jan. 1989.
6. D. E. Eckhardt and L. D. Lee. Fundamental differences in the reliability of n-modular redundancy and redundancy and n-version programming. J. Syst. Softw., 8(4):313-318, 1988.
7. S. I. Gass. Linear programming: methods and applications (5th ed.). McGraw-Hill, Inc., New York, NY, USA, 1984.
8. D. K. Gifford. Weighted voting for replicated data. In Proceedings of the seventh ACM symposium on Operating systems principles, SOSP '79, pages 150-162, New York, NY, USA, 1979. ACM.
9. B. Hardekopf, K. Kwiat, and S. Upadhyaya. A decentralized voting algorithm for increasing dependability in distributed systems. In 5th World Multiconference on Systemic, Cybernetics and Informatics (SCI2001, 2001.
10. H. Kuhn and A. Tucker. Contributions to the Theory of Game, volume 1. Princeton University Press, 1950.
11. K. Kwiat, A. Taylor, W. Zwicker, D. Hill, S. Wetzonis, and S. Ren. Analysis of binary voting algorithms for use in fault-tolerant and secure computing. In Computer Engineering and Systems (ICCES), 2010 International Conference on, pages 269 -273, 2010.
12. G. Latif-Shabgahi, J. Bass, and S. Bennett. A taxonomy for software voting algorithms used in safety-critical systems. Reliability, IEEE Transactions on, 53(3):319-328, Sep. 2004.
13. G. Levitin. Optimal multilevel protection in series-parallel systems. Reliability Engineering & System Safety, 81(1):93-102, 2003.
14. G. Levitin, Y. Dai, M. Xie, and K. L. Poh. Optimizing survivability of multi-state systems with multi-level protection by multi-processor genetic algorithm. Reliability Engineering & System Safety, 82(1):93-104, 2003.
15. G. Levitin and K. Hausken. Protection vs. redundancy in homogeneous parallel systems. Reliability Engineering & System Safety, 93(10):1444-1451, 2008.
16. G. Levitin and K. Hausken. False targets efficiency in defense strategy. European Journal of Operational Research, 194(1):155-162, April 2009.
17. G. Levitin and K. Hausken. Redundancy vs. protection vs. false targets for systems under attack. Reliability, IEEE Transactions on, 58(1):58-68, March 2009.
18. G. Levitin and A. Lisnianski. Optimal separation of elements in vulnerable multi-state systems. Reliability Engineering & System Safety, 73(1):55-66, 2001.
19. G. Levitin and A. Lisnianski. Optimizing survivability of vulnerable series-parallel multi-state systems. Reliability Engineering & System Safety, 79(3):319-331, 2003.
20. L. Mancini and M. Koutny. Formal specification of n-modular redundancy. In CSC '86: Proceedings of the 1986 ACM fourteenth annual conference on Computer science, pages 199-204, 1986.
21. M. A. McQueen, W. F. Boyer, M. A. Flynn, and G. A. Beitel. Timeto- compromise model for cyber risk reduction estimation. In First Workshop on Quality of Protection, 2005.
22. M. A. McQueen, W. F. Boyer, M. A. Flynn, and G. A. Beitel. Timeto- compromise model for cyber risk reduction estimation. Quality of Protection, 23:49-64, 2006.
23. J. V. Neumann. Zur theorie der gesellschaftsspiele. Mathematische Annalen, 100(1):295-320, 1928.
24. L. Nordmann and H. Pham. Weighted voting systems. Reliability, IEEE Transactions on, 48(1):42-49, March 1999.
25. T. Raghavan. Zero-sum two-person games. In R. Aumann and S. Hart, editors, Handbook of Game Theory with Economic Applications, volume 2, pages 735-768. Elsevier, May 1994.
26. R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. Database Syst., 4:180-209, June 1979.
27. Z. Tong and R. Kain. Vote assignments in weighted voting mechanisms. Computers, IEEE Transactions on, 40(5):664-667, May 1991.
28. R. J. Vanderbei. Linear Programming: Foundations and Extensions. Springer, second edition, 2001.
29. L. Wang, Y. Leiferman, S. Ren, K. Kwiat, and X. Li. Improving complex distributed software system availability through information hiding. In Proceedings of the 2010 ACM Symposium on Applied Computing, SAC '10, pages 452-456, New York, NY, USA, 2010. ACM.
30. L. Wang, S. Ren, K. Yue, and K. Kwiat. Optimal resource allocation for protecting system availability against random cyber attacks. In Computer Research and Development (ICCRD), 2011 3rd International Conference on, volume 1, pages 477 -482, March 2011.
31. P. Zafra. Linear Programming and Two-Person Zero-Sum Games. Wiley Encyclopedia of Operations Research and Management Science, Feb. 2011.