Search

Internet of Things (IoT) is a network that can communicate between devices without human intervention. In this network, IoT devices collect sensor data and provide them for various applications. However, data collected from the device may include sensitive information. If this information is leaked, several serious problems will occur. Therefore, access control is presented to allow only authorized users to access important data. This paper proposes a model for organizing and managing groups with the group key (GK) so that only the authorized users can share data for access control. In particular, rekeying overhead is reduced. Because the IoT devices are resource-constrained, the network lifetime may be reduced as the rekeying overhead increases. There is a problem when group communication between multiple users is not used. If multiple users can easily access all data, the leakage of sensitive information will increase. To solve this problem, only users who need to share data join in a group based on the hyperledger fabric. Our approach groups users with the same GK and protects sensitive data by using secure communication links within the group. In addition, a trusted agent for rekeying sends a new GK to users in the group. Therefore, the security of data is guaranteed, and the network lifetime is extended. We analyze the storage cost, delay, and processing time for rekeying, and we also compare them according to the number of users and the depth of the key tree. The results of the performance analysis show that the proposed hyperledger fabric-based lightweight group management (H-LGM) outperforms the existing method in terms of storage cost, delay, and processing time.

In the virtual world, the authentication process is used to prove the identity for both of the server and the clients. Therefore, the authentication is an urgent issue for sharing data between users in the data warehouse systems. This paper presents the enhancement of Data Warehouse Signature (DWS) framework through proposing a novel authentication and group-key distribution model, based on the modular symmetric polynomials, to distribute a secure group-key between the manager and the chosen executors. To the best of our knowledge, we are the first to propose a group-key based on the symmetric polynomial and the modular arithmetic. This leads to increase the security level of the proposed model from t, where t is the symmetric polynomial degree, to ∑i=1cci×t, where c is the number of executors in the DWS system. In this paper, enhancing the DWS achieves the high performance using a parallel computing in our middleware. The proposed model has the lowest cost of computation, communication and complexity overheads among the existing security models. Additionally, security analysis shows that the proposed model achieves the key security, prevents insider and outsider attacks, and provides forward and backward secrecy.

AbstractCurrently, research on network functions virtualization focuses on using microservices in cloud environments. Previous studies primarily focused on communication between nodes in physical infrastructure. Until now, there is no sufficient research on group key management in virtual environments. The service is composed of microservices that change dynamically according to the virtual service. There are dependencies for microservices on changing the group membership of the service. There is also a high possibility that various security threats, such as data leakage, communication surveillance, and privacy exposure, may occur in interactive communication with microservices. In this study, we propose an ID‐based group key exchange (idGKE) mechanism between microservices as one group. idGKE defines the microservices' schemes: group key gen, join group, leave group, and multiple group join. We experiment in a real environment to evaluate the performance of the proposed mechanism. The proposed mechanism ensures an essential requirement for group key management such as secrecy, sustainability, and performance, improving virtual environment security.

The large-scale sharing needs of many enterprises promote the development of cloud storage. While the cloud computing stores the shared files outside the trust domain of the owner, the demands and concerns for file security is arising. In this paper, a Group Key Management Protocol for file sharing on cloud storage (GKMP) is proposed. Faced with network attacks from public channel, a group key generation scheme based on mixed encryption technology is proposed. And a verification scheme is used to prevent shared files from being attacked by the collusion attack of cloud providers' and group members'. Security and performance analyses indicate that the proposed protocol is both secure and efficient for data sharing in cloud computing.

Encryption with shared key is one of the methods to ensure secure communication. To meet the requirements of keys, this paper investigates the problem of generating private key (PK) and group key (GK) using correlated sources and discrete memoryless wiretap broadcast channel (DM-WBC), in presence of one-way public communication. In the model considered, one transmitter (Alice) and three receivers (Bob, Carol and Eve) are connected via a DM-WBC, and a one-way communication over a public noiseless channel, initiated by Alice, is available. Alice and Bob wish to share a PK that is concealed from Carol and Eve, and they also want to generate a GK with Carol that needs to keep secret from Eve. Under this model, the key capacity regions of PK and GK are established by designing joint source-channel coding schemes to achieve these regions. In PK-generation, the considered model can be viewed as a one receiver two-eavesdropper model, and Alice and Bob have access to correlated source sequences. In GK-generation, the considered model can be viewed as a two-receiver one eavesdropper model, and the three legitimate parties (Alice, Bob and Carol) all have the source observations. Furthermore, the security performance of the generated keys are analyzed by analyzing key leakage rate of each key.

