Group Communication Protocols Research Articles

Lightweight and secure D2D group communication for wireless IoT

In recent years, wirless Internet of Things (IoT) technology has developed rapidly, and the reuse of spectrum resources, network efficiency, and the diversity of multi-communication scenarios have brought great challenges to the existing Internet of Things. And Device to Device (D2D) communication technology in 5th Generation Mobile Communication Technology (5G) has good application prospects in these aspects. Therefore, the combination with D2D can well solve the needs in the wirless Internet of things. However, safe and effective communication has become an urgent problem to be solved. In this paper, this paper proposes a D2D group communication protocol for wireless IoT in 5G. In this protocol, the Chinese remainder theorem is introduced into the protocol design, and a secure and efficient group authentication scheme is constructed based on secret sharing and Chebyshev Polynomials. The formal security proof using Burrows Abadi Needham (BAN) logic and informal security analysis show that our proposed protocol meets the security requirements. Through performance analysis, compared with other related schemes, this scheme not only provides better security, but also has obvious advantages in computation and communication efficiency.

Implementation of Authenticated Group Key Management Scheme for Wireless Sensor Networks

The group key management technique is an important technique for cryptographic applications. In this paper, we implemented our proposed method [1] on a group key management protocol for group communication. The proposed protocol is authenticated group key distribution protocol is a mechanism for distributing a group key. We also discussed security analysis and attacks in active and passive adversary model. Also, it ensures semantic security as well as Key freshness of the group key. Along with this, they provide implicit and mutual authentication of the group key. Furthermore, the protocols provide key independence, provide Perfect Forward Secrecy and are resistant to Known Key Attack Implementation of proposed protocol in NS2 simulator.

Performance of MAODV and ODMRP Routing Protocol for Group Communication in Mobile Ad Hoc Network

Performance of MAODV and ODMRP Routing Protocol for Group Communication in Mobile Ad Hoc Network

Performance of MAODV and ODMRP Routing Protocol for Group Communication in Mobile Ad Hoc Network

A MANET is a self-conFigureuring system of mobile hosts connected by wireless links. The routers are free to move randomly and organize themselves arbitrarily; thus, the network's wireless topology may change rapidly and unpredictably. Routing is the process of exchanging information from one station to the other stations of the network. Multicasting is a popular mechanism for supporting group communication. In a multicast session, the sender transmits only one copy of each message that is replicated within the network and delivered to multiple recipients. This multicast routing is highly deal with self-organized network in recent days due to its broadcast characteristics. However, devising multicast protocols to provide group communications in mobile ad-hoc networks is significantly more complicated, because of the wireless medium, changing topology, battery power and available bandwidth as well. This paper, evaluates two prominent on-demand multicast routing protocols for group communication, namely, Multicast Ad hoc On-Demand Distance Vector (MAODV) and On-Demand Multicast Routing Protocol(ODMRP) as increasing number of multicast sources and receivers in both single-active multicast group and multi-active multicast group in the network.

A robust and secure image sharing scheme with personal identity information embedded

In a (t, n)-threshold secret image sharing (SIS) scheme, the secrecy of a secret image relies on check and balance among participants. Unfortunately, the decentralized management also brings an underlying security flaw, i.e., once an attacker impersonates an authorized participant to submit a fake shadow for reconstruction no information about the secret image can be revealed. In order to resist such an identity-based attack, a novel SIS scheme with identity-based authentication is proposed, where a natural image is encoded through compressive sensing and then the compressive image is divided into n shadows (i.e., shares) according to an innovate way in which the production of shadows is controlled by participants’ identification number. Only when any t or more authorized participants cooperate together can the original image be reconstructed. Besides, a simple but efficient non-uniform scalar quantization method and a group communication protocol are presented to perfect the proposed scheme. Performance and security analyses indicate that our scheme possesses many advantages, including no pixel expansion, flexible shadow size, progressive display capability, error-resilient capability, no necessity for secure channels, and high security against statistical attack, brute-force attack, and identity-based attack.

Quantum Secure Group Communication

We propose a quantum secure group communication protocol for the purpose of sharing the same message among multiple authorized users. Our protocol can remove the need for key management that is needed for the quantum network built on quantum key distribution. Comparing with the secure quantum network based on BB84, we show our protocol is more efficient and securer. Particularly, in the security analysis, we introduce a new way of attack, i.e., the counterfactual quantum attack, which can steal information by “invisible” photons. This invisible photon can reveal a single-photon detector in the photon path without triggering the detector. Moreover, the photon can identify phase operations applied to itself, thereby stealing information. To defeat this counterfactual quantum attack, we propose a quantum multi-user authorization system. It allows us to precisely control the communication time so that the attack can not be completed in time.

