Key Pre-distribution Scheme Research Articles

Key Pre-distribution Schemes via Certain Resolvable Block Designs

Earlier optimal key pre\(-\)distribution schemes (KPSs) for distributed sensor networks (DSNs) were proposed using combinatorial designs via transversal designs, affine, and partially affine resolvable designs. Here, nearly optimal KPSs are introduced and a class of such KPSs is obtained from resolvable group divisible designs. These KPSs are nearly optimal in the sense of local connectivity. A metric for the efficiency of KPSs is given. Further, an optimal KPS has also been proposed using affine resolvable \( L_{2} \)-type design.

TurboBlom: A light and resilient key predistribution scheme with application to Internet of Things.

In the Internet of Things (IoT), there are often devices that are computationally too constrained to establish a security key using traditional key distribution mechanisms such as those based on the Diffie-Hellman key exchange. To address this, current solution commonly rely on key predistribution schemes (KPSs). Among KPSs, the Blom scheme provably provides the highest resilience against node capture attacks. This, however, comes at high computational overhead, because the Blom scheme requires many multiplications over a large finite field. To overcome this computational overhead, we present TurboBlom, a novel amendment of the Blom scheme. TurboBlom circumvents the need for field multiplications by utilizing specialized generator matrices, such as random zero-one matrices. We demonstrate that, through this approach, TurboBlom can significantly reduce the computational overhead of the Blom scheme by orders of magnitude. In our next key finding, we demonstrate that TurboBlom offers a level of resilience against node capture that is virtually on par with the Blom scheme. Notably, we prove that the gap between the resilience of the two schemes is exponentially small. These features of TurboBlom (i.e., low computational overhead and high resilience) make it suitable for computationally constrained devices. Such devices exist in abundance in IoT, for example, as part of Low Power and Lossy Networks (LLNs). To demonstrate a sample application of TurboBlom, we show how to use it to enable sender authentication in the Routing Protocol for LLNs (RPL), a standard routing protocol for IoT.

On Key and Multiple Space Key Pre-Distribution Schemes in Wireless Sensor Networks with a Combinatorial Block Design Structure

On Key and Multiple Space Key Pre-Distribution Schemes in Wireless Sensor Networks with a Combinatorial Block Design Structure

Optimal key pre‐distribution schemes from affine resolvable and partially affine resolvable designs

AbstractVarious key pre‐distribution schemes (KPSs) for distributed sensor networks (DSNs) were obtained from different combinatorial designs. A block design may be mapped to a KPS where is the number of nodes or network size and is the number of keys (points) per node. A KPS is corresponding to a symmetric balanced incomplete block design has full connectivity where all nodes are connected to each other. But it is desirable that all nodes do not share common keys as the compromise of any node will destroy the whole network (see Lee & Stinson, 2005; Martin, 2009). To meet the situation, Lee and Stinson (2005) introduced μ—common intersection design which has disjoint blocks and these disjoint blocks can establish a secure communication through certain common intersecting blocks. Here we have proposed optimal KPSs from affine resolvable and partially affine resolvable balanced incomplete block designs, group divisible designs and L2—type designs. It is shown that these designs are important classes of μ—common intersection designs. The KPSs obtained here are optimal in the sense of local connectivity. Mathematics Subject Classification (2010): 94C30; 68R05; 05B05; 62K10.

Implementation of Elliptic Curves in the Polynomial Blom Key Pre-Distribution Scheme for Wireless Sensor Networks and Distributed Ledger Technology

One of the challenges in securing wireless sensor networks (WSNs) is the key distribution; that is, a single shared key must first be known to a pair of communicating nodes before they can proceed with the secure encryption and decryption of the data. In 1984, Blom proposed a scheme called the symmetric key generation system as one method to solve this problem. Blom’s scheme has proven to be λ-secure, which means that a coalition of λ+1 nodes can break the scheme. In 2021, a novel and intriguing scheme based on Blom’s scheme was proposed. In this scheme, elliptic curves over a finite field are implemented in Blom’s scheme for the case when λ=1. However, the security of this scheme was not discussed. In this paper, we point out a mistake in the algorithm of this novel scheme and propose a way to fix it. The new fixed scheme is shown to be applicable for arbitrary λ. The security of the proposed scheme is also discussed. It is proven that the proposed scheme is also λ-secure with a certain condition. In addition, we also discuss the application of this proposed scheme in distributed ledger technology (DLT).

