Search

The expanding and ubiquitous availability of the Internet of Things (IoT) have changed everyone's life easier and more convenient. Same time it also offers a number of issues, such as effectiveness, security, and excessive power consumption, which constitute a danger to intelligent IoT-based apps. Group managing is primarily used for transmitting and multi-pathing communications that are secured with a general group key and it can only be decrypted by an authorized group member. A centralized trustworthy system, which is in charge of key distribution and upgrades, is used to maintain group keys. To provide longitudinal access controls, Software Defined Network (SDN) based security controllers are employed for group administration services. Cloud service providers provide a variety of security features. There are just a few software security answers available. In the proposed system, a hybrid protocols were used in SDN and it embeds edge system to improve the security in the group communication. Tree-based algorithms compared with Group Key Establishment (GKE) and Multivariate public key cryptosystem with Broadcast Encryption in the proposed system. When all factors are considered, Broadcast Encryption (BE) appears to become the most logical solution to the issue. BE enables an initiator to send encrypted messages to a large set of recipients in a efficient and productive way, meanwhile assuring that the data can only be decrypted by defining characteristic. The proposed method improves the security, efficiency of the system and reduces the power consumption and minimizes the cost. [ABSTRACT FROM AUTHOR]

With the increasing use of portable devices, whenever information is sent through broadcasting channel, security re-lated challenges may occur so that the attackers can listen the information shared in the broadcasting channels such as Radio, TV and Wireless Adhoc Networks (WAN). To prevent such attacks, many cyber security-based algo-rithms are developed to enhance the security between the transmitter and receivers, but still the privacy attacks like man-in-the-middle attack, brute force attack etc occur. In this paper a technology called cross layer authentication is proposed where it uses the third party called server to authenticate between transmitter and receiver. The cross-layer authentication generates a group key by using the users (subscribers) identity information and channel (publisher) information and broadcasts the information to channels and users. The group key will continuously update and broadcasts the information to all the users in the channel whenever a user is added or deleted. Since the group key changes frequently, it will be quite challenging for the attackers to track the shared information. Hence, the proposed method avoids the attacks between transmitter and receiver by generating a group key using ECDSA algorithm and the information is encrypted by AES-128 bit. [ABSTRACT FROM AUTHOR]

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 this modern era of smart cities supported by digital locker facilities, e‐governance, e‐healthcare, e‐banking, e‐learning systems, and other digital systems, People use mobile phones to upload and share sensitive documents with others. Previous group key management schemes suffer from problems such as expensive double encryptions, the need for re‐encryption during every user leave operation and becoming vulnerable to attacks. Hence, to address these three issues, this manuscript introduces a pairing based cryptography based computationally efficient protocol powered by polynomial equations. First, to reduce computational overhead during group communication, the document is encrypted only once with minimal complexity before uploaded to cloud. Second, during a user leave or join operation, the re‐encryption of documents in cloud is avoided in the group manager side by tactically relieving the group key parameters from the polynomial parameters. Finally, the security analysis shows that the careful handling of secure parameters of users averts the collusion attack, man‐in‐the‐middle attack, message modification attacks, and all other possible attacks. The implementation results portray the capacity of this work to handle secure group communications in cloud storage. [ABSTRACT FROM AUTHOR]

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.

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. [ABSTRACT FROM AUTHOR]

Use of Internet-of-Things (IoT)-based wireless applications has been exponentially increased nowadays and likely to accelerate in near future. Thus, a large volume of traffic needs to be managed at the application server. In such scenario, the traditional single-server architecture shows serious performance bottleneck and needs to be replaced by multiple servers. In addition, several security and design vulnerabilities may arise while accessing application data through various resource-constraint mobile devices. Thus, ensuring entity authentication, application data confidentiality and energy-efficient computations are essential. In this article, we introduce a group key-based lightweight Mutual Authentication and Key Agreement (MAKA) protocol for multi-server environment. The proposed protocol is designed using low-cost cryptographic primitives (such as hash function and symmetric key encryption/decryption) to address energy-efficiency requirements of the resource-constraint mobile devices. It reduces computational burden of the registration center by distributing the traffic load into a group of servers. Additionally, registration center needs not to maintain one-to-one communication with its users whenever a new server is added to the system. The protocol achieves various security and design properties which are verified both formally and informally. Finally, we compare our protocol with others to show its applicability in real-life implementations. [ABSTRACT FROM AUTHOR]