A Dynamic and Cross-Domain Authentication Asymmetric Group Key Agreement in Telemedicine Application

Telemedicine offers medical services remotely via telecommunications systems and physiological monitoring devices. Group-oriented communication is an important application for telemedicine. However, transmission of information over an insecure channel such as Internet or private data storing generates a security problem. Therefore, authentication, confidentiality, and privacy are important challenges in telemedicine. Therefore, developing suitable encryption communication protocol for group communication is quite important for modern medicine. Group key agreement is one way to ensure the security of group-oriented communication for telemedicine. In this paper, we propose a dynamic and cross-domain authenticated asymmetric group key agreement. The protocol adopts cross-domain authentication mechanism to avoid the security risks of key escrow and the complexity of certificate management. It supports the dynamic group key update of nodes for forward secrecy and backward security of group key, and also achieving the key self-certified, the member participated group key agreement can self-certify whether the calculated group keys are correct. The protocol is proven secure under the inverse computational Diffie-Hellman problem assumption, and the performance analysis shows that the proposed scheme is highly efficient. The proposed scheme is more suitable for security group communication in telemedicine.

Sender dynamic, non-repudiable, privacy-preserving and strong secure group communication protocol

Establishing a secure communication channel among a group of individuals is a critical issue in group oriented applications. In implementation, besides the basic confidentiality requirement, we also expect the group communications to be sender dynamic, forward secure, non-repudiable and privacy preserving. Traditional approaches, i.e., group key agreement and broadcast encryption cannot achieve the above requirements simultaneously and efficiently. In this paper, we propose our solution to secure group communications using a new security tool called identity based asymmetric group key agreement protocol with sender non-reputation and privacy. The new notion allows a group of users to negotiate a common group encryption key and their respective group decryption keys. After that, users inside/outside the group who have the knowledge of the group encryption key are able to send non-repudiable and privacy-preserving messages to the group confidentially. Further, even all the users’ private keys are later corrupted, the messages broadcasted previously remain secure. Following this definition, we propose a concrete protocol which is proven to be secure against chosen-ciphertext attacks (CCA) directly. We also show the potential applications of our new protocol in instant messaging applications, such as Whatsapp, Wechat, Messenger.

Moversight: a group communication protocol for mobile scenarios

The increasing mobility of Internet users and the growing need to collaborate with staff travelling on business belong to the key characteristics of the future Internet. Mobile collaborative applications require novel schemes for group communication that actively support collaborations in wireless scenarios. An intrinsic problem of collaborations in wireless scenarios is the temporary connection loss with the group due to user mobility and network issues. Existing group communication protocols do not sufficiently support this situation. In this paper, we present a new peer-to-peer group communication protocol, called Moversight, that was specifically designed to support closed group cooperation in mobile environments with varying churn rates. It applies a new group communication paradigm, called mobile optimistic virtual synchrony, to handle churn-related peer failures. It enhances the virtual synchrony paradigm for mobile scenarios. The paper introduces the paradigm and describes the main protocol features of Moversight. Finally we present simulation results to demonstrate the applicability of the protocol.

Hybrid Broadcast Group Management Protocol for Secure, Scalable and Efficient Group Communication

In hasty growth of communication, security plays a central role in maintaining confidentiality of data in group communication. Keeping the data intended for the group in confidential manner is the most important security feature need to be sustained for the group communication. An efficient group key management mechanism named as Hybrid Broadcast Group Management Protocol (HBGMP) is devised based on the Reverse Function (RF) and Chinese Remainder Theorem (CRT). The distinctive security among the subgroups is ensured by the reverse function and the session ID of each subgroup is calculated by employing Chinese remainder theorem. By contraption, the Session ID using Chinese Remainder Theorem, with which a cohort of n users requires Sub Group Service Provider (SGSP) to do O (n/m) computation for communication and the storage cost are diminished by diverting the computing load of the Group Service Provider (GSP) into the SGSP. The significance of this protocol is the group member needs to store only two different values during the entire life span and also the rekey message is broadcasted which brings down the communication cost to O(1). The protocol is defined generally for any applications in hybrid architecture. The proposed architecture using CRT and Reverse function is scalable for hefty sized dynamically changing group.

MEGCOM: Minimum-Energy Group COMmunication in Multihop Wireless Networks

Given the increasing demand from wireless applications, designing energy-efficient group communication protocols is of great importance to multihop wireless networks. A group communication session involves a set of member nodes, where each of them needs to send a certain number of data packets to all other members. In this paper, we consider the problem of building a shared multicast tree spanning the member nodes in static wireless networks such that the total energy consumption of a group communication session using the shared multicast tree is minimized. Since this problem was proven as NP-complete, we propose, under our Minimum-Energy Group COMmunication (MEGCOM) framework, three distributed approximation algorithms with provable approximation ratios. When the transmission power of each wireless node is fixed and identical, our first two algorithms have the approximation ratios of ${\cal O}(\ln(\Delta + \hbox{1}))$ and ${\cal O}(\hbox{1})$ , respectively, where $\Delta$ is the maximum node degree in the network. When the transmission power of each wireless node is adjustable, our third algorithm again delivers a constant approximation ratio. We also use extensive simulations to verify the performance of our algorithms.

