2018
DOI: 10.1109/tsipn.2017.2723723
|View full text |Cite
|
Sign up to set email alerts
|

Mitigation of Byzantine Attacks on Distributed Detection Systems Using Audit Bits

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
32
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 26 publications
(32 citation statements)
references
References 26 publications
0
32
0
Order By: Relevance
“…After identifying the malicious attacks, the improvement in the system security performance is studied with the help of audit bits. Further in [110] Wu et al use the audit sets to perform a comprehensive investigation into attack cost and attack benefit from the malicious perspective to identify the tendency of an SU for becoming an attacker. In [115], Fu et al develop a Bayesian-inferencebased sliding window trust model to identity the SSDF attacks without any prior knowledge about the attackers.…”
Section: Mechanism Of Ssdf Attacksmentioning
confidence: 99%
“…After identifying the malicious attacks, the improvement in the system security performance is studied with the help of audit bits. Further in [110] Wu et al use the audit sets to perform a comprehensive investigation into attack cost and attack benefit from the malicious perspective to identify the tendency of an SU for becoming an attacker. In [115], Fu et al develop a Bayesian-inferencebased sliding window trust model to identity the SSDF attacks without any prior knowledge about the attackers.…”
Section: Mechanism Of Ssdf Attacksmentioning
confidence: 99%
“…F. Ye et al made use of evidence theory and credibility calculation where evaluates the holistic credibility of SUs from both the real-time difference and statistical sensing behavior of SUs in [21] to propose a CSS method. In [22], W. Hashlamoun et al proposed a mechanism to mitigate the Byzantine attack by partitioning sensors into groups and measured the CSS performance by introducing a weighted Kullback-Leibler divergence indicator. Unfortunately, [20][21][22][23][24] only consider the simple always attack, such as always yes/no/false attack, but in fact, for a rational MU, the always attack is more aggressive and easily identified by the FC's defense strategy.…”
Section: Related Workmentioning
confidence: 99%
“…In [22], W. Hashlamoun et al proposed a mechanism to mitigate the Byzantine attack by partitioning sensors into groups and measured the CSS performance by introducing a weighted Kullback-Leibler divergence indicator. Unfortunately, [20][21][22][23][24] only consider the simple always attack, such as always yes/no/false attack, but in fact, for a rational MU, the always attack is more aggressive and easily identified by the FC's defense strategy. Otherwise, numerous efforts on Byzantine attack identification and removal for CSS have been made in [25][26] and references therein.…”
Section: Related Workmentioning
confidence: 99%
“…For example, detecting attacks, anomalies, and malicious behavior in network security can be analyzed under the game theoretic perspective [1]- [5]. In this direction, the hypothesis testing and the game theory approaches can be utilized together to investigate attacker-defender type applications [6]- [10], multimedia source identification problems [20], and inspection games [21]- [23].…”
Section: B Related Literaturementioning
confidence: 99%