Secure Multicast Research Articles

Query Based Location Aware Energy Efficient Secure Multicast Routing for Wireless Sensor Networks Using Fuzzy Logic

Query Based Location Aware Energy Efficient Secure Multicast Routing for Wireless Sensor Networks Using Fuzzy Logic

Secure Multicast Communications via RIS Against Eavesdropping and Jamming With Imperfect CSI

Secure Multicast Communications via RIS Against Eavesdropping and Jamming With Imperfect CSI

AC-SDVN: An Access Control Protocol for Video Multicast in Software Defined Vehicular Networks

The way to use limited bandwidth resources to achieve high-quality video services in vehicular networks is an important research topic. A large number of studies have shown that the fast-growing field of software defined networking (SDN) can provide solutions to the problems encountered by traditional IP networks when implementing video multicasting. However, there is no research addressing the security issues for this scenario. In this paper, we explore the application scenarios of video multicast in software defined vehicular networks (SDVN), and propose a secure and effective access control protocol to solve multicast security issues. This protocol realizes the authentication of multicast video requesting vehicles and RSUs. According to the authentication results, the SDN controller constructs multicast paths that only reach legitimate RSUs and vehicles, and only the vehicle passing the authentication can obtain video decryption keys. The protocol resists common attacks and satisfies the security requirements in vehicular networks. In addition, the scheme supports batch verification, which reduces the time cost of authentication, and adopts broadcast encryption technology to effectively reduce the communication load. Compared with related schemes, our protocol performs better in terms of computation and communication cost, packet loss rate, and time delay.

DLSMR: Deep Learning-Based Secure Multicast Routing Protocol against Wormhole Attack in Flying Ad Hoc Networks with Cell-Free Massive Multiple-Input Multiple-Output.

The network area is extended from ground to air. In order to efficiently manage various kinds of nodes, new network paradigms are needed such as cell-free massive multiple-input multiple-output (CF-mMIMO). Additionally, security is also considered as one of the important quality-of-services (QoS) parameters in future networks. Thus, in this paper, we propose a novel deep learning-based secure multicast routing protocol (DLSMR) in flying ad hoc networks (FANETs) with cell-free massive MIMO (CF-mMIMO). We consider the problem of wormhole attacks in the multicast routing process. To tackle this problem, we propose the DLSMR protocol, which utilizes a deep learning (DL) approach to predict the secure and unsecured route based on node ID, distance, destination sequence, hop count, and energy to avoid wormhole attacks. This work also addresses key concerns in FANETs such as security, scalability, and stability. The main contributions of this paper are as follows: (1) We propose a deep learning-based secure multicast routing protocol (DLSMR) to establish a high-stability multicast tree and improve security performance against wormhole attacks. In more detail, the DLSMR protocol predicts whether the route is secure based on network information such as node ID, distance, destination sequence, hop count, and remaining energy or not. (2) To improve the node connectivity and manage multicast members, we propose a top-down particle swarm optimization-based clustering (TD-PSO) protocol to maximize the cost function considering node degree, cosine similarity, cosine distance, and cluster head energy to guarantee convergence to the global optima. Thus, the TD-PSO protocol provides more strong connectivity. (3) Performance evaluations verify the proposed routing protocol establishes a secure route by avoiding wormhole attacks as well as by providing strong connectivity. The TD-PSO clustering supports connectivity to enhance network performance. In addition, we exploit the impact of the mobility model on the network metrics such as packet delivery ratio, routing delay, control overhead, packet loss ratio, and number of packet losses.

Opportunistic Relaying Technique over Rayleigh Fading Channel to Improve Multicast Security

Opportunistic Relaying Technique over Rayleigh Fading Channel to Improve Multicast Security

Enabling security in MANETs using an efficient cluster based group key management with elliptical curve cryptography in consort with sail fish optimization algorithm