Fog architectures are currently present in many applications. Constrained devices equipped with sensors produce measurements that will be sent to a nearby gateway, called the fog. The fog verifies, aggregates and forwards them to the server. Group authentication among these devices allows them to securely accept messages of the group members, resulting in faster updates in their process. When defining a security scheme, it should be considered that edge and fog devices are susceptible to attacks. Privacy of the devices should be guaranteed, with respect to outsiders and the fog. It should be impossible to track the connection pattern of devices with different fogs, even if several fogs are captured by an attacker. Inclusion of protection against potentially malicious fogs has not yet been considered in literature, especially not for group-based communications. We present a server-controlled group authentication and key agreement scheme, executed by the fog in collaboration with the devices that it can reach. The server, assumed to be fully trusted, is responsible for the registration and authorisation of the devices and initiates the key update process, whereas the fog takes care of the secure distribution process among its members. At the end, all entities in the group are ensured to possess the correct group key. Moreover, a pairwise secret key between device and server is obtained during the process. The proposed scheme is very efficient as it relies on elliptic curve cryptography and Lagrange interpolation. No initially shared secret key material among the entities needs to be pre-stored.

In smart grids, the access verification of a large number of intelligent gateways and terminal devices has become one of the main concerns to ensure system security. This means that smart grids need a new key management method that is safe and efficient and has a low computational cost. Although a large number of scholars have conducted relevant research, most of these schemes cannot balance the computational overhead and security. Therefore, we propose a lightweight and secure key management method, having a low computational overhead, based on blockchain for smart grids. Firstly, we redesigned the architecture of the smart grid based on blockchain and completed the division of various entities. Furthermore, we designed a pairing-free certification authenticated group key agreement method based on blockchain under the architecture. Finally, we achieved higher security attributes, and lower authentication delay and computational overhead, compared to the traditional schemes, as shown in performance analysis and comparison.

Cryptographic key management needs utmost security in generating, exchanging, using, rekeying, storing of keys, being used for communication purposes. Successful key management is critical to the security of a cryptosystem. This paper presents a detailed survey on group key management and its challenges in network independent and network dependent approaches. The paper also focuses on the advantages, disadvantages and security vulnerabilities of these protocols.

Many users who are in a cyber-space usually want to join the social group to have or to share their information. Now, there are two ways to join the group, the group manager invites them, and the users who want to join ask the owner. These days the group polices usually follow this way. But, it can be faced a security problem when the manager send group messages in near future because they don’t have any securities. Therefore, the security modules to join groups will be needed when they join the group or when they read the group messages. To set the security, we have to think how to keep the key such as a generation /an update/an arrangement, because all users need the key to join the groups or to read the group messages by decrypting. The key are going to be used to joining the group when it dynamically changes such as frequent group joining and leaving. If it applies or uses the existing methods in the smart cities which consider the users who will move globally, it could easily assume that the overhead/the cost of CPU will be increased and it follows capacity down because of lots of the key updates. So, to let them down, we suggest three key strategies, a group key, a subgroup key and a session key in this paper.

Witnesses of a dynamic accumulator (DA) can ensure whether an object has been accumulated.On the basis of this,node membership in a cluster was verified and a novel authenticated group key management protocol was proposed,which supports node revocation and addition.In order to establish a group key for a cluster,each member provides their assigned number to join accumulation.DAAG can not only guarantee the confidentiality of witnesses,but also keep non-members from calculating novel group keys by binding witness with group key update.The security and performance analyses show that DAAG is resistant against replay attack,forgery attack and collusion attack,and can provide forward security and backward security.

Wireless Sensor Network (WSN) is a growing area of research in terms of applications, life enhancement and security. Research interests vary from enhancing network performance and decreasing overhead computation to solving security flaws. Secure Group Communication (SGC) is gaining traction in the world of network security. Proposed solutions in this area focus on generating, sharing and distributing a group key among all group members in a timely manner to secure their communication and reduce the computation overhead. This method of security is called SGC-Shared Key. In this paper, we introduce a simple and effective way to secure the network through Hashed IDs (SGC-HIDs). In our proposed method, we distribute a shared key among the group of nodes in the network. Each node would have the ability to compute the group key each time it needs to. We provide a security analysis for our method as well as a performance evaluation. Moreover, to the best of our knowledge, we present for the first time a definition of joining or leaving attack. Furthermore, we describe several types of such an attack as well as the potential security impacts that occur when a network is being attacked.