Applications of distributed ledger technologies to the internet of things: A survey

Distributed Ledger Technologies (DLTs) and blockchain systems have received enormous academic, government, and commercial interest in recent years. This article surveys the integration of DLTs within another life-changing technology, the Internet of Things (IoT). IoT-based applications, such as smart home, smart transport, supply chain, smart healthcare, and smart energy, promise to boost the efficiency of existing infrastructures and change every facet of our daily life. This article looks into the challenges faced by such applications and reviews a comprehensive selection of existing DLT solutions to those challenges. We also identify issues for future research, including DLT security and scalability, multi-DLT applications, and survival of DLT in the post-quantum world

APT attacks on industrial control systems: A tale of three incidents

APT attacks on industrial control systems: A tale of three incident

Refinement-aware generation of attack trees

Attack trees allow a security analyst to obtain an overview of the potential vulnerabilities of a system. Due to their refinement structure, attack trees support the analyst in understanding the system vulnerabilities at various levels of abstraction. However, contrary to manually synthesized attack trees, automatically generated attack trees are often not refinement-aware, making subsequent human processing much harder. The generation of attack trees in which the refined nodes correspond to semantically relevant levels of abstraction is still an open question. In this paper, we formulate the attack-tree generation problem and propose a methodology to, given a system model, generate attack trees with meaningful levels of abstraction

Demographics of HIV-infected persons attending a dental clinic

The demographics of 147 HIV-infected persons attending a special care dental clinic in South West England are reported. The majority of attendants were homosexual/bisexual males, reflecting the UK epidemiology of HIV disease at the time of study. There was a substantial rise in patient numbers from 1988 onwards but patients often did not reveal their route of HIV acquisition or increasingly had acquired HIV disease via heterosexual routes. Patients were usually referred for routine dental treatment, not HIV-related oral disease. The HIV-infected patients generally attended the clinic irregularly, despite being offered many appointments. It is concluded that most patients with HIV disease attend clinics for routine dental care, yet many may be unable or unwilling to attend regularly

Complexity of Distance Fraud Attacks in Graph-Based Distance Bounding

Distance bounding (DB) emerged as a countermeasure to the so-called \emph{relay attack}, which affects several technologies such as RFID, NFC, Bluetooth, and Ad-hoc networks. A prominent family of DB protocols are those based on graphs, which were introduced in 2010 to resist both mafia and distance frauds. The security analysis in terms of distance fraud is performed by considering an adversary that, given a vertex labeled graph $G = (V, E)$ and a vertex $v \in V$, is able to find the most frequent $n$-long sequence in $G$ starting from $v$ (MFS problem). However, to the best of our knowledge, it is still an open question whether the distance fraud security can be computed considering the aforementioned adversarial model. Our first contribution is a proof that the MFS problem is NP-Hard even when the graph is constrained to meet the requirements of a graph-based DB protocol. Although this result does not invalidate the model, it does suggest that a \emph{too-strong} adversary is perhaps being considered (i.e., in practice, graph-based DB protocols might resist distance fraud better than the security model suggests.) Our second contribution is an algorithm addressing the distance fraud security of the tree-based approach due to Avoine and Tchamkerten. The novel algorithm improves the computational complexity $O(2^{2^n+n})$ of the naive approach to $O(2^{2n}n)$ where $n$ is the number of rounds.Comment: Mobile and Ubiquitous Systems: Computing, Networking, and Services - 10th International Conference, MOBIQUITOUS 201

Security of Distance-Bounding: A Survey

Distance bounding protocols allow a verifier to both authenticate a prover and evaluate whether the latter is located in his vicinity. These protocols are of particular interest in contactless systems, e.g., electronic payment or access control systems, which are vulnerable to distance-based frauds. This survey analyzes and compares in a unified manner many existing distance bounding protocols with respect to several key security and complexity features

Security of Distance-Bounding: A Survey

Distance bounding protocols allow a verifier to both authenticate a prover and evaluate whether the latter is located in his vicinity. These protocols are of particular interest in contactless systems, e.g., electronic payment or access control systems, which are vulnerable to distance-based frauds. This survey analyzes and compares in a unified manner many existing distance bounding protocols with respect to several key security and complexity features