Jan 1, 2018·International Conference on International Conference on Emerging Technologies in Computing 2018 (iCETiC '18) , 23rd -24th August, 2018, at London Metropolitan University, London, UK, Published by Springer-Verlag
Blockchain (BC), the technology behind the Bitcoin cryptocurrency system, is starting to be adopted for ensuring enhanced security and privacy in the Internet of Things (IoT) ecosystem. Fervent research is currently being focused in both academia and industry in this domain. Proof of Work (PoW), a cryptographic puzzle, plays a vital role in ensuring BC security by maintaining a digital ledger of transactions, which are considered to be incorruptible. Furthermore, BC uses a changeable Public Key (PK) to record the identity of users, thus providing an extra layer of privacy. Not only in cryptocurrency has the successful adoption of the BC been implemented, but also in multifaceted non-monetary systems, such as in: distributed storage systems, proof of location and healthcare. Recent research articles and projects or applications were surveyed to assess the implementation of the BC for IoT Security and identify associated challenges and propose solutions for BC enabled enhanced security for the IoT ecosystem.
The increasing demand for mobile network capacity driven by Internet of Things (IoT) applications results in the need for understanding better the potential and limitations of 5G networks. Vertical application areas like smart mobility, energy networks, industrial IoT applications, and AR/VR enhanced services all pose different requirements on the use of 5G networks. Some applications need low latency, whereas others need high bandwidth or security support. The goal of this paper is to identify the requirements and to understand the limitations for 5G driven applications. We review application areas and list the typical challenges and requirements posed on 5G networks. A main challenge will be to develop a network architecture being able to dynamically adapt to fluctuating traffic patterns and accommodating various technologies such as edge computing, blockchain based distributed ledger, software defined networking, and virtualization. To inspire future research, we reveal open problems and highlight the need for piloting with 5G applications, with tangible steps, to understand the configuration of 5G networks and the use of applications across multiple vertical industries.
In this paper, we propose BAN-GZKP that optimizes the best to date secure lightweight and energy efficient authentication scheme, BANZKP, designed for WBAN networks. BANZKP is vulnerable to several security attacks such as the replay attack, DDoS attacks at sink and redundancy information crack. Also BANZKP needs an end-to-end authentication which is not compliant with the human body postural mobility. Our scheme, BAN-GZKP, improves both the security and postural mobility resilience of BANZKP. In order to fix the security vulnerabilities of BANZKP, BAN-GZKP uses a novel random key allocation. Moreover, BAN-GZKP uses a hop-by-hop authentication scheme which makes it tolerant to postural mobility. We further prove the reliability of our scheme to various attacks including those to which BANZKP is vulnerable. Furthermore, via extensive simulations we prove that our scheme, BAN-GZKP, outperforms BANZKP in terms of reliability to human body postural mobility for various network parameters (end-to-end delay, number of packets exchanged in the network, number of transmissions). We compared both schemes using representative convergecast strategies with various transmission rates and human postural mobility. When our BAN-GZKP scheme is used the percentage of packets received increases by 34.06%, the end-to-end-delay reduces by 36.02% and the number of transmissions reduces by 8.75% with respect to the case when BANZKP is used. Moreover, BAN-GZKP uses only a three-phase authentication which is optimal in the class of ZKP protocols. Finally, it is important to mention that BAN-GZKP has no additional cost in terms memory, computational complexity or energy consumption compared to BANZKP.
The bitcoin peer-to-peer network has drawn significant attention from researchers, but so far has mostly focused on publicly visible portions of the network, i.e., publicly reachable peers. This mostly ignores the hidden parts of the network: unreachable Bitcoin peers behind NATs and firewalls. In this paper, we characterize Bitcoin peers that might be behind NATs or firewalls from different perspectives. Using a special-purpose measurement tool we conduct a large scale measurement study of the Bitcoin network, and discover several previously unreported usage patterns: a small number of peers are involved in the propagation of 89% of all bitcoin transactions, public cloud services are being used for Bitcoin network probing and crawling, a large amount of transactions are generated from only two mobile applications. We also empirically evaluate a method that uses timing information to re-identify the peer that created a transaction against unreachable peers. We find this method very accurate for peers that use the latest version of the Bitcoin Core client.
Emanuele Di Pascale, Jasmina McMenamy, Irene Macaluso, Linda Doyle
The disruptive power of blockchain technologies represents a great opportunity to re-imagine standard practices of telecommunication networks and to identify critical areas that can benefit from brand new approaches. As a starting point for this debate, we look at the current limits of infrastructure sharing, and specifically at the Small-Cell-as-a-Service trend, asking ourselves how we could push it to its natural extreme: a scenario in which any individual home or business user can become a service provider for mobile network operators, freed from all the scalability and legal constraints that are inherent to the current modus operandi. We propose the adoption of smart contracts to implement simple but effective Service Level Agreements (SLAs) between small cell providers and mobile operators, and present an example contract template based on the Ethereum blockchain.
Sending money in cryptocurrencies is majorly based on public keys or their hashed forms -- "addresses." These long random-looking strings are user unfriendly for transferring by other means than via copy-and-paste or QR codes. Replacing such strings with identifiers chosen by users themselves would significantly improve usability of cryptocurrencies. Such identifiers could be memorable, easier to write on paper or to dictate over phone. Main challenge lies in designing a practically usable decentralised system for providing these identifiers. Former solutions have been built as centralised systems or come with nonnegligible limitations. Our solution is reminiscent of a prevalent e-mail system, which is an already user friendly and desirably decentralised system. It is shown that our approach is directly applicable also to other systems that use long cryptographic identifiers.
Sep 29, 2016·In Proceedings of the 12th International Conference on Availability, Reliability and Security (ARES '17). ACM, New York, NY, USA, Article 43, 2017
Distributed Hash Tables (DHT) are a common architecture for decentralized applications and, therefore, would be suited for privacy-aware applications. However, currently existing DHTs allow every peer to access any index. To build privacy-aware applications, we need to control this access. In this paper, we present k-rAC, a privacy-aware fine-grained AC for DHTs. For authentication, we present three different mechanisms based on public-key cryptography, zero-knowledge-proofs, and cryptographic hashes. For authorization, we use distributed AC lists. The security of our approach is based on k-resilience. We show that our approach introduces an acceptable overhead and discuss its suitability for different scenarios.
As the most successful cryptocurrency to date, Bitcoin constitutes a target of choice for attackers. While many attack vectors have already been uncovered, one important vector has been left out though: attacking the currency via the Internet routing infrastructure itself. Indeed, by manipulating routing advertisements (BGP hijacks) or by naturally intercepting traffic, Autonomous Systems (ASes) can intercept and manipulate a large fraction of Bitcoin traffic. This paper presents the first taxonomy of routing attacks and their impact on Bitcoin, considering both small-scale attacks, targeting individual nodes, and large-scale attacks, targeting the network as a whole. While challenging, we show that two key properties make routing attacks practical: (i) the efficiency of routing manipulation; and (ii) the significant centralization of Bitcoin in terms of mining and routing. Specifically, we find that any network attacker can hijack few (<100) BGP prefixes to isolate ~50% of the mining power---even when considering that mining pools are heavily multi-homed. We also show that on-path network attackers can considerably slow down block propagation by interfering with few key Bitcoin messages. We demonstrate the feasibility of each attack against the deployed Bitcoin software. We also quantify their effectiveness on the current Bitcoin topology using data collected from a Bitcoin supernode combined with BGP routing data. The potential damage to Bitcoin is worrying. By isolating parts of the network or delaying block propagation, attackers can cause a significant amount of mining power to be wasted, leading to revenue losses and enabling a wide range of exploits such as double spending. To prevent such effects in practice, we provide both short and long-term countermeasures, some of which can be deployed immediately.
Nesrine Khernane, Maria Potop-Butucaru, Claude Chaudet
Advances in wearable and implementable of wireless sensors have enable the development of tiny and intelligent sensors called body sensors. Monitoring the vital body parameters in real-time using wireless body area network (WBAN) has shown great potential in improving healthcare quality not only for patients but also for medical staff. However, security and privacy are still an important issue in WBANs especially in multi-hop architectures. Considering the constraints of the body sensors (namely energy, memory, computational power, etc.). In this paper, we propose and present the design and the evaluation of a secure lightweight and energy efficient authentication scheme BANZKP based on an efficient cryptographic protocol, Zero Knowledge Proof (ZKP) and a commitment scheme. ZKP is used to confirm the identify of the sensor nodes, with small computational requirement, which is favorable for body sensors given their limited resources, while the commitment scheme is used to deal with replay attacks and hence the injection attacks by committing a message and revealing the key later. BANZKP reduces the memory requirement by 56,13% compared to TinyZKP [10], the comparable alternative so far for Body Area Networks. Also, the simulation results demonstrate that our proposed scheme is 17 and 5 times more efficient in term of execution time, and uses 94.11% and 80% less energy compared to TinyZKP and W-ECDSA [16], respectively.
Magnus Skjegstad, Anil Madhavapeddy, Jon Crowcroft
Devices connected to the Internet today have a wide range of local communication channels available, such as wireless Wifi, Bluetooth or NFC, as well as wired backhaul. In densely populated areas it is possible to create heterogeneous, multihop communication paths using a combination of these technologies, and often transmit data with lower latency than via a wired Internet connection. However, the potential for sharing meshed wireless radios in this way has never been realised due to the lack of economic incentives to do so on the part of individual nodes. In this paper, we explore how virtual currencies such as Bitcoin might be used to provide an end-to-end incentive scheme to convince forwarding nodes that it is profitable to send packets on via the lowest latency mechanism available. Clients inject a small amount of money to transmit a datagram, and forwarding engines compete to solve a time-locked puzzle that can be claimed by the node that delivers the result in the lowest latency. This approach naturally extends congestion control techniques to a surge pricing model when available bandwidth is low. We conclude by discussing several latency-sensitive applications that would benefit for this, such as video streaming and local augmented reality systems.
The InterPlanetary File System (IPFS) is a peer-to-peer distributed file system that seeks to connect all computing devices with the same system of files. In some ways, IPFS is similar to the Web, but IPFS could be seen as a single BitTorrent swarm, exchanging objects within one Git repository. In other words, IPFS provides a high throughput content-addressed block storage model, with content-addressed hyper links. This forms a generalized Merkle DAG, a data structure upon which one can build versioned file systems, blockchains, and even a Permanent Web. IPFS combines a distributed hashtable, an incentivized block exchange, and a self-certifying namespace. IPFS has no single point of failure, and nodes do not need to trust each other.
This paper proposes a new microblogging architecture based on peer-to-peer networks overlays. The proposed platform is comprised of three mostly independent overlay networks. The first provides distributed user registration and authentication and is based on the Bitcoin protocol. The second one is a Distributed Hash Table (DHT) overlay network providing key/value storage for user resources and tracker location for the third network. The last network is a collection of possibly disjoint "swarms" of followers, based on the Bittorrent protocol, which can be used for efficient near-instant notification delivery to many users. By leveraging from existing and proven technologies, twister provides a new microblogging platform offering security, scalability and privacy features. A mechanism provides incentive for entities that contribute processing time to run the user registration network, rewarding such entities with the privilege of sending a single unsolicited ("promoted") message to the entire network. The number of unsolicited messages per day is defined in order to not upset users.
This paper describes a new protocol for authentication in ad-hoc networks. The protocol has been designed to meet specialized requirements of ad-hoc networks, such as lack of direct communication between nodes or requirements for revocable anonymity. At the same time, a ad-hoc authentication protocol must be resistant to spoofing, eavesdropping and playback, and man-in-the-middle attacks. The article analyzes existing authentication methods based on the Public Key Infrastructure, and finds that they have several drawbacks in ad-hoc networks. Therefore, a new authentication protocol, basing on established cryptographic primitives (Merkle's puzzles and zero-knowledge proofs) is proposed. The protocol is studied for a model ad-hoc chat application that provides private conversations.