13,742 research outputs found
Cloaking the Clock: Emulating Clock Skew in Controller Area Networks
Automobiles are equipped with Electronic Control Units (ECU) that communicate
via in-vehicle network protocol standards such as Controller Area Network
(CAN). These protocols are designed under the assumption that separating
in-vehicle communications from external networks is sufficient for protection
against cyber attacks. This assumption, however, has been shown to be invalid
by recent attacks in which adversaries were able to infiltrate the in-vehicle
network. Motivated by these attacks, intrusion detection systems (IDSs) have
been proposed for in-vehicle networks that attempt to detect attacks by making
use of device fingerprinting using properties such as clock skew of an ECU. In
this paper, we propose the cloaking attack, an intelligent masquerade attack in
which an adversary modifies the timing of transmitted messages in order to
match the clock skew of a targeted ECU. The attack leverages the fact that,
while the clock skew is a physical property of each ECU that cannot be changed
by the adversary, the estimation of the clock skew by other ECUs is based on
network traffic, which, being a cyber component only, can be modified by an
adversary. We implement the proposed cloaking attack and test it on two IDSs,
namely, the current state-of-the-art IDS and a new IDS that we develop based on
the widely-used Network Time Protocol (NTP). We implement the cloaking attack
on two hardware testbeds, a prototype and a real connected vehicle, and show
that it can always deceive both IDSs. We also introduce a new metric called the
Maximum Slackness Index to quantify the effectiveness of the cloaking attack
even when the adversary is unable to precisely match the clock skew of the
targeted ECU.Comment: 11 pages, 13 figures, This work has been accepted to the 9th ACM/IEEE
International Conference on Cyber-Physical Systems (ICCPS
Patterns of Scalable Bayesian Inference
Datasets are growing not just in size but in complexity, creating a demand
for rich models and quantification of uncertainty. Bayesian methods are an
excellent fit for this demand, but scaling Bayesian inference is a challenge.
In response to this challenge, there has been considerable recent work based on
varying assumptions about model structure, underlying computational resources,
and the importance of asymptotic correctness. As a result, there is a zoo of
ideas with few clear overarching principles.
In this paper, we seek to identify unifying principles, patterns, and
intuitions for scaling Bayesian inference. We review existing work on utilizing
modern computing resources with both MCMC and variational approximation
techniques. From this taxonomy of ideas, we characterize the general principles
that have proven successful for designing scalable inference procedures and
comment on the path forward
- …