Reinforced Secure Gossiping Against DoS Attacks in Post-Disaster Scenarios

Esposito, Christian; Zhao, Zhongliang; Rak, Jacek (2020). Reinforced Secure Gossiping Against DoS Attacks in Post-Disaster Scenarios. IEEE Access, 8, pp. 178651-178669. IEEE 10.1109/ACCESS.2020.3027150

[img]
Preview
Text
Reinforced Secure Gossiping Against DoS Attacks in Post-Disaster Scenarios.pdf - Published Version
Available under License Creative Commons: Attribution (CC-BY).

Download (1MB) | Preview

During and after a disaster, the perceived quality of communication networks often becomes
remarkably degraded with an increased ratio of packet losses due to physical damages of the networking
equipment, disturbance to the radio frequency signals, continuous reconfiguration of the routing tables,
or sudden spikes of the network traffic, e.g., caused by the increased user activity in a post-disaster period.
Several techniques have been introduced so far (mainly using data retransmission mechanisms) to tolerate
such circumstances. Among them, gossiping has been shown to be efficient in the recovery from message
losses. However, a conventional gossiping scheme may exhibit security problems, which can be exploited
for further attacks (such as Denial of Service – DoS attack). For instance, the flooding method used by the
gossiping can be used to forward the traffic towards many vulnerable nodes to drain their resources and
compromise them. Typically, protection against DoS attacks is realized by using cryptographic primitives.
However, their scalability limits and costs make them improper for emergency communications after a
disaster. In this article, we introduce an approach based on reinforcement learning and game theory to
protect the gossiping scheme from DoS attacks without incurring the costs of cryptographic primitives.
In our method, nodes properly select which requests to satisfy, which in turn helps other nodes to avoid
receiving manipulated gossip messages from malicious and colluded nodes. Additionally, our method
operates without exploiting any cryptographic primitives, which prevents excessive energy waste that is
undesired in post-disaster resilient networking. Simulation experiments performed in OMNeT++ confirmed
the advantages of our approach over the reference schemes in terms of reliability, security, overhead, latency,
and power efficiency.

Item Type:

Journal Article (Original Article)

Division/Institute:

08 Faculty of Science > Institute of Computer Science (INF) > Communication and Distributed Systems (CDS)
08 Faculty of Science > Institute of Computer Science (INF)

UniBE Contributor:

Zhao, Zhongliang

Subjects:

000 Computer science, knowledge & systems
500 Science > 510 Mathematics

ISSN:

2169-3536

Publisher:

IEEE

Funders:

[UNSPECIFIED] COST Association (European Cooperation in Science and Technology)

Language:

English

Submitter:

Dimitrios Xenakis

Date Deposited:

30 Oct 2020 15:56

Last Modified:

21 Apr 2021 12:17

Publisher DOI:

10.1109/ACCESS.2020.3027150

BORIS DOI:

10.7892/boris.147030

URI:

https://boris.unibe.ch/id/eprint/147030

Actions (login required)

Edit item Edit item
Provide Feedback