AbstractIn MANET, group key management is a vital part of multicast security. But distribution of keys in an authenticated manner is a difficult task in group key management. The existing methods provide low security with high processing time during group key management resulting does not provide sufficient results. Therefore, enabling security in MANETs using an efficient cluster based group key management with elliptical curve cryptography in consort with sail fish optimization algorithm is proposed in this article for two‐level security with reduced computational overhead. At first, all the nodes in the cluster are structured in hierarchy method. The key server creates public key utilizing private key of the group node. Here, elliptical curve cryptography based meta‐heuristic sail fish optimization algorithm is used to select the optimal private key for better secure communication. After selecting this optimum private key, the key server creates the public key, and a common group key is created using this generated public keys. If the nodes joint or exit from the subgroup, the reset process is executed in group key management process. Finally, this process reduces the computational overhead of rekeying method. The proposed method is simulated by Python programming and network simulator‐3. The proposed elliptical curve cryptography based sail fish optimization algorithm attains 10.9%, 22.21%, and 11.43% low computational overhead, 19.34%, 13.45%, and 42.13% low latency, 43.45%, 22.21%, and 12.22% high packet delivery rate, 11.23%, 13.41%, and 21.11% high network life time than the existing methods.

One-Bit Statistical ECSI Learning for Single-Group Multicast Secure Beamforming

This letter investigates a binary learning mechanism for statistical eavesdroppers’ channel state information (SECSI), in which the transmitter utilizes one-bit signal-to-noise-ratio feedback to constantly learn the channel correlation matrices of the eavesdropping links without any prior SECSI. Correspondingly, with the updated SECSI estimate, the optimal single-group multicast secure beamforming (SGMC-SBF) is determined and probed continually for multicast secrecy rate maximization. Simulation results show that this convergent cognitive strategy could not only achieve higher ergodic multicast secrecy rate than the worst-case robust SGMC-SBF with imperfect SECSI, but also approach the ideal performance achieved by perfect SECSI.

Learning the ECSI from binary signals for cognitive multicast secure beamforming

This paper investigates cognitive single-group multicast secure beamforming (SGMC-SBF) in multicast scenario where an eavesdropper who acts as a regular user seeks to intercept the multicast service without authorization. This study emphasizes that the transmitter iteratively learns the eavesdropper’s spatial correlation matrix from the accumulated binary feedback on received signal-to-noise-ratio. In each iteration, the transmitter learns the eavesdropper’s spatial correlation matrix based on the historical beamformings and the historical binary feedback information, which is then used to design the optimal beamforming that will be used to learn eavesdropper’s spatial correlation matrix in the next iteration. Without loss of generality, it is assumed that the transmitter knows instantaneous channel state information (CSI) of the legitimate users (LCSI), but not the instantaneous or statistical CSI of the eavesdropper (ECSI). For comparison, we also established the corresponding genie-aided SGMC-SBF with perfect ECSI and two traditional robust schemes with erroneous and statistical ECSI, respectively. The numerical results verify that the proposed cognitive SGMC-SBF are feasible solutions that provide excellent performance.

Secure Message Transmission Using Centralized Group Key Distribution Protocol

Abstract: In the secure message transmission, transmitted information can only receive by the authorized group members. To achieve a secure communication, symmetric key (group key) is used to both encrypt and decrypt the information, that shared among the group members. This paper, proposes an efficient centralized group key management scheme (GKDP) for achieving a secure multicast communication between the group members that reduces the cost of computation of SERVER(S) and rekeying cost of group members. The group key (GK) generated in the multicast network is securely distributed with the help of the RSA cryptosystem. Whenever the new member joins the group, computation cost of S reduced by performing single addition, multiplication and encryption, for updating the group key (GK). Whenever the member leaves the group, S performs single subtraction, division and encryption, for updating the group key (GK). By comparing with existing group key management protocol, the proposed protocol has significantly reduced computation complexity and rekeying cost. The proposed protocol is tested on star topology, the test results compared with existing group key management protocol. The comparison results show that the proposed protocol is efficient in terms of reducing the computational complexity of S and rekeying cost of group members. Index Terms: Secure multicast, rekeying cost, computational complexity, centralized group key management.

An Efficient Authentication and Key Distribution Protocol for Multicast Service in Space-Ground Integration Network

