ONLINE INTRUSION ALERT AGGREGATION WITH GENERATIVE DATA STREAM MODELING.

Slides:



Advertisements
Similar presentations
--- IT Acumens. COMIT Acumens. COM SNMP Project. AIM The aim of our project is to monitor and manage the performance of a network. The aim of our project.
Advertisements

Bandwidth Estimation for IEEE Based Ad Hoc Networks.
ACHIEVING NETWORK LEVEL PRIVACY IN WIRELESS SENSOR NETWORKS.
A DISTRIBUTED CSMA ALGORITHM FOR THROUGHPUT AND UTILITY MAXIMIZATION IN WIRELESS NETWORKS.
Dynamic Source Routing (DSR) algorithm is simple and best suited for high mobility nodes in wireless ad hoc networks. Due to high mobility in ad-hoc network,
Abstract There is significant need to improve existing techniques for clustering multivariate network traffic flow record and quickly infer underlying.
ABSTRACT Due to the Internets sheer size, complexity, and various routing policies, it is difficult if not impossible to locate the causes of large volumes.
WEB USAGE MINING FRAMEWORK FOR MINING EVOLVING USER PROFILES IN DYNAMIC WEBSITE DONE BY: AYESHA NUSRATH 07L51A0517 FIRDOUSE AFREEN 07L51A0522.
Abstract Shortest distance query is a fundamental operation in large-scale networks. Many existing methods in the literature take a landmark embedding.
INTRUSION DETECTION SYSTEM
Under the Guidance of: Mr S.Karthikeyan.MCA..  The project is entitled as “ SMS Based Student Information System” created by using Visual Basic.  Flexible.
Toward a Statistical Framework for Source Anonymity in Sensor Networks.
A Secure Protocol for Spontaneous Wireless Ad Hoc Networks Creation.
Abstract Provable data possession (PDP) is a probabilistic proof technique for cloud service providers (CSPs) to prove the clients' data integrity without.
WARNINGBIRD: A Near Real-time Detection System for Suspicious URLs in Twitter Stream.
Detecting Network Violation Based on Fuzzy Class-Association-Rule Mining Using Genetic Network Programming.
Cross-Domain Privacy-Preserving Cooperative Firewall Optimization.
Layered Approach using Conditional Random Fields For Intrusion Detection.
NICE :Network Intrusion Detection and Countermeasure Selection in Virtual Network Systems.
Internal Guide: Prof S M Narayana By: Meghana(1MS07CS049) Padmavathi T(1MS07CS057) Priyanka A L(1MS07CS069) Sandeep Kumar B(1MS07CS082)
DATA DYNAMICS AND PUBLIC VERIFIABILITY CHECKING WITHOUT THIRD PARTY AUDITOR GUIDED BY PROJECT MEMBERS: Ms. V.JAYANTHI M.E Assistant Professor V.KARTHIKEYAN.
Vampire Attacks: Draining Life from Wireless Ad Hoc Sensor Networks.
Improving Network I/O Virtualization for Cloud Computing.
Mobile Relay Configuration in Data-Intensive Wireless Sensor Networks.
m-Privacy for Collaborative Data Publishing
Tweet Analysis for Real-Time Event Detection and Earthquake Reporting System Development.
EAACK—A Secure Intrusion-Detection System for MANETs
Combining Cryptographic Primitives to Prevent Jamming Attacks in Wireless Networks.
Optimal Client-Server Assignment for Internet Distributed Systems.
ANNA UNIVERSITY, CHENNAI PROJECT VIVA FINAL YEAR MCA( ) 04/07/2013.
Enabling Dynamic Data and Indirect Mutual Trust for Cloud Computing Storage Systems.
MOBILITY BILL DEFRAYMENT
Hiding in the Mobile Crowd: Location Privacy through Collaboration.
Cooperative Caching for Efficient Data Access in Disruption Tolerant Networks.
Accuracy-Constrained Privacy-Preserving Access Control Mechanism for Relational Data.
Identity-Based Distributed Provable Data Possession in Multi-Cloud Storage.
Content Sharing over Smartphone-Based Delay- Tolerant Networks.
A System for Denial-of- Service Attack Detection Based on Multivariate Correlation Analysis.
Modeling the Pairwise Key Predistribution Scheme in the Presence of Unreliable Links.
Privacy Preserving Delegated Access Control in Public Clouds.
Anomaly Detection via Online Over-Sampling Principal Component Analysis.
Towards Online Shortest Path Computation. Abstract The online shortest path problem aims at computing the shortest path based on live traffic circumstances.
Facilitating Document Annotation using Content and Querying Value.
Preventing Private Information Inference Attacks on Social Networks.
DTRAB Combating Against Attacks on Encrypted Protocols through Traffic- Feature Analysis.
Under The Guidance of Smt. Ch.Ratna Kumari Asst.Professor Submitted by M Ravi Kumar Roll No:10021F0006 M.C.A.
m-Privacy for Collaborative Data Publishing
INTERNAL GUIDE: T.BENERJI BY: CH MAHESH KUMAR 07D31A1237 B.CHANDRAKANTH 07D31A1209 CH.GOWTHAM 07D31A1217 ARUN KUMAR MISHRA 07D31A1205 M.Tech( Ph.D )
Dynamic Control of Coding for Progressive Packet Arrivals in DTNs.
Security Analysis of a Privacy-Preserving Decentralized Key-Policy Attribute-Based Encryption Scheme.
Privacy-Enhanced Web Service Composition. Abstract Data as a Service (DaaS) builds on service-oriented technologies to enable fast access to data resources.
Energy-Efficient Protocol for Cooperative Networks.
Mona: Secure Multi-Owner Data Sharing for Dynamic Groups in the Cloud.
Risk-Aware Mitigation for MANET Routing Attacks Submitted by Sk. Khajavali.
Fast Transmission to Remote Cooperative Groups: A New Key Management Paradigm.
Library Management System. Aim : To develop a project titled “LIBRARY MANAGEMENT” and is developed to maintain the operation done in a library. To develop.
Dynamic Query Forms for Database Queries. Abstract Modern scientific databases and web databases maintain large and heterogeneous data. These real-world.
PROJECT DOMAIN : NETWORK SECURITY Project Members : M.Ananda Vadivelan & E.Kalaivanan Department of Computer Science.
Cooperative Caching in Wireless P2P Networks: Design, Implementation And Evaluation.
Intrusion Detection-An Energy Efficient Approach In Heterogeneous WSN Department Of Computer Science and Engineering ADARSH COLLEGE OF ENGINEERING CHEBROLU.
Fragile Watermarking Scheme for Relational Database Fragile Watermarking Scheme for Relational Database.
 Abstract  Introduction  Literature Survey  Conclusion on Literature Survey  Threat model and system architecture  Proposed Work  Attack Scenarios.