A hybrid clock group communication protocol

In distributed systems, a group of multiple processes are required to cooperate with each other. Here, each process is peer and directly exchanges messages with other processes without centralised coordination. Each process has to causally deliver messages in a scalable group. Messages can be causally delivered to every process in linear clock (LC) and vector (VC) protocols. Here, some pair of messages ordered in the LC protocol may not be causally related, i.e., unnecessarily ordered. In this paper, we discuss a hybrid clock (HC) protocol to causally deliver messages in a scalable group in order to reduce the number of unnecessarily ordered messages. The HC protocol takes advantage of the LC and physical clock (PC) protocols. We show unnecessarily ordered messages can be reduced in the HC protocol compared with the LC protocol through experimentation.

B-SPECS+: Batch Verification for Secure Pseudonymous Authentication in VANET

The security and privacy preservation issues are prerequisites for vehicular ad hoc networks. Recently, secure and privacy enhancing communication schemes (SPECS) was proposed and focused on intervehicle communications. SPECS provided a software-based solution to satisfy the privacy requirement and gave lower message overhead and higher successful rate than previous solutions in the message verification phase. SPECS also presented the first group communication protocol to allow vehicles to authenticate and securely communicate with others in a group of known vehicles. Unfortunately, we find out that SPECS is vulnerable to impersonation attack. SPECS has a flow such that a malicious vehicle can force arbitrary vehicles to broadcast fake messages to other vehicles or even a malicious vehicle in the group can counterfeit another group member to send fake messages securely among themselves. In this paper, we provide a secure scheme that can achieve the security and privacy requirements, and overcome the weaknesses of SPECS. Moreover, we show the efficiency merits of our scheme through performance evaluations in terms of verification delay and transmission overhead.

Dynamic group communication for large-scale parallel data mining

Exascale systems are the next frontier in high-performance computing and are expected to deliver a performance of the order of 1018 operations per second using massive multicore processors. Very large- and extreme-scale parallel systems pose critical algorithmic challenges, especially related to concurrency, locality and the need to avoid global communication patterns. This work investigates a novel protocol for dynamic group communication that can be used to remove the global communication requirement and to reduce the communication cost in parallel formulations of iterative data mining algorithms. The protocol is used to provide a communication-efficient parallel formulation of the k-means algorithm for cluster analysis. The approach is based on a collective communication operation for dynamic groups of processes and exploits non-uniform data distributions. Non-uniform data distributions can be either found in real-world distributed applications or induced by means of multidimensional binary search trees. The analysis of the proposed dynamic group communication protocol has shown that it does not introduce significant communication overhead. The parallel clustering algorithm has also been extended to accommodate an approximation error, which allows a further reduction of the communication costs. The effectiveness of the exact and approximate methods has been tested in a parallel computing system with 64 processors and in simulations with 1024 processing elements.

Mobile agent group communication ensuring reliability and totally-ordered delivery

In this paper, an atomic mobile agent group communication protocol is designed to have the following beneficial features. The protocol enables each agent to adaptively choose a small number of forwarders among its visiting nodes based on its decision. Also, it replicates paths on which messages should be transmitted to their targeting mobile agents in an effective manner. The mobile agent group location cache each sending agent keeps in our protocol can considerably speed up message delivery to a group of agents and lower message forwarding load imposing on forwarders. Furthermore, it allows messages destined to a group of agents to be reliably delivered to all surviving agents in the same order despite their mobility and F forwarders’ failures unlike the other existing ones. Simulation results indicate that our protocol considerably performs better than the existing one in terms of message delivery time and location information management overhead.

Enhancing group communication with self-manageable behavior

Group communication protocols (GCPs) play an important role in the design of modern distributed systems. A typical GCP exchanges control messages to provide message delivery guarantees, and a key point in the configuration of such a protocol is to establish the right trade-off between message overhead and delivery latency. This trade-off becomes even a greater challenge in systems where computing resources and application requirements may change at runtime. In such scenarios, the configuration of a GCP must be continuously re-adjusted to attain certain performance goals, or to adapt to current resource availability. This paper addresses this challenge by proposing self-managing mechanisms based on feedback control theory to a GCP especially designed to be self-manageable; in the proposed protocol, message overhead and delivery latency can be adjusted at runtime to follow some new operating set-point. The evaluation performed under varied scenarios shows the effectiveness of our approach.

