A Rabin Cryptosystem-Based Lightweight Authentication Protocol and Session Key-Generation Scheme for IoT Deployment

Handling unpredictable attack vulnerabilities in self-proclaiming secure algorithms in WSNs is an issue. Vulnerabilities provide loop holes for adversary to barge in the privacy of the network. Attacks performed by the attacker can be active or passive. Adversary may listen to the sensitive information and exploit its confidentiality which is passive, or adversary may modify sensitive information being transferred over a WSN in case of active attacks. As Internet of things has basically three layers, middle-ware layer, Application layer, perceptron layer, most of the attacks are observed to happen at the perceptron layer in case of both wireless sensor network and RFID Tag implication Layer. Both are a major part of the perceptron layer that consist a small part of the IoT. Some of the major attack vulnerabilities are exploited by executing the attacks through certain flaws in the protocol that are difficult to identify and almost complex to identify in complicated bigger protocols. As most of the sensors are resource constrained in terms of memory, battery power, processing power, bandwidth and due to which implementation of complex cryptosystem to keep the data being transferred secure is a challenging phase. The three main objectives studied in this scenario are setting up the system, registering user and the sensors via multiple gateways. Generating a common key which can be used for a particular interaction session among user, gateway and the sensor network. In this paper, we address one or more of these objectives for some of the fundamental problems in authentication and mutual authentication phase of the WSN in IoT deployment. We prevent the leakage of sensitive information using the rabin cryptosystem to avoid attacks like Man-in-the-middle attack, sensor session key leakage, all session hi-jacking attack and sniffing attacks in which data is analyzed maliciously by the adversary. We also compare and prove the security of our protocol using proverif protocol verifier tool.

Security Techniques in MANET: A Study

MANET (mobile ad hoc network) is considered to be a network with no centralized control. This network typically faces two major challenges related to routing and security. Both these issues affect the performance of this network to a large extent. The black hole attack belongs to the category of active attacks that are launched to reduce the network throughput and other parameters. The research works carried out in the past used different techniques to isolate malicious nodes, but with the inclusion of extra hardware and software tools. The various techniques for the security in MANET are analyzed in terms of certain parameters. Keywords: MANET, Black Hole, Security Techniques

Development of methods for generation of digital watermarks resistant to distortion

Active attacks and natural impacts can lead to two types of image-container distortions: noise-like and geometric. There are also image processing operations, e.g. scaling, rotation, truncation, pixel permutation which are much more detrimental to digital watermarks (DWM). While ensuring resistance to removal and geometric attacks is a more or less resolved problem, the provision of resistance to local image changes and partial image deletion is still poorly understood. The methods discussed in this paper are aimed at ensuring resistance to attacks resulting in partial image loss or local changes in the image. This study's objective is to develop methods for generating a distortion-resistant digital watermark using the chaos theory. This will improve the resistance of methods of embedding the digital watermark to a particular class of attacks which in turn will allow developers of DWM embedding methods to focus on ensuring the method resistance to other types of attacks. An experimental study of proposed methods was conducted. Histograms of DWMs have shown that the proposed methods provide for the generation of DWM of a random obscure form. However, the method based on a combination of Arnold’s cat maps and Henon maps has noticeable peaks unlike the method based on shuffling the pixels and their bits only with Arnold’s cat maps. This suggests that the method based only on Arnold’s cat maps is more chaotic. This is also evidenced by the value of the coefficient of correlation between adjacent pixels close to zero (0.0109) for color DWMs and 0.030 for black and white images.

Quantum communication for sender anonymity based on single-particle with collective detection

Nowadays, identity protection has turned into a fundamental demand for online activities. Currently, the present quantum anonymous communication protocols mostly rely on multi-entanglement. In this paper, we propose an anonymous communication protocol for anonymous sender by using single-particle states. The protocol can be extended to a communication protocol where the sender and receiver are fully anonymous with the message kept secret. In terms of security, our protocol is designed to comply with the technique of collective detection. Compared to the step-by-step detection, collective detection, in which the participants perform detection only once, reduces the complexity of the protocol to some extent. Moreover, we analytically demonstrate the security of the protocol in the face of active attacks. Any active attack employed by an external or internal attacker cannot reveal any useful information about the sender’s identity. Meanwhile, any malicious behavior will be detected by honest participants.

A New Hybrid Online and Offline Multi-Factor Cross-Domain Authentication Method for IoT Applications in the Automotive Industry

Connected vehicles have emerged as the latest revolution in the automotive industry, utilizing the advent of the Internet of Things (IoT). However, most IoT-connected cars mechanisms currently depend on available network services and need continuous network connections to allow users to connect to their vehicles. Nevertheless, the connectivity availability shortcoming in remote or rural areas with no network coverage makes vehicle sharing or any IoT-connected device problematic and undesirable. Furthermore, IoT-connected cars are vulnerable to various passive and active attacks (e.g., replay attacks, MiTM attacks, impersonation attacks, and offline guessing attacks). Adversaries could all use these attacks to disrupt networks posing a threat to the entire automotive industry. Therefore, to overcome this issue, we propose a hybrid online and offline multi-factor authentication cross-domain authentication method for a connected car-sharing environment based on the user’s smartphone. The proposed scheme lets users book a vehicle using the online booking phase based on the secured and trusted Kerberos workflow. Furthermore, an offline authentication phase uses the OTP algorithm to authenticate registered users even if the connectivity services are unavailable. The proposed scheme uses the AES-ECC algorithm to provide secure communication and efficient key management. The formal SOV logic verification was used to demonstrate the security of the proposed scheme. Furthermore, the AVISPA tool has been used to check that the proposed scheme is secured against passive and active attacks. Compared to the previous works, the scheme requires less computation due to the lightweight cryptographic algorithms utilized. Finally, the results showed that the proposed system provides seamless, secure, and efficient authentication operation for the automotive industry, specifically car-sharing systems, making the proposed system suitable for applications in limited and intermittent network connections.