In any multi-device / party systems supporting GRID and cloud-based applications, an essential constraint of these systems is the need of all tools and participants to interconnect with each other as members of a group in a secure approach. Group key management method is an essential functional element for any protected distributed communication setting. Key distribution method is a crucial factor in securing communication in grid computing. After the secure key management is executed, messages will be able to be securely exchanged between the grid units. A number of protocols have been proposed to maintain secure group key management. In this paper we present a new password base protocol for secure group key management in Grid computing environment, which is organized in two dynamic servicing layers: the grid application that needs grid services, and the grid services that act on behalf of the user. [ABSTRACT FROM AUTHOR]

Currently, 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. [ABSTRACT FROM AUTHOR]

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.

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 = 1 c c i × 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. [ABSTRACT FROM AUTHOR]

Cloud computing is an eminent technology for providing a data storage facility with efficient storage, maintenance, management and remote backups. Hence, user data are shifted from customary storage to cloud storage. In this transfer, the sensitive attributes are also shifted to cloud storage with high-end security. Current security techniques are processed with high encryption time and provide identical security of entire data with single key dependent. These processes are taking high computational time and leaks entire information if the key is hacked. The proposed Group Key Based Attribute Encryption using Modified Random Fibonacci Cryptographic (MRFC) technique rectifies these issues. Instead of machine learning technique, data owner preference-based attributes segregation is used to divide an input dataset into sensitive and non-sensitive attribute groups. Based on inter-organization usage and data owner's willingness, sensitive attribute is divided into 'n + 1′ subgroups and each subgroup is encrypted by 'n + 1' group keys. The encrypted sensitive subgroups are merged with non-sensitive attributes and uploaded into a private cloud. The novelties of this paper are, (1) data owner preferred sensitive attribute classification instead of machine learning algorithms, (2) sensitive attribute encryption instead of entire attributes, (3) To reduce encryption time without compromising data owner privacy, (4) To decrypt and access the required subgroup instead of the entire attribute. Our experimental results show that, the proposed method takes minimal processing time, better classification accuracy and minimal memory space with high security to selected attributes as compared to existing classification and security techniques. Hence, sensitive data security and privacy is achieved with minimal processing cost. [ABSTRACT FROM AUTHOR]

WSN is a wireless network with sensor nodes which are having limited energy, memory and computing power capacity. Now, its application areas are vast e.g. military, agriculture and environment etc. Sensors communicate with each other in the wireless environment so sensitive data needs to be secure in transmission path. Secure communication in WSN is a major challenging task. In this aspect, many researchers already proposed various algorithms. This paper contains analysis of some algorithms with the four parameters: Computation Cost, Communication Cost, Rekeying cost and key Storage cost. [ABSTRACT FROM AUTHOR]

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.

Key distribution is one of the most fundamental cryptographic primitives that can establish secure group communications in both centralized and distributed networks. A one-time session key is needed to be shared among all users to protect the exchanged messages. In traditional one-to-one communication, a one-time key is shared between two users. But in modern many-to-many communication, a group key is shared among multiple users. Lightweight group key distributions are especially attractive for wireless/mobile applications, since most mobile devices only have limited power in computation and communication. But most of the existing group key distributions need to execute complicate mathematical operations. In this paper, we first present a novel design of key distribution. The basic key distribution protocol requires only logic XOR operation. Then, we show the flexibility of our basic scheme by demonstrating its applications in various network models, including both centralized and distributed key distributions. All key distribution schemes proposed in this paper are lightweight since they only require logic XOR operations. Logic operation is the most efficient operation which is much faster than the other mathematical operations. Furthermore, all our proposed schemes are non-interactive and they require the least amount of communication. [ABSTRACT FROM AUTHOR]