Combinatorial Design Based Key Pre-distribution Scheme with High Scalability and Minimal Storage for Wireless Sensor Networks

Combinatorial Design Based Key Pre-distribution Scheme with High Scalability and Minimal Storage for Wireless Sensor Networks

A High Resilience and High Scalable Key Pre-distribution Scheme Based on Combinatorial Designs for Resource-Constrained Devices in IoT Networks

A High Resilience and High Scalable Key Pre-distribution Scheme Based on Combinatorial Designs for Resource-Constrained Devices in IoT Networks

Key pre-distribution scheme over the continuous periodic functions space

Implementation for the key preliminary distribution scheme in the continuous functions space is proposed. Key materials are formed based on linear differential operator. User characteristics are presented in the form of a harmonic series. We show that this approach allows you to develop a common encryption key. A linear differential operator is formed only from even order derivatives. Odd order derivatives do not affect the encryption key value.

Two-dimensional diagonal layer hash chain based key pre-distribution scheme

Recently, Ehdaie et al. proposed a two-dimensional hash chain based key pre-distribution (2DHC-KPD) scheme that can enhance resiliency against node-capture attack when compared with the conventional hash chain based key pre-distribution (HC-KPD) scheme. However, these HC-KPD-like schemes cannot resist the advanced node-capture attack (ANA) that attackers have the knowledge of the identifiers of sensor nodes. In this paper, we adopt the diagonal layer from the two-dimensional key map in 2DHC-KPD scheme to design the diagonal layer hash chain based key pre-distribution (DLHC-KPD) scheme. Compared with all HC-KPD-like schemes, our DLHC-KPD scheme has the best resiliency against node-capture attack, and is also the only scheme that can resist against the ANA. The trade-off is more hash operations.

Enhancing the connectivity and resiliency of random key pre-distribution schemes for wireless sensor network

Enhancing the connectivity and resiliency of random key pre-distribution schemes for wireless sensor network

Data transmission system of networked digital voice room based on Internet of Things technology

In order to solve the problem of poor transmission performance caused by data congestion in network digital language lab, its data transmission system is designed based on the technology of internet of things. In the hardware part, the main control circuit and transmission interface circuit are designed to reduce the signal reflection caused by the change of line width and angle. In the software part, the data transmission compression algorithm is designed to reduce the communication overhead. The internet of things technology is used to set data transmission nodes, and the weighted fairness data transmission protocol is set to control the energy efficiency of transmission. The random key pre-distribution scheme based on the hash key chain is used to construct the data security transmission model. The experimental results show that, compared with the data transmission system based on data mining and cloud computing, the designed system achieves the lowest word error rate and sentence error rate, and has better data transmission performance.

Key Distribution Strategy of Wireless Sensor Network Based on Multi-Hash Chain

Key management is the basis of the security mechanism for wireless sensor networks and services, and random key pre-distribution is the most effective key management mechanism at present. However, there is a potential challenge to most current random key pre-distribution strategies: it is difficult to achieve both ideal network security connectivity and network survivability. In this paper, we present a novel random key pre-distribution scheme based on the hash chain. By adjusting certain system parameters, such as the hash chain length, the number of common auxiliary nodes and the number of hash chains, a sensor node only need to preload a few of keys, making it possible to establish the pairwise key with high probability among its neighboring nodes. The proposed scheme can still maintain strong network survivability even if there are many compromised nodes. The theoretical analysis and simulation experiments show that the proposed scheme is not only effective and secure, but also scalable.

A Scalable Key Pre-distribution Scheme based on the Unital Design for the Internet of Things Security