k , l -Anonymity in Wheel-Related Social Graphs Measured on the Base of k -Metric Antidimension

For the study and valuation of social graphs, which affect an extensive range of applications such as community decision-making support and recommender systems, it is highly recommended to sustain the resistance of a social graph G to active attacks. In this regard, a novel privacy measure, called the k , l -anonymity, is used since the last few years on the base of k -metric antidimension of G in which l is the maximum number of attacker nodes defining the k -metric antidimension of G for the smallest positive integer k . The k -metric antidimension of G is the smallest number of attacker nodes less than or equal to l such that other k nodes in G cannot be uniquely identified by the attacker nodes. In this paper, we consider four families of wheel-related social graphs, namely, Jahangir graphs, helm graphs, flower graphs, and sunflower graphs. By determining their k -metric antidimension, we prove that each social graph of these families is the maximum degree metric antidimensional, where the degree of a vertex is the number of vertices linked with that vertex.

Protecting Physical Layer Secret Key Generation from Active Attacks

Lightweight session key agreement schemes are expected to play a central role in building Internet of things (IoT) security in sixth-generation (6G) networks. A well-established approach deriving from the physical layer is a secret key generation (SKG) from shared randomness (in the form of wireless fading coefficients). However, although practical, SKG schemes have been shown to be vulnerable to active attacks over the initial “advantage distillation” phase, throughout which estimates of the fading coefficients are obtained at the legitimate users. In fact, by injecting carefully designed signals during this phase, a man-in-the-middle (MiM) attack could manipulate and control part of the reconciled bits and thus render SKG vulnerable to brute force attacks. Alternatively, a denial of service attack can be mounted by a reactive jammer. In this paper, we investigate the impact of injection and jamming attacks during the advantage distillation in a multiple-input–multiple-output (MIMO) system. First, we show that a MiM attack can be mounted as long as the attacker has one extra antenna with respect to the legitimate users, and we propose a pilot randomization scheme that allows the legitimate users to successfully reduce the injection attack to a less harmful jamming attack. Secondly, by taking a game-theoretic approach we evaluate the optimal strategies available to the legitimate users in the presence of reactive jammers.

BlueFMCW: Random Frequency Hopping Radar for Mitigation of Interference and Spoofing

Radars form a central piece in a variety of emerging applications requiring higher degrees of localization. However, two problems are anticipated as more radars are deployed: viz., (i) inter-radar interference and (ii) security attacks. While many prior proposals have addressed the problems, no work in the radar literature addressed them simultaneously. In this context, we introduce a novel frequency-modulated continuous-wave (FMCW) radar scheme (namely, BlueFMCW) that aims to alleviate the damage from interference and active attacks (e.g., spoofing). The technique designs that the waveform randomly hops across multiple frequencies to dilute the damage at a certain frequency. Moreover, we propose a phase alignment algorithm to remove the phase discontinuity while combining the beat signals from the randomly-hopped chirps. The simulation results show that the proposed technique can efficiently mitigate the interference and spoofing signals in various scenarios without costing its resolution.

Methods for secure cloud processing of big data

We study new methods of secure cloud processing of big data when solving applied computationally-complex problems with secret parameters. This is one of the topical issues of secure client-server communication. As part of our research work, we model the client-server interactions: we give specific definitions of such concepts as “solvable by the protocol”, “secure protocol”, “correct protocol”, as well as actualize the well-known concepts-“active attacks” and “passive attacks”. First, we will outline the theory and methods of secure outsourcing for various abstract equations with secret parameters, and then present the results of using these methods in solving applied problems with secret parameters, arising from the modeling of economic processes. Many economic tasks involve processing a large set of economic indicators. Therefore, we are considering a typical economic problem that can only be solved on very powerful computers.

A Secure IoT-Based Mutual Authentication for Healthcare Applications in Wireless Sensor Networks Using ECC

The role of wireless medical sensor networks (WMSNs) is very significant in healthcare applications of IoT. Online report generation and sharing the reports reduce the time and make the treatment of patients very fast. Here, the safety of patient data plays a crucial role. As there is a restriction of resources in sensor nodes, the design of authentication scheme for WMSNs is not an easy task in healthcare applications. Healthcare professionals are using their mobile to collect data from patients' bodies. To use WMSNs in healthcare applications, cryptanalysis of Li et al. is done and found that it suffers from various attacks. Hence, a new efficient privacy-preserving user authenticated scheme using elliptic curve cryptography (ECC) is proposed. The security analysis of scheme is performed using random oracle model, in addition to BAN logic. AVISPA is used for simulation to prove that the proposed scheme can resist passive and active attacks. Finally, the performance comparison of schemes shows that the proposed scheme performs better.