Satellite communication technology has attracted the attention of researchers in the study of the sixth-generation (6G) mobile communication network because of its advantages of achieving global coverage with high cost-effectiveness and not being affected by terrain factors and human activities. In order to achieve efficient interconnection between terminals and networks, it is a new development trend of communication technology to integrate satellite communication networks and ground communication networks to construct the Space-Ground Integration Network (SGIN). Multicast service is widely used by network service providers to provide business services to users. Due to the characteristics of higher delay of space communication and unstable link compared with the ground network, if the ground multimedia multicast security protocol is directly applied to the space communication, it is difficult to guarantee the efficiency of the corresponding business service. The existing security protocols in the space information network are usually designed to ensure the security of end-to-end communication, and there are few studies on the security of multimedia multicast services. In view of the above situation, we design a new multicast service security protocol for the SGIN to realize the secure and efficient transmission in multicast services. In the protocol, we first design a key derivation scheme for the shared key between UE and BM-SC based on the existing 5G-AKA mechanism. Then, we propose a group-based multicast service registration mechanism. Finally, we propose a secure and efficient key distribution and update process of multicast service group key based on China Remainder Theorem (CRT). The formal verification tool Scyther is employed to analyze the security of the proposed protocol, and the results show that our scheme has valid security properties. We analyze the performance of the scheme by comparing it with the existing schemes in three aspects, such as signaling overhead, computational overhead, and bandwidth overhead. The comparison results show that our scheme is superior to other existing schemes. Finally, we build an experimental environment and test the delay, transmission rate, and CPU usage of the proposed system. The results show that our scheme improves the efficiency of multicast services while ensuring network security.

Internet of Medical Things-Based Secure and Energy-Efficient Framework for Health Care.

The Internet of Medical Things (IoMT) is a collection of medical equipment and software that can help patients get better care. The purpose of this study is to improve the security of data collected through remote health monitoring of patients utilizing Constrained Application Protocol (CoAP). Asymmetric cryptography techniques may be used to assure the security of such sensor networks. For communication between different IoMT devices and a remote server, the safe CoAP is compatible with the Datagram Transport Layer Security (DTLS) protocol for creating a secure session using existing algorithms such as Lightweight Establishment of Secure Session. The DTLS layer of CoAP, in contrast, has shortcomings in key control, session establishment, and multicast message exchange. As a consequence, for IoMT communication, the creation of an efficient protocol for safe CoAP session establishment is needed. Thus, to solve the existing problems related to key management and multicast security in CoAP, we have proposed an efficient and secure communication technique to establish a secure session key between IoMT devices and distant servers using lightweight Energy-Efficient and Secure CoAP Elliptic Curve Cryptography (E2SCEC2). The advantage of using E2SCEC2 over other identification methods such as Rivest-Shamir-Adleman (RSA) is its compact key size, which allows it to use a smaller key size. This article also compares these algorithms on parameters such as time spent generating keys, signature generation, and verification of E2SCEC2 and RSA algorithms, as well as energy consumption and radio duty cycle, to see if they are compatible in constrained environments.

IPv6 Multicast Vulnerability – An Overview

IPv6 is the next Internet Protocol version designed to eventually replace IPv4 as the amount of potentially allocated IPv4 addresses is insufficient. The vulnerabilities of IPv6 protocols and the attacks against them demand more attention to be paid. The multicast mechanism is one of the crucial mechanisms that are related to the nature of IPv6 protocol. Despite its usefulness in performing basic tasks in IPv6 environments, the multicast mechanism is considered as a security hole that calls to be understood by the security specialists and IPv6 network administrators. To address the multicast security aspects, this paper presents the attacks that utilize the multicast vulnerability along with the identification of countermeasures for each attack. In particular, this paper analyzes the state-of-the-art attacks and ranks them based on a new severity ranking method to provide significant security guidance for deploying IPv6 networks.

Equalization-Based Beamforming for Secure Multicasting in Multicast Wiretap Channels

In this paper, a beamforming scheme is proposed to maximize a secrecy multicast rate (SMR) in the multicast wiretap channel, in which the multiple unauthorized users overhear the multicast messages. The SMR is formulated by the ratio of multicast rate and information leakage in the numerator and denominator, respectively. By exploiting the SMR structure, we propose three doubly equalizing beamforming approaches: i) zero-forcing algorithm, ii) bottom-first algorithm, and iii) top-first algorithm. Depending on the algorithms, either the legitimate user channels or the unauthorized user channels are fully equalized, and the other set of channels are then equalized through a least-squares approach. While the zero-forcing algorithm optimizes the strength of legitimate user channels, the bottom-first and the top-first algorithms find the balance between the strengths of legitimate user channels and unauthorized user channels. The top-first algorithm encompasses the bottom-first algorithm, where the bottom-first algorithm encompasses the zero-forcing algorithm. Consequently, the proposed top-first algorithm outperforms the other two algorithms. The proposed top-first algorithm improves SMR by effectively preventing overhearing while sustaining almost maximum multicast rate and provide comparable SMR to the multicast rate obtained without unauthorized users. These results are verified by simulation.

