Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Verica Sekulic

dblp:168/7850 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2015
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Network security · 50% Systems and software security · 50%
Computer networks
1 paper
Network measurement and analytics · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network measurement and analytics › traffic analysis
network flow analysis
0.212015
Interdependent Security Risk Analysis of Hosts and Flows · IEEE Trans. Inf. Forensics Secur. 2015
Network security › intrusion detection and prevention
intrusion detection
0.212015
Interdependent Security Risk Analysis of Hosts and Flows · IEEE Trans. Inf. Forensics Secur. 2015
Systems and software security
risk assessment
0.212015
Interdependent Security Risk Analysis of Hosts and Flows · IEEE Trans. Inf. Forensics Secur. 2015

Methods — techniques the papers use, named apart from their topics

iterative risk propagation algorithm · 0.4
YearPublicationVenuePosition
2015 Interdependent Security Risk Analysis of Hosts and Flows
abstract
Detection of high risk hosts and flows continues to be a significant problem in security monitoring of high throughput networks. A comprehensive risk assessment method should consider the risk propagation among risky hosts and flows. In this paper, this is achieved by introducing two novel concepts. First, an interdependency relationship among the risk scores of a network flow and its source and destination hosts. On the one hand, the risk score of a host depends on risky flows initiated by or terminated at the host. On the other hand, the risk score of a flow depends on the risk scores of its source and destination hosts. Second, which we call flow provenance, represents risk propagation among network flows which considers the likelihood that a particular flow is caused by the other flows. Based on these two concepts, we develop an iterative algorithm for computing the risk score of hosts and network flows. We give a rigorous proof that our algorithm rapidly converges to unique risk estimates, and provide its extensive empirical evaluation using two real-world data sets. Our evaluation shows that our method is effective in detecting high risk hosts and flows and is sufficiently efficient to be deployed in the high throughput networks.
Mohsen Rezvani, Verica Sekulic, Aleksandar Ignjatovic, Elisa Bertino, Sanjay K. Jha
IEEE Trans. Inf. Forensics Secur.2