About GraSec
Most of the existing security monitoring solutions cannot cope with unknown and complex attacks due to the continual apparition of new threats, botnet propagation and command-and-control mechanisms. Recently, botnet detection systems which leverage communication graph analysis using machine learning have gained attention to overcome these limitations. Graph-based modeling and mining approaches have been proposed and provide interesting results.
Graph-based modeling offers the advantage of understanding complex attacks and determining the root cause of an attack. However, existing graph mining tools for anomaly detection over streaming events are not adapted for cyber-security problems while the corresponding data continuously appears in the form of complex graphs.
The workshop serves to bring together people from industry and academia including researchers, developers, and practitioners from a variety of fields working on graphs and their applications to network, cybersecurity, and blockchain. Moreover, the workshop allows attendees to share and discuss their latest findings from both theoretical and practical perspectives in several techniques and methods for graph modeling, mining, learning, and visualizing. The main goal of GraSec is to present research and experience results in graph applications on network and cybersecurity as well as the defensive and offensive tools.
CALL FOR PAPERS
Click here to download the Call for Papers in a PDF.
TOPICS OF INTEREST
- Graph modeling/mining/learning-based intrusion/botnet/threats detection
- Graph learning-driven access controls, security policies, etc.
- Attack graphs modeling, analysis, etc.
- Sampling and summarizing techniques of graphs for network and cybersecurity.
- Big graph analytics, parallel algorithms for dynamic/big graph analysis on HPC (CPU-GPU) systems.
- Autoencoders, representation learning for graphs
- Graph embedding techniques and applications on network data.
- Visualization of dynamic and large-scale graphs
- Detection of threats with evolving behaviors using graphs
- Novel applications of static/dynamic and large graph problems in network, cybersecurity, blockchain, cryptocurrency, robot, etc.
PAPER SUBMISSION
Paper submissions must present original, unpublished research, development or experiences. Only original papers that have not been published or submitted for publication elsewhere can be submitted. Each submission must be written in English, accompanied by a 50 to 200 words abstract that clearly outlines the scope and contributions of the paper. Self-plagiarized papers will be rejected without further review.
Authors should submit their papers via JEMS: https://jems.sbc.org.br
PAPER FORMAT
There is a length limitation of 6 pages (including title, abstract, all figures, tables, and references) for regular papers, and 4 pages for short papers describing work in progress. Submissions must be in IEEE 2-column style.
ACCEPTED PAPER
Accepted regular papers, they will have a 25 minutes time slot for oral presentation (including Q&A) at assigned time slot. Accepted short papers, they will have a 20 minutes time slot for oral presentation (including Q&A).