In recent years, the Internet of Things (IoT) has swept through most aspects of people lives, where all objects are connected to a common network. Therefore, the security of IoT devices is naturally crucial. As for the constrained resources of IoT devices, we need to have lightweight encryption algorithms. Accordingly, the symmetric key establishment is a favourite paradigm for securing IoT. In this study, a key pre-distribution scheme (KPS) has been proposed based on the combinatorial design for IoT. The proposed KPS has been created to increase network scalability. Therefore, a combinatorial design called the unital design has been applied for the establishment of keys. In the present scheme, a kind of mapping has been proposed from the unital design to the key establishment, which yields a network with high scalability. The results indicate that the present scheme increases network scalability considerably with high resilience.

On the Minimum Node Degree and k-Connectivity in Inhomogeneous Random K-Out Graphs

Inhomogeneous random K-out graphs were recently introduced to model heterogeneous sensor networks secured by random pairwise key predistribution schemes. First, each of the n nodes is classified as type-1 (respectively, type-2) with probability 0 <; μ <; 1 (respectively, 1-μ) independently from each other. Next, each type-1 (respectively, type-2) node draws 1 arc towards a node (respectively, K <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sub> arcs towards K <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sub> distinct nodes) selected uniformly at random, and then the orientation of the arcs is ignored. It was recently established that the inhomogeneous random K-out graph is 1-connected asymptotically almost surely (a.a.s.) if and only if K <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sub> =ω(1). In this work, we analyze the k-connectivity of inhomogeneous random K-out graphs; i.e., with k=1, 2, <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> ⋯</sub> , the property that the network remains connected despite the removal of any k-1 nodes or links. We first establish a zero-one law for the property that the minimum node degree is at least k. In particular, we present scaling conditions on μ and K <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sub> such that the resulting graph has minimum degree at least k with probability approaching one (respectively, zero) constituting the one-law (respectively, zero-law), as the number of nodes gets large. We show that for k=2, 3, <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">⋯</sub> , we need to set K <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sub> = \frac 11-μ(logn +(k-2)loglogn + ω(1)) for the network to have a minimum node degree of at least k a.a.s. Next, we prove that having K <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sub> = \frac 11-μ(logn +(k-2)loglogn + ω(1)) also ensures that the graph is k-connected a.a.s., meaning that the zero-one laws for minimum node degree and k-connectivity coincide. We present simulation results to demonstrate the usefulness of the results in the finite node regime. The results given here indicate an interesting fact about inhomogeneous random K-out graphs, i.e., that the number of additional edges needed to go from 1-connectivity to k-connectivity with k ≥ 2 is unexpectedly larger as compared to many classical random graph models studied before.

IMPLEMENTATION OF BLOM’S KEY PREDISTRIBUTION SCHEME BY USING ELLIPTIC CURVE CRYPTOGRAPHY

Cryptography, along with its various methods is used to serve the security communication purpose. Cryptography is said to be secure if the encryption key is hard to break by the attacker. Initially, Blom’s Key pre-distribution uses an integer finite field which makes this scheme easy to be intervened by attackers and criminal activists. Hence, this study suggests implementing the Elliptic Curve Cryptography to better enhance the security of the original Blom’s. In this proposed scheme, points generated from the elliptic curve will be appointed as public identifiers to be used in the original scheme. The private key and session key of each user are generated using the addition law mathematical operation with public identifiers assigned. Two users who intend to communicate with each other will obtain a common session key. Overall, the modification of Blom’s Key pre-distribution scheme will be presented in this study.

PUF-Based Mutual-Authenticated Key Distribution for Dynamic Sensor Networks

Because of the movements of sensor nodes and unknown mobility pattern, how to ensure two communicating (static or mobile) nodes authenticate and share a pairwise key is important. In this paper, we propose a mutual-authenticated key distribution scheme based on physical unclonable functions (PUFs) for dynamic sensor networks. Compared with traditional key predistribution schemes, the proposal reduces the storage overhead and the key exposure risks and thereby improves the resilience against node capture attacks. Mutual authentication is provided by the PUF challenge-response mechanism. However, the PUF response is not transmitted in plain forms so as to resist the modelling attacks, which is vulnerable in some existing PUF-based schemes. We demonstrate the proposed scheme to improve the secure connectivity and other performances by analysis and experiments.