BY S.S.SUDHEER VARMA (13NT1D5816)
Under the Guidance of V.Rajashekhar M.Tech Assistant Professor
Towards Scalable Traffic Management in Cloud Data Centers
Under Guidance- Internal Guide- Ms. Shruti T.V
ABSTRACT   Recent work has shown that sink mobility along a constrained path can improve the energy efficiency in wireless sensor networks. Due to the.
ROBUST FACE NAME GRAPH MATCHING FOR MOVIE CHARACTER IDENTIFICATION
Department Of Computer Science Engineering
NYMBLE: BLOCKING MISBEHAVING USERS IN ANONYMIZING NETWORKS
Presentation transcript:

ONLINE INTRUSION ALERT AGGREGATION WITH GENERATIVE DATA STREAM MODELING

 We propose a novel technique for online alert aggregation which is based on a dynamic, probabilistic model of the current attack situation.  Basically, it can be regarded as a data stream version of a maximum likelihood approach for the estimation of the model parameters.  We make the system more efficient in identify the intrusion alerts and also we extend this work by sending the Alerts as Message to the Network Administrator who governs the Network or Intrusion Detection System. ABSTRACT

 The Authors proposed methods on many Intrusion Alerts.  As our contribution, we make the system more efficient in identify the intrusion alerts and also we extend this work by sending the Alerts as Message to the Network Administrator who governs the Network or Intrusion Detection System. OBJECTIVE

 Most existing IDS are optimized to detect attacks with high accuracy. However, they still have various disadvantages that have been outlined in a number of publications and a lot of work has been done to analyze IDS in order to direct future research.  Besides others, one drawback is the large amount of alerts produced.  Alerts can be given only in System logs. EXISTING SYSTEMS

 Online Intrusion Alert Aggregation with Generative Data Stream Modeling is a generative modeling approach using probabilistic methods.  Assuming that attack instances can be regarded as random processes “ producing ” alerts, we aim at modeling these processes using approximative maximum likelihood parameter estimation techniques. Thus, the beginning as well as the completion of attack instances can be detected. PROPOSED SYSTEM

Cont..  It is a data stream approach, i.e., each observed alert is processed only a few times. Thus, it can be applied online and under harsh timing constraints.  In the proposed scheme of Online Intrusion Alert Aggregation with Generative Data Stream Modeling, we extend our idea of sending Intrusion alerts to the mobile. This makes the process easier and comfortable.  Online Intrusion Alert Aggregation with Generative Data Stream Modeling does not degrade system performance as individual layers are independent and are trained with only a small number of features, thereby, resulting in an efficient system.

ARCHITECTURE

 SYSTEM: Pentium IV 2.4 GHz  HARD DISK: 320 GB  MONITOR: 15 “  MOUSE: Logitech.  RAM: 2 GB  KEYBOARD: 110 keys enhanced. Hardware Requirements

 Operating system : Windows 7 Professional  Front End : JAVA, RMI, JDBC, Swing Tool :NETBEANS IDE Software Requirements

 Server  Client  DARPA DataSet  Mobile  Attack Simulation MODULES

 Alexander Hofmann and Bernhard Sick, “Online Intrusion Alert Aggregation with Generative Data Stream Modeling”, IEEE Transactions on Dependable and Secure Computing, Vol. 8, No. 2, March – April  Kapil Kumar Gupta, Baikunth Nath and Ramamohanarao Kotagiri, “Layered Approach using Conditional Random Fields for Intrusion Detection”, IEEE Transactions on Dependable and Secure Computing, Vol.7, No.1, January- March REFERENCE PAPERS

THANK YOU…