A Secure Key Transfer Protocol for Group Communication

Providing security for messages in group communication is more essential and critical nowadays. In group oriented applications such as Video conferencing and entertainment applications, it is necessary to secure the confidential data in such a way that intruders are not able to modify or transmit the data. Key transfer protocols fully rely on trusted Key Generation Center (KGC) to compute group key and to transport the group keys to all communication parties in a secured and secret manner. In this paper, an efficient key generation and key transfer protocol has been proposed where KGC can broadcast group key information to all group members in a secure way. Hence, only authorized group members will be able to retrieve the secret key and unauthorized members cannot retrieve the secret key. Hence, inorder to maintain the forward and backward secrecy, the group keys are updated whenever a new member joins or leaves the communication group. The proposed algorithm is more efficient and relies on NP class. In addition, the keys are distributed to the group users in a safe and secure way. Moreover, the key generated is also very strong since it uses cryptographic techniques which provide efficient computation.

Fault Tolerance and Recovery for Group Communication Services in Distributed Networks

Group communication services (GCSs) are becoming increasingly important as a wide field of promising applications has emerged to serve millions of users distributed across the world. However, it is challenging to make the service fault tolerance and scalable to fulfill the voluminous demand of users in a distributed network (DN). While many reliable group communication protocols have been dedicated to addressing such a challenge so as to accommodate the changes in the network, they are often costly or require complicated strategies to handle the service interruptions caused by node departures or link failures, which hinders the service practicability. In this paper, we present two schemes to address the challenges. The first one is a location-aware replication scheme called NS, which makes replicas in a dispersed fashion that enables the services on nodes to gain immunity of failures with different patterns (e.g., network partition and single point failure) while keeping replication overhead low. The second one is a novel failure recovery scheme that exploits the independence between service recovery and structure recovery in time domain to achieve quick failure recovery. Our simulation results indicate that the two proposed schemes outperform the existing schemes and simple alternative schemes in service success rate, recovery latency, and communication cost.

Scalable group communication supporting configurable levels of consistency

SUMMARYGroup communication is deployed in many evolving Internet‐scale cooperative applications such as multiplayer online games and virtual worlds to efficiently support interaction on information relevant to a potentially very large number of users or objects. Especially peer‐to‐peer based group communication protocols have evolved as a promising approach to allow intercommunication between many distributed peers. Yet, the delivery semantics of robust and scalable protocols such as gossiping is not sufficient to support consistency semantics beyond eventual consistency because no relationship on the order of events is enforced. On the other hand, traditional consistency models provided by reliable group communication providing causal or even total order are restricted to support only small groups.This article proposes the cluster consistency model which bridges the gap between traditional and current approaches in supporting both scalability and ordered event delivery. We introduce a dynamic and fault tolerant cluster management method that can coordinate concurrent access to resources in a peer‐to‐peer system and can be used to establish fault‐tolerant configurable cluster consistency with predictable reliability, running on top of decentralised probabilistic protocols supporting scalable group communication. This is achieved by a general two‐layered architecture that can be applied on top of the standard Internet communication layers and offers a modular, layered set of services to the applications that need them. Further, we present a fault‐tolerant method implementing causal cluster consistency with predictable reliability, running on top of decentralised probabilistic protocols supporting group communication.This paper provides analytical and experimental evaluation of the properties regarding the fault tolerance of the approach. Furthermore, our experimental study, conducted by implementing and evaluating the two‐layered architecture on top of standard Internet transport services, shows that the approach scales well, imposes an even load on the system, and provides high‐probability reliability guarantees. Copyright © 2011 John Wiley & Sons, Ltd.

On predictable large-scale data delivery in prefix-based virtualized content networks

IPTV, software replication, and other large scale content distribution services raise the need for fast and efficient content delivery mechanisms in underlay as well as overlay networks. Multicast, the natural approach on the network layer, has not been deployed globally, and solutions are pushed to the application layer. For a flexible, sustainable deployment the distribution mechanisms in use should scale up to many thousand group members and provide predictable performance to dynamically adjust to actual performance requirements. In this paper, we present a rigorous analytical model complemented by extensive simulations for content delivery on prefix-based overlay trees. We examine BIDIR-SAM, a generic multicast distribution scheme guided by prefixes that allow for late next-hop binding. Our evaluation quantitatively substantiates all major performance aspects. We derive the distribution functions of hop counts, packet replication loads, as well as all relevant cost measures, which scale logarithmically with network and receiver sizes. Prefix-based content delivery exhibits a churn resistance similar to the underlying key-based routing layer and a multicast efficiency scaling factor close to native group communication protocols. These results make the approach especially suitable for large and very large content groups.