Intrusion Response System for Relational Database To Avoid Anomalous Request

Akila L*, Deviselvam**
* M.E Student, CSE, Sri Shakthi Institute of Engineering and Technology, Anna University, Coimbatore.
** Assistant Professor, CSE, Sri Shakthi Institute of Engineering and Technology, Anna University, Coimbatore.
Periodicity:October - December'2011
DOI : https://doi.org/10.26634/jse.6.2.2897

Abstract

The intrusion response component of an overall intrusion detection system is responsible for issuing a suitable response to an anomalous request. In the existing system, Intrusion Detection mechanism consists of two main elements, specifically tailored to a DBMS: Anomaly Detection (AD) system and an anomaly response system. In anomaly response system conservative actions, fine-grained actions, and aggressive actions methods are used. The proposed system mainly concentrates on response policies by using policy matching and policy administration. For the policy matching problem, The authors propose two algorithms that efficiently search the policy database for policies that match an anomalous request. They also extend the PostgreSQL DBMS with our policy matching mechanism, and report experimental results. The other issue that we address is that of administration of response policies to prevent malicious modifications to policy objects from legitimate users. They propose a novel Joint Threshold Administration Model (JTAM) that is based on the principle of separation of duty. The key idea in JTAM is that a policy object is jointly administered by at least k database administrator (DBAs), that is, any modification made to a policy object will be invalid unless it has been authorized by at least k DBAs out of L. They present design details of JTAM which is based on a cryptographic threshold signature scheme, and show how JTAM prevents malicious modifications to policy objects from authorized users.

Keywords

PostgreSQL DBMS, Joint Threshold Administration Model, Threshold Signatures.

How to Cite this Article?

Akila L., and Deviselvam (2011). Intrusion Response System for Relational Database to Avoid Anomalous Request. i-manager’s Journal on Software Engineering, 6(2), 41-45. https://doi.org/10.26634/jse.6.2.2897

References

[1]. A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone, (2001). Handbook of Applied Cryptography. CRC Press.
[2]. Campailla S. Chaki, E. Clarke, S. Jha, and H. Veith, (2001). “EfficientFiltering in Publish-Subscribe Systems Using Binary Decision Diagrams,” Proc. Int'l Conf. Software Eng. (ICSE), pp. 443-452.
[3]. H.-S. Lim, J.-G. Lee, M.-J. Lee, K.-Y. Whang, and I.-Y. Song, (2006). “Continuous Query Processing in Data Streams Using Duality of Data and Queries,” Proc. ACM SIGMOD, pp. 313-324.
[4]. M K. Aguilera, R.E. Strom, D.C. Sturman, M. Astley, and T.D. Chandra, (1999). “Matching Events in a Content- Based Subscription System”, Proc. Symp. Principles of Distributed Computing (PODC), pp. 53-61.
[5]. “ Postgresql 8 . 3. The Postgresql Global Development Group ” http://www.postgresql.org/, July. 2008.
[6]. R. Gennaro, T. Rabin, S. Jarecki, and H. Krawczyk, (2007). “Robust andEfficient Sharing of RSA Functions,” J. Cryptology, Vol. 20, No. 3, pp. 393-400.
[7]. V. Ganapathy, T. Jaeger, and S. Jha, (2006). “Retrofitting Legacy Code for Authorization Policy Enforcement,” Proc. IEEE Symp. Security and Privacy, pp. 214-229.
[8]. V. Shoup, (2000). “Practical Threshold Signatures,” Proc. Int'l Conf. Theory and Application of Cryptographic Techniques (EURO1RYPT), pp. 207- 220.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.