Search

The Internet of Things (IoT) and the Industrial Internet of Things (IIoT) are fast growing areas. Therefore, several protocols are specifically designed for these domains. CoAP (Constrained Application Protocol) is one of the more common ones. This lightweight protocol typically communicates over UDP, but can also use TCP and other carrier protocols, and is particularly suitable for embedded systems. In this work, we investigate CoAP with respect to covert communication and explore a new network hiding technique that is based on Artificial Resets. In addition, we investigate another covert channel by using the pattern PT15 Artificial Reconnections. We also propose and discuss detection methods for both covert channels.

Legacy systems are long-lived applications, with obsolete technology and degraded architecture. These systems hamper digital transformation and innovation, and require a great amount of resources for maintenance. The modernization of monolithic legacy systems is a strategy to promote better evolution and maintenance, taking advantage of new technologies such as microservices. Microservice architectural style is a paradigm to develop systems as a suite of small and autonomous services, communicating through a lightweight protocol. However, the migration of legacy systems to microservices is complex. Although we can find several studies on this topic, they usually focus on specific activities, e.g., the identification of the microservice boundaries in the legacy code. Also, existing pieces of work do not cover real-world scenarios, since they do not take into account organizational, operational, and technical aspects. To overcome this limitation, in this paper we present a roadmap for modernizing monolithic legacy systems with microservices. The roadmap is distilled from the existing body of knowledge, describing common activities and input/output information. The proposed roadmap is composed of eight activities, grouped in four phases, namely initiation, planning, execution, and monitoring. The main contributions are: (i) serve as a basis for practitioners to plan, execute, and monitor the modernization process; (ii) be a reference for researchers to design new studies; and (iii) motivate tool builders to deal with existing needs.

International audience; In this work, we present COLiDeR , the first PHY/MAC cross-layer protocol for practical twopath relaying using off-the-shelf half-duplex radios. It relies on three main contributions. First, based on an off-line performance comparison, COLiDeR selects the best interference management technique for a radio to handle two overlapping signals depending on the measured channel conditions. Then, considering the real decoding capacities of the nodes, COLiDeR introduces a dynamic relaying strategy with the objective of achieving high throughput while reducing decoding failures. This includes a lightweight protocol for the source to evaluate the channel state, a state-machine modeled approach driven by the source for switching between the defined scheduling schemes and an optional power adaptation mechanism for reducing the packet losses. Finally, COLiDeR comes with an adapted scheduling mechanism that aims to integrate two path-relaying in multi-hop wireless networks. Experiments on a 4-USRP testbed show that COLiDeR delivers between 80-95% of the relaying performance of an ideal full-duplex radio while incurring negligible decoding failures. Just as important, large-scale simulations show that COLiDeR improves network throughput in multihop topologies by over 20% compared to traditional interference-free transmissions.

In order to propagate transactions and blocks, today's blockchain systems rely on unstructured peer-to-peer overlay networks. In such networks, broadcast is known to be an inefficient operation in terms of message complexity and overhead. In addition to the impact on the system performance, inefficient or delayed block propagation may have severe consequences regarding security and fairness of the consensus layer. Therefore, we introduce Kadcast, a novel peer-to-peer protocol for block propagation in blockchain networks. Kadcast utilizes the well-known structured overlay topology of Kademlia to realize an efficient broadcast operation with tunable overhead. As our protocol is based on UDP, we incorporate forward error correction (FEC) to increase reliability while still maintaining its lightweight protocol architecture. To this end, we build a probabilistic model to analyze Kadcast's resilience to packet losses and node failures. Moreover, we evaluate Kadcast's block delivery performance, broadcast reliability, efficiency, and security based on advanced network simulations, which confirm the merits of the Kadcast protocol.

The modern world of information and technology has progressed hugely in the past decade. There is no doubt that internet of things (IoT) technologies have developed gradually and evolved the last ten years in drastic ways. IoT combines the useful to pleasant with is implementation in the industry, it is from this concept comes the idea of the industry 4.0. Managing huge amount of data and its uncertainty is very important challenge in the industry field; accordingly, providing the quality of service is a striking requirement that ensures it is operating accurately. This paper deals with the estimation of latency in transferring data from the field to the Cloud based on lightweight protocol MQTT over different gateways, we implemented the IoT tool Node-RED in the gateway for simulation.

