2013
DOI: 10.1109/tifs.2012.2237397
|View full text |Cite
|
Sign up to set email alerts
|

The Source Identification Game: An Information-Theoretic Perspective

Abstract: We introduce a theoretical framework in which to cast the source identification problem. Thanks to the adoption of a game-theoretic approach, the proposed framework permits us to derive the ultimate achievable performance of the forensic analysis in the presence of an adversary aiming at deceiving it. The asymptotic Nash equilibrium of the source identification game is derived under an assumption on the resources on which the forensic analyst may rely. The payoff at the equilibrium is an- alyzed, deriving the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

3
134
1

Year Published

2013
2013
2023
2023

Publication Types

Select...
4
4

Relationship

1
7

Authors

Journals

citations
Cited by 92 publications
(139 citation statements)
references
References 29 publications
3
134
1
Order By: Relevance
“…If the database is large then it is likely that a good match will be found. A procedure is given in [3] for obtaining y from x and z, based on histogram and pixel remapping techniques related to transportation theory [10]; this method is able to enforce a target distortion, at the cost of an imperfect post-processed forgery y. However it can always be replaced by the method in Section 2 to get a minimum-distortion perfect post-processed forgery, which is normally very faithful due the huge space of possibilities in the combinatorial optimisation.…”
Section: Decoy Choicementioning
confidence: 99%
“…If the database is large then it is likely that a good match will be found. A procedure is given in [3] for obtaining y from x and z, based on histogram and pixel remapping techniques related to transportation theory [10]; this method is able to enforce a target distortion, at the cost of an imperfect post-processed forgery y. However it can always be replaced by the method in Section 2 to get a minimum-distortion perfect post-processed forgery, which is normally very faithful due the huge space of possibilities in the combinatorial optimisation.…”
Section: Decoy Choicementioning
confidence: 99%
“…By referring to MF, some early attempts to define a general framework for adversarial hypothesis testing have been made, including [2,17], where game-theory and information theory are used to derive the Nash equilibrium point of the source identification game, and [3] where the KullbackLeibler distance is used to measure the validity of an attack regardless of the adopted countermeasures. Similar attempts have been carried out in the field of adversarial machine learning (see [5] for a review).…”
Section: Browsing Prior Artmentioning
confidence: 99%
“…the defender, and the adversary, is through game theory. In the following we use the approach outlined in [2] to show how game theory can be used to formulate a general binary decision game, whose analysis can shed new light on the limits and achievable performance of binary decision under adversarial conditions.…”
Section: Looking For a General Framework: The Case Of Adversarial Binmentioning
confidence: 99%
See 1 more Smart Citation
“…Unfortunately, the aforementioned strategies are not suited to face the novel class of randomized DDoS attacks. To overcome this issue, in [1], [2] a botnet identification algorithm is proposed, which lies somehow between the two extremes of fully-parametric [10]- [12], and fully-data-driven [13] approaches. Following emerging trends in signal processing for network cyber-security [14]- [17], in [1], [2] consistent botnet identification is achieved through descriptive indicators (i.e., the message innovation rate and the emulation dictionary rate) that arise from a minimal set of physical assumptions.…”
Section: A Related Workmentioning
confidence: 99%