An Automated Response and Recovery Engine (RRE): Responses against Intrusion

Abstract

We live in a time when technology is rapidly evolving, and cyber threats are becoming increasingly difficult to detect. Explore the leading topics of network security and learn how you can secure the Network against the most sophisticated cyber attacks. Following a successful exploit, the attacker can disable the target application. This survey provides Automated Invasion Response System (AIRS) for an understanding of different research in preserving the availability and of calculating systems in the fast-spreading invasions which demands advances in automated response ways of doing things and in detection sets of computer instructions. Response and Recovery Engine is the suggested approach for an automated response. Our system works on a game-theoretic response against fighters as modeled. The RRE understands the system-level security features by applying a method called attack-response trees (ART).  Due to which RRE is responsible for any functions from attackers. The RRE works with Markov process that is automatically takes decision.  We deploy fuzzy logic in process to as a result, the best response of optimization process of  network actions. the RRE calculate the security metric values in network-level. In implementation of this logic, inputs to the network- level selection engine are first handled by fuzzy system which is in charge of a guessing and ranking of the possible actions. Gets involved in using its rule set of fuzzy.

Country : India

1 M Nayak Hanumanthu

  1. Assistant Professor, Department of Computer Science And Engineering, Malla Reddy College of Engineering for Women, Hyderabad -500100, Telangana, India

IRJIET, Volume 3, Issue 7, July 2019 pp. 46-48

.

References

  1. Saman A. Zonouz, Himanshu Khurana, William H. Sanders, and Timothy M. Yardley “RRE: A Game- Theoretic Intrusion Response and Recovery Engine” IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 25, NO. 2, FEBRUARY 2014.
  2. Avizienis, J. Laprie, B. Randell, and C. Landwehr. Basic concepts and taxonomy of dependable and secure computing. IEEE Trans. on Dep. and Sec. Comp., 1:11–33, 2004.
  3. Balepin, S. Maltsev, J. Rowe, and K. Levitt. Using specification-based intrusion detection for automated response. Proc. of the Int’l Symp. on Recent Advances in Intrusion Detection, pages 136–54, 2003.
  4. Bellman. Dynamic Programming. Princeton University Press, 1957; republished 2003.
  5. M. Bloem, T. Alpcan, and T. Basar. Intrusion response as a resource allocation problem. Proc. of Conf. on Decision and Control, pages 6283–8, 2006.
  6. Cassandra. Exact and Approximate Algorithms for Partially Observable Markov Decision Processes. PhD thesis: Brown University, 1998.
  7. F. Cohen. Simulating cyber attacks, defenses, and consequences. Journal of Comp. and Sec., 18:479–518, 1999.
  8. Dean, L. Kaelbling, J. Kirman, and A. Nicholson. Planning under time constraints in stochastic domains. Artificial Intelligence, 76:35–74, 1995.
  9. Filar and K. Vrieze. Competitive Markov Decision Processes. Springer-Verlag, 1997.
  10. B. Foo, Y. Wu, Y. Mao, S. Bagchi, and E. Spafford. Adepts: adaptive intrusion response using attack graphs in an ecommerce environment. Proc. of Dependable Systems and Networks, pages 508–17, 2005.
  11. L. Kaelbling, M. Littman, and A. Cassandra. Partially observable Markov decision processes for artificial intelligence. Proc. of the German Conference on Artificial Intelligence: Advances in Artificial Intelligence, 981:1–17, 1995.