The routing protocol in connected vehicles (CVs) is vulnerable to wormhole attacks where attackers can deceive legitimate nodes and purport them as if they are immediate or close neighbors. The Ad hoc On-Demand Distance Vector (AODV) protocol is a routing packet protocol designed for mobile nodes. However, AODV may not have been explicitly developed with security issues, specifically wormhole attacks, in mind, thereby requiring a detection algorithm to secure route establishment. This paper introduces the Wormhole-Protocol-Detector ( WPD ), a lightweight protocol for detecting and mitigating wormhole attacks. WPD is designed to work on a highway that is clustered into equal segments and equipped with road side units (RSUs) in predefined locations to monitor each segment. WPD consists of three phases: monitoring and detection of out-of-range packets, estimating the hop count between source and destination nodes, and identification of nodes participating in a wormhole connection. Together, these phases enable legitimate nodes to avoid the wormhole link and obtain secure routing paths between CVs. To validate our approach, we apply WPD to a CVs simulation where different types and lengths of wormhole, including a new wormhole attack method, can be applied to the CV network. Our experimental results suggest that WPD can detect wormhole attacks with a high detection rate and minimum false positives.

Fishing is a major industry that provides the livelihood for millions of families worldwide. The fishing vessels are typically at sea for 5--7 days at a stretch completely cut off from the land. In a low-cost offshore communication system for fishermen currently being developed, a multilevel P2MP backhaul network connects clusters of boats at the fishing zones. Each cluster forms a wireless mesh network with multiple potential gateways to the backhaul network. This work proposes a resilient lightweight protocol for optimized dynamic provisioning of the backhaul network based on an adaptive, demand driven algorithm. A local controller, capable of running on any access router, selects the optimal subset of gateways so that the rest can be reconfigured as mobile base stations or switched to power saver mode. It assigns every boat in a cluster to the most appropriate gateway maximizing the utilization of gateways. A proof-of-concept implementation has been done with a hardware test bed and the results are very encouraging.

We describe a lightweight protocol for oblivious evaluation of a pseudorandom function (OPRF) in the presence of semihonest adversaries. In an OPRF protocol a receiver has an input r; the sender gets output s and the receiver gets output F(s; r), where F is a pseudorandom function and s is a random seed. Our protocol uses a novel adaptation of 1-out-of-2 OT-extension protocols, and is particularly efficient when used to generate a large batch of OPRF instances. The cost to realize m OPRF instances is roughly the cost to realize 3:5m instances of standard 1-out-of-2 OTs (using state-of-the-art OT extension). We explore in detail our protocol's application to semihonest secure private set intersection (PSI). The fastest state-of- the-art PSI protocol (Pinkas et al., Usenix 2015) is based on efficient OT extension. We observe that our OPRF can be used to remove their PSI protocol's dependence on the bit-length of the parties' items. We implemented both PSI protocol variants and found ours to be 3.1{3.6 faster than Pinkas et al. for PSI of 128-bit strings and sufficiently large sets. Concretely, ours requires only 3.8 seconds to securely compute the intersection of 220-size sets, regardless of the bitlength of the items. For very large sets, our protocol is only 4:3 slower than the insecure naive hashing approach for PSI.

Publish/subscribe is known as a scalable and efficient data dissemination mechanism. Its efficiency comes from the optimized routing algorithms, yet few works exist on employing compression to save bandwidth, which is especially important in mobile environments. State of the art compression methods such as GZip or Deflate can be generally employed to compress messages. In this paper, we show how to reduce bandwidth even further by employing Shared Dictionary Compression (SDC) in pub/sub. However, SDC requires a dictionary to be generated and disseminated prior to compression, which introduces additional computational and bandwidth overhead. To support SDC, we propose a novel and lightweight protocol for pub/sub which employs a new class of brokers, called sampling brokers. Our solution generates, and disseminates dictionaries using the sampling brokers. Dictionary maintenance is performed regularly using an adaptive algorithm. The evaluation of our proposed design shows that it is possible to compensate for the introduced overhead and achieve significant bandwidth reduction over Deflate.

