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

Lemonia Dritsoula

dblp:95/8195 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2017
0000-0001-5547-667XORCID · corroborated

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

Security and privacy · 1 · 1 first-author

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% Security and privacy of machine learning · 50%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

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

TopicWeightPapersLastEvidence papers
Security and privacy of machine learning › adversarial machine learning
adversarial classification
0.312017
A Game-Theoretic Analysis of Adversarial Classification · IEEE Trans. Inf. Forensics Secur. 2017
Network security › intrusion detection and prevention
intrusion detection
0.312017
A Game-Theoretic Analysis of Adversarial Classification · IEEE Trans. Inf. Forensics Secur. 2017
Algorithmic game theory and mechanism design › solution concepts in games › equilibrium concepts
nash equilibrium
0.312017
A Game-Theoretic Analysis of Adversarial Classification · IEEE Trans. Inf. Forensics Secur. 2017

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

nash equilibrium computation · 0.6game theory · 0.6
YearPublicationVenuePosition
2017 A Game-Theoretic Analysis of Adversarial Classification
abstract
Attack detection is usually approached as a classification problem. However, standard classification tools often perform poorly, because an adaptive attacker can shape his attacks in response to the algorithm. This has led to the recent interest in developing methods for adversarial classification, but to the best of our knowledge, there have been a very few prior studies that take into account the attacker's tradeoff between adapting to the classifier being used against him with his desire to maintain the efficacy of his attack. Including this effect is a key to derive solutions that perform well in practice. In this investigation, we model the interaction as a game between a defender who chooses a classifier to distinguish between attacks and normal behavior based on a set of observed features and an attacker who chooses his attack features (class 1 data). Normal behavior (class 0 data) is random and exogenous. The attacker's objective balances the benefit from attacks and the cost of being detected while the defender's objective balances the benefit of a correct attack detection and the cost of false alarm. We provide an efficient algorithm to compute all Nash equilibria and a compact characterization of the possible forms of a Nash equilibrium that reveals intuitive messages on how to perform classification in the presence of an attacker. We also explore qualitatively and quantitatively the impact of the non-attacker and underlying parameters on the equilibrium strategies.
Lemonia Dritsoula, Patrick Loiseau, John Musacchio
IEEE Trans. Inf. Forensics Secur.1
2009 On the Throughput Potential of Two-Dimensional Wireless Multi-Hop Networks Using Directional Antennas
abstract
The goal of this paper is to establish the rate region of a wireless multi-hop, one-sender, two-receiver transmission chain. We examine and evaluate the advantages of utilizing directional antennas in this context. In particular, we consider a two-dimensional communication network with a single source node S, two destination nodes D1, D2, and 2 times (N - 1) intermediate nodes placed equidistantly between them. Multi-hop transmission is an extension of single-hop transmission that can take advantage of the reduced attenuation between closely spaced relay nodes, as well as the opportunity of spatial reuse. In two-dimensional multi-hop half-duplex transmission, each node utilizes capacity-achieving point-to-point codes to forward the most recently decoded message to its nearest neighbor in the direction of D1or D2. The transmission is performed over two parallel chains and it is a mixture of two techniques, "broadcast" communication (one transmitter to two relay nodes) and interference channel. First we describe our network and the assumptions made in the scope of this study. We further evaluate the end-to-end rate region of this topology under our transmission constraints and describe the effects that take place after replacing omni-directional antennas with perfectly directional ones. Our results indicate a 5-fold end-to-end sum rate improvement over a 10-hop network with the use of 30 degrees directional beams, as compared to omni-directional transmission.
Lemonia Dritsoula, Constantinos B. Papadias
VTC Spring1