A survey of key pre-distribution schemes based on combinatorial designs for resource-constrained devices in the IoT network

Currently, IoT is being used as a novel tool in many applications. Some applications use the end nodes such as wireless sensor network, RFID and embedded systems referred to as resource-constrained devices. These devices have limitations in computing and communication power, memory capacity and power. One of the approaches to discuss key distribution in these devices is to apply and use key pre-distribution schemes (KPSs) as a lightweight solution. Also, the combinatorial designs application in key pre-distribution has been considered as a suitable method due to the low overhead in the shared key discovery phase between devices. This paper assessed the combinatorial designs used in key pre-distribution, and then, compared these designs using KPSs evaluation metrics. Finally, by tabulating all the considered key pre-distribution methods in a comparison table, it was stated that all of these methods could be used in different applications depending on their strengths.

How not to secure wireless sensor networks: a plethora of insecure polynomial‐based key pre‐distribution schemes

Three closely related polynomial-based group key pre-distribution schemes have recently been proposed, aimed specifically at wireless sensor networks. The schemes enable any subset of a predefined set of sensor nodes to establish a shared secret key without any communications overhead. It is claimed that these schemes are both secure and lightweight, that is, making them particularly appropriate for network scenarios where nodes have limited computational and storage capabilities. Further studies have built on these schemes, for example, to propose secure routing protocols for wireless sensor networks. Unfortunately, as shown by the author, all three schemes are completely insecure; whilst the details of their operation vary, they share common weaknesses. In two cases, we show that an attacker equipped with the information built into just one sensor node can compute all possible group keys, including those for which the attacked node is not a member; this breaks a fundamental design objective. In the other case, an attacker equipped with the information built into at most two sensor nodes can compute all possible group keys. In the latter case, the attack can also be achieved by an attacker armed with the information from a single node together with a single group key to which this sensor node is not entitled. Repairing the schemes appears difficult, if not impossible. The existence of major flaws is not surprising given the complete absence of any rigorous proofs of security for the proposed schemes. A further recent work proposes a group membership authentication and key establishment scheme based on one of the three key pre-distribution schemes analysed here; as the author demonstrates, this scheme is also insecure, as the attack we describe on the corresponding pre-distribution scheme enables the authentication process to be compromised.

Nested block design as key pre-distribution in wireless sensor networks

An accumulation of wireless sensor nodes is combined together to form the Wireless Sensor Networks. The sensor nodes are distributed haphazardly without any decided method into a natural setting, which is generally inhospitable and it is difficult to provide key-chains to each node for security as they are haphazardly distributed. In this paper, we use Nested Block Design (NBD) as Key Pre-distribution Scheme (KPS) and found out that NBD support large networks with fewer keys in each node than Symmetric Balanced Incomplete Block Designs (SBIBD) and Transversal Design (TD[Formula: see text]), provide higher resiliency than SBIBDs and better connectivity than TD[Formula: see text], tradeoff between local connectivity and resiliency ([Formula: see text]) is lower than SBIBD but more than TD[Formula: see text] and key-node ratio ([Formula: see text]) is same for [Formula: see text] but lower than SBIBD.

ABAC Implementation Based on Key Pre-Distribution Scheme

In the article, the KDP key pre-distribution scheme is modified for attribute access control. A scheme for implementing attribute-based access control on symmetric encryption is proposed. There are three participants in the scheme: a key distribution server, a subject, and a storage server. The key distribution server sends key content over secure channels when the system is initialized. The key materials content is determined by the attributes of the object and the subject. The storage server calculates the object ′s encryption key based on the object ′s key materials and attributes. The object is stored encrypted. If the subject has the necessary attributes, it can calculate the encryption key and access to object. If the subject does not have a sufficient set of attributes, the key cannot be computed and access is denied.