Radio Frequency Identification (RFID) systems are becoming more popular today because of the wide area of applications. It is being used in several industries such as the transport industry, sports, medical and government institutions. Its advantages such as the capacity to store more information than other identification technologies as well as the ease with which data can be read (since it doesn't require line of sight and human intervention), have sparked its widespread use and implementation in the various industries.The most widely used class of RFID tags is the class 1 tag because it offers identification functionality at low cost. Class 1 tags have limited computational power and memory resources. Due to these limitations, common authentication protocols such as AES cannot be implemented on the class 1 tags. As these tags provide essential implementation capabilities for development countries such as South Africa, it is vital that researchers focus on providing adequate security solutions. Taking into account the information security needs and performance limitations of the class 1 tags, we present a lightweight protocol based on the Hopper and Blum's human authentication protocol.

This paper presents the design and implementation of CCMP, a conference management protocol currently under standardization within the IETF, conceived at the outset as a lightweight protocol allowing conferencing clients to access and manipulate objects describing a centralized conference. The CCMP is a state-less, XML-based, client-server protocol carrying in its request and response messages conference information in the form of XML documents and fragments conforming to the centralized conferencing data model schema. It represents a powerful means to control basic and advanced conference features such as conference state and capabilities, participants and relative roles and details. We first focus on the design of the protocol and then discuss how it has been integrated in the Meetecho collaborative framework developed at the University of Napoli as an active playground for IETF standardization activities in the field of real-time applications and infrastructure.

Radio frequency identification technology is becoming ubiquitous and as an unfortunate side effect, more and more authentication solutions come to light that have plenty of security issues to deal with.In our former contribution we introduced a solely hash-based secure authentication algorithm that is capable of providing protection against most of the well-known attacks and performs exceptionally well even in very large systems. We gave a theoretical analysis of the SLAP protocol in the point of view of security and performance.In this paper we illustrate the proposed protocol's performance characteristics with measurements carried out in a simulation environment and compare with the theoretical results. We show the effects of numerous attacks and the system's different parameters on the authentication time. Finally, we examine the performance of two other protocols chosen from the literature in order to compare with SLAP algorithm and give proper explanation for the differences between them.

Radio configuration (R-CFG) files for software defined radio (SDR) devices can be downloaded over the air, allowing these devices to support multi-mode functionality using a single transceiver. SDR device manufacturers are likely to provide the R-CFGs, which may contain proprietary information. In such cases, it is necessary to secure the server/SDR device connection during the R-CFG download. Therefore, a protocol to securely connect manufacturer's server and SDR devices, called LSSL, is proposed. The LSSL is a lightweight protocol based on the SSL protocol, but it takes up less bandwidth, thus, it is more suitable for SDR handheld devices operating under low-capabilities, low-bandwidth and error-prone wireless links. However, securing the R-CFG download connection does not guarantee that a valid R-CFG, that is, an R-CFG that has been approved by the regulatory agency, has been downloaded. In order to install only valid R-CFGs, a secure download protocol is presented. The secure protocol includes, besides the LSSL, steps of mutual authentication, public/private key mechanisms for data encryption and decryption, and fingerprint calculations to check data integrity. Finally, the secure protocol is analyzed and shown to be deadlock and livelock-free, and to properly terminate. Experiments using Java 2 Micro Edition (J2ME) are performed to compare the LSSL and the SSL, and to demonstrate the feasibility of the secure protocol.

A new streaming protocol is proposed for multimedia applications. The proposed protocol, referred to as Lightweight Streaming Protocol (LSP), is an application layer protocol that sits atop UDP. The protocol is intended to improve the quality and reliability of media stream by borrowing features from reliable protocols such as retransmission and flow control while not sacrificing performance. The protocol offers semi-reliable transport. Instead of trying to guarantee 100% data delivery the protocol simply recovers as many packets as possible within a specified deadline. In addition the protocol incorporates features such as probabilistic redundant NAK transmission and flow control through selective frame dropping. Preliminary simulations show that LSP performs extremely well in channels with random packet loss such as congested networks. The protocol also performs reasonably well in channels that have short bursts of lost packets such as wireless networks.

As parallel machines scale to one million nodes and beyond, it becomes increasingly difficult to build a reliable network that is able to guarantee packet delivery. Eventually large systems will need to employ fault-tolerant messaging protocols that afford correct execution in the presence of a lossy network. In this paper we present a lightweight protocol that preserves message idempotence and is easy to implement in hardware. We identify the requirements for a correct implementation of the protocol. Experiments are performed in simulation to determine implementation parameters that optimize performance. We find that an aggressive implementation on a fat tree network results in a slowdown of less than 2x compared to buffered wormhole routing on a fault-free network.

A form of advertisement which is becoming very popular on the web is based on electronic coupon (e-coupon) distribution. E-coupons are the digital analogue of paper coupons which are used to provide customers with discounts or gift in order to incentive the purchase of some products. Nowadays, the potential of digital coupons has not been fully exploited on the web. This is mostly due to the lack of "efficient" techniques to handle the generation and distribution of e-coupons. In this paper we discuss models and protocols for e-coupons satisfying a number of security requirements. Our protocol is lightweight and preserves the privacy of the users, since it does not require any registration phase.