Enhancing multicast security of cognitive radio networks with antenna correlations over Nakagami-m fading channels

In this paper, we investigate the impact of diversity and antenna correlations on the secrecy capacity and outage performance of a cognitive radio multicast network over Nakagami-m fading channels analytically. The proposed network consists of single primary and secondary user, multiple primary and secondary receivers, and multiple eavesdroppers. It is assumed that each user is equipped with single antenna while all the primary and secondary receivers, and eavesdroppers are equipped with multiple antennas. The primary and secondary users transmit their common messages to the respective receivers in the presence of multiple eavesdroppers. A mathematical model is developed to ensure successful reception of confidential information to the primary receivers protecting the activities of eavesdroppers neglecting the effect of interference due to secondary user. In order to analyze the security of the proposed model, closed-form analytical expressions have been derived for the secrecy multicast capacity, the secure outage probability for multicasting and the probability of non-zero secrecy multicast capacity. Analytical results are justified via Monte-Carlo simulations.

Energy Efficiency Optimization in Massive MIMO Secure Multicast Transmission.

Herein, we focus on energy efficiency optimization for massive multiple-input multiple-output (MIMO) downlink secure multicast transmission exploiting statistical channel state information (CSI). Privacy engineering in the field of communication is a hot issue under study. The common signal transmitted by the base station is multicast transmitted to multiple legitimate user terminals in our system, but an eavesdropper might eavesdrop this signal. To achieve the energy efficiency utility–privacy trade-off of multicast transmission, we set up the problem of maximizing the energy efficiency which is defined as the ratio of the secure transmit rate to the power consumption. To simplify the formulated nonconvex problem, we use a lower bound of the secure multicast rate as the molecule of the design objective. We then obtain the eigenvector of the optimal transmit covariance matrix into a closed-form, simplifying the matrix-valued multicast transmission strategy problem into a power allocation problem in the beam domain. By utilizing the Minorize-Maximize method, an iterative algorithm is proposed to decompose the secure energy efficiency optimization problem into a sequence of iterative fractional programming subproblems. By using Dinkelbach’s transform, each subproblem becomes an iterative problem with the concave objective function, and it can be solved by classical convex optimization. We guarantee the convergence of the two-level iterative algorithm that we propose. Besides, we reduce the computational complexity of the algorithm by substituting the design objective with its deterministic equivalent. The numerical results show that the approach we propose performs well compared with the conventional methods.

ECC-CoAP: Elliptic Curve Cryptography Based Constraint Application Protocol for Internet of Things

Constraint Application Protocol (CoAP), an application layer based protocol, is a compressed version of HTTP protocol that is used for communication between lightweight resource constraint devices in Internet of Things (IoT) network. The CoAP protocol is generally associated with connectionless User Datagram Protocol (UDP) and works based on Representational State Transfer architecture. The CoAP is associated with Datagram Transport Layer Security (DTLS) protocol for establishing a secure session using the existing algorithms like Lightweight Establishment of Secure Session for communication between various IoT devices and remote server. However, several limitations regarding the key management, session establishment and multi-cast message communication within the DTLS layer are present in CoAP. Hence, development of an efficient protocol for secure session establishment of CoAP is required for IoT communication. Thus, to overcome the existing limitations related to key management and multicast security in CoAP, we have proposed an efficient and secure communication scheme to establish secure session key between IoT devices and remote server using lightweight elliptic curve cryptography (ECC). The proposed ECC-based CoAP is referred to as ECC-CoAP that provides a CoAP implementation for authentication in IoT network. A number of well-known cryptographic attacks are analyzed for validating the security strength of the ECC-CoAP and found that all these attacks are well defended. The performance analysis of the ECC-CoAP shows that our scheme is lightweight and secure.

A Sidelink-Aided Approach for Secure Multicast Service Delivery: From Human-Oriented Multimedia Traffic to Machine Type Communications