Summary: Different devices with different characteristics form a network to communicate among themselves in Internet of Things (IoT). Thus, IoT is of heterogeneous in nature. Also, Internet plays a major role in IoT. So, issues related to security in Internet become issues of IoT also. Hence, the group and hierarchical management scheme for solving security issues in Internet of Things is proposed in this paper. The devices in the network are formed into groups. One of the devices is selected as a leader of each group. The communication of the devices from each group takes place with the help of the leader of the corresponding group using encrypted key to enhance the security in the network. Blom's key predistribution technique is used to establish secure communication among any nodes of group. The hierarchy is maintained such that the security can be increased further, but the delay is increased as it takes time to encrypt at every level of hierarchy. Hence, the numbers of levels of hierarchy need to be optimized such that delay is balanced. Hence, this algorithm is more suitable for delay‐tolerant applications. The performance of the proposed Algorithm is evaluated and is proved to perform better when compared with the legacy systems like Decentralized Batch‐based Group Key Management Protocol for Mobile Internet of Things (DBGK). [ABSTRACT FROM AUTHOR]

This paper addresses the issue in managing a group key among dynamic group of nodes in Mobile Ad hoc Networks (MANETs), where the participants frequently miss the group key update, commonly known as rekeying. In this paper, we propose a broadcast stateless and distributed Group Key Management framework: Genetic based Group Key Agreement scheme, for supporting dynamic rekeying mechanism in MANET. The rekeying scheme operates with hash functions and Lagrange interpolation polynomial implementation over finite area for group key establishment. Moreover, to provide a strong security mechanism, a revocation system is presented to gather accurate rate of node misbehaviours. The simulation results show that the proposed group key management scheme achieved higher performance and security compared with other existing key management schemes. Moreover, the scheme detects both selfish and malicious attacks fairly at lower overhead. [ABSTRACT FROM AUTHOR]

In this paper, we propose a secret group-key generation scheme in physical layer, where an arbitrary number of multi-antenna LNs (LN) exist in mesh topology with a multi-antenna passive eavesdropper. In the first phase of the scheme, pilot signals are transmitted from selected antennas of all nodes and each node estimates channels linked to it. In the second phase, each node sequentially broadcasts a weighted combination of the estimated channel information using selected coefficients. The other LNs can obtain the channel information used for group-key generation while the eavesdropper cannot. Each node then can generate a group key by quantizing and encoding the estimated channels into keys. We apply well-known quantization schemes, such as scalar and vector quantizations, and compare their performance. To further enhance the key-generation performance, we also provide how to determine the antennas at each node used for group-key generation and the coefficients used in the broadcast phase. The simulation results verify the performance of the proposed secret group-key generation scheme using various key-related metrics. We also verify the practical robustness of our scheme by implementing a testbed using universal software radio peripheral. After generating secret common key among three nodes, we also test it using the National Institute of Standards and Technology test suit. The generated key passes the test and it is random enough for communication secrecy. [ABSTRACT FROM AUTHOR]

The structure of public encryption key cannot meet the performance requisition for group key management based on one-decryption-key one-encryption-key algorithm. All group members need to participate in rekeying if the public encryption key is updated. To solve the problem, a structured public encryption key is proposed. Decryption keys are composed into a key set, any decryption key with key independence from the set has limited capability to modify the public encryption key, so the rekeying implements successfully by self-configuration mode without support of powerful trusted entity, and the new public encryption key does not break the validity of other decryption key members. In this perspective, the proposed public encryption key structure enriches the relationship between decryption key and encryption key, and extends the key operations for dynamic groups. Besides, it is particularly adaptable to group key management of networks in harsh environment. [ABSTRACT FROM AUTHOR]

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.