Practical Intrusion-Tolerant Networks

Obenshain, Daniel; Tantillo, Thomas; Babay, Amy; Schultz, John L.; Newell, Andrew J.; Hoque, Md. Edadul; Amir, Yair; Nita-Rotaru, Cristina

doi:10.1109/icdcs.2016.99

Cited by 18 publications

(14 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Later works tried to further optimize this algorithm, e.g., in terms of the total number of asynchronous communication rounds needed for termination [15]. On a different level Obenshain et al [47] design and construct an intrusion-tolerant overlay capable of tolerating Byzantine actions, based on the key understanding that no overlay node should be trusted or given preference. The authors use a maximal topology with minimal weights to prevent routing attacks at the overlay level and rely on source routing augmented with redundant dissemination methods to limit the effect of compromised forwarder processes.…”

Section: A Byzantine Reliable Communicationmentioning

confidence: 99%

See 1 more Smart Citation

<italic>RT-ByzCast</italic>: Byzantine-Resilient Real-Time Reliable Broadcast

Kozhaya

Decouchant

Esteves-Veríssimo

2019

IEEE Trans. Comput.

View full text Add to dashboard Cite

Today's cyber-physical systems face various impediments to achieving their intended goals, namely, communication uncertainties and faults, relative to the increased integration of networked and wireless devices, hinder the synchronism needed to meet real-time deadlines. Moreover, being critical, these systems are also exposed to significant security threats. This threat combination increases the risk of physical damage. This paper addresses these problems by studying how to build the first real-time Byzantine reliable broadcast protocol (RTBRB) tolerating network uncertainties, faults, and attacks. Previous literature describes either real-time reliable broadcast protocols, or asynchronous (non real-time) Byzantine ones.We first prove that it is impossible to implement RTBRB using traditional distributed computing paradigms, e.g., where the error/failure detection mechanisms of processes are decoupled from the broadcast algorithm itself, even with the help of the most powerful failure detectors. We circumvent this impossibility by proposing RT-ByzCast, an algorithm based on aggregating digital signatures in a sliding time-window and on empowering processes with self-crashing capabilities to mask and bound losses. We show that RT-ByzCast (i) operates in real-time by proving that messages broadcast by correct processes are delivered within a known bounded delay, and (ii) is reliable by demonstrating that correct processes using our algorithm crash themselves with a negligible probability, even with message loss rates as high as 60%.

show abstract

Section: A Byzantine Reliable Communicationmentioning

confidence: 99%

“…Unlike our RT-ByzCast algorithm, the solutions of [13]- [15], [47] do not provide timeliness guarantees on message delivery, even when applied to weakly synchronous networks such as the one we consider in this paper.…”

Section: A Byzantine Reliable Communicationmentioning

confidence: 99%

<italic>RT-ByzCast</italic>: Byzantine-Resilient Real-Time Reliable Broadcast

Kozhaya

Decouchant

Esteves-Veríssimo

2019

IEEE Trans. Comput.

View full text Add to dashboard Cite

show abstract

“…The attacker will be able to access these values, and consequently encrypted messages, via compromising the intermediate nodes. Similar to KPsec, [25] strives to establish end-to-end secure communications by providing disjoint overlay paths. Unlike KPsec, however, it relies on a backbone infrastructure.…”

Section: End-to-end Communicationmentioning

confidence: 99%

KPsec: Secure End-to-End Communications for Multi-Hop Wireless Networks

Gharib,

Owfi,

Ghorbani

2019

Preprint

View full text Add to dashboard Cite

The security of cyber-physical systems, from self-driving cars to medical devices, depends on their underlying multi-hop wireless networks. Yet, the lack of trusted central infrastructures and limited nodes' resources make securing these networks challenging. Recent works on key pre-distribution schemes, where nodes communicate over encrypted overlay paths, provide an appealing solution because of their distributed, computationally light-weight nature. Alas, these schemes share a glaring security vulnerability: the two ends of every overlay link can decryptand potentially modify and alter-the message. Plus, the longer overlay paths impose traffic overhead and increase latency. We present a novel routing mechanism, KPsec, to address these issues. KPsec deploys multiple disjoint paths and an initial key-exchange phase to secure end-to-end communications. After the initial key-exchange phase, traffic in KPsec follows the shortest paths and, in contrast to key predistribution schemes, intermediate nodes cannot decrypt it. We measure the security and performance of KPsec as well as three state-of-the-art key pre-distribution schemes using a real 10-node testbed and large-scale simulations. Our experiments show that, in addition to its security benefits, KPsec results in 5 − 15% improvement in network throughput, up to 75% reduction in latency, and an order of magnitude reduction in energy consumption.

show abstract

“…To this extent, they often offer remote access to services and relevant information, and they may consequently be subject to (cyber)attacks [2], [6], [92], [95]. In the last decade, such cyberthreats had a constantly growing impact as pointed out by several reports [7], [8].…”

Section: Introductionmentioning

confidence: 99%