To date, group-oriented communications have been mainly exploited for delivering multimedia services in human-oriented communications while, in future fifth generation (5G) cellular networks, objects will be the main target. Internet of Things (IoT) will undoubtedly play a key role in 5G networks, wherein massive machine-type communications (mMTC) feature a use case as crucial as challenging since cellular IoT connections are predicted to grow heavily in the next future. To boost capacity and energy efficiency, the 5G network can leverage device-to-device (D2D) communications which are recognized as an effective offloading technique. This is achieved thanks to the fact that, in legacy D2D communications, data are directly sent from one device to another, avoiding the crossing of the network. Obviously, the distributed nature of such a communication paradigm and the inherent broadcast nature of the wireless channel make it necessary to think how to secure the so called “sidelink” transmissions. This work proposes a protocol for the efficient and reliable management of multicast services in a 5G-oriented IoT scenario, in which security is a crucial requirement to be met. The proposed protocol is tailored to Narrowband IoT (NB-IoT) and makes use of D2D communications with the aim of improving network efficiency and optimizing network resource utilization. In addition, cyber security and social trustworthiness mechanisms are exploited to secure D2D communications.

Establishing UAV-Aided VBSs for Secure Multicasting

In this letter, we consider a UAV-aided multicasting system where the UAV is entasked with the job of disseminating a common file to multiple legitimate users (LUs) in the presence of multiple eavesdroppers. Due to the existence of line-of-signt (LoS) links between the UAV and the ground eavesdroppers, the delivery strategy of the UAV requires to be carefully designed so as to prevent the eavesdropping attack. To encourage advantageous secure transmission channels, we propose to serve the LUs in groups by letting the UAV sequentially visit favorable delivery points, i.e., the locations of vitrual base stations (VBSs). Accordingly, the placement optimization of VBSs is formulated as an advanced N-center (ANC) problem, which is NP-hard. To solve it, we put forward a branch-and-bound algorithm that iteratively invokes the advanced minimum enclosing ball (AMEB) procedure. Followed by the traveling salesman problem (TSP) algorithm, the flying trajectory of the UAV can be derived. Last, the numerical results demonstrate that our proposed algorithm can greatly cut down the mission completion time while guaranteeing security compared to the benchmark.

Efficient and Provably Secure Multireceiver Signcryption Scheme for Multicast Communication in Edge Computing

With the popularity of edge computing, edge nodes are connected with the Internet of Things (IoT) devices to process and analyze IoT-created data, and feedback corresponding results to users, devices, or data centers. In the edge computing environment, multicast is a typical communication pattern to support data transmitting between edges and devices. It allows the sender to send messages to multiple receivers in one broadcast message. To construct a secure multicast channel, the primary issue is to ensure the privacy and credibility of the transmitted message in the open wireless communication. Then, another essential issue for multicast channels is receiver anonymity, i.e., only the sender knows the receivers’ identities. Also, efficiency and provable security are critical in scheme design. In this article, we design a certificateless multimessage and multireceiver signcryption (CLMMSC) scheme by using the elliptic curve cryptography. To facilitate lightweight deployment, we adapt the certificateless mechanism to reduce the system operation and maintenance costs. Then, through security proofs, we demonstrate that the proposed scheme can achieve the expected security properties. The performance analysis shows that the proposed scheme has lower communication costs than previous CLMMSC schemes.

Building Scalable and Secure Multicast Delivery Infrastructure in a Local Area Network

Internet Protocol (IP) multicasting is a method for one-to-many and many-to-many communication between hosts in an IP network. This communication happens in a real-time synchronous fashion. It is a useful mechanism for distributing management data in a Local Area Network (LAN). Management data includes frequent updating of host Operating System (OS), security patches, OS update for network hardware, new configuration updates, etc. In the absence of any admission control or a source identification, any host with malicious intent can disseminate malicious codes or rootkits exploiting the underlying multicast framework. Routing protocols like RIPv2 and OSPF use a certain form of authentication to exchange routing information with their peer routers. However, their authentication and the distribution of routing information in its present form has several security and performance-related issues. Motivated through these problems, in this paper, we propose an efficient and scalable multicast architecture for distributing management and routing information in a LAN. We use Core-based Tree (CBT) for constructing the multicast delivery tree and the pseudo identity-based encryption of the underlying cryptosystem. We also demonstrate that our proposed multicast architecture is immune to a number of popular attacks.