Matrix-based memory efficient symmetric key generation and pre-distribution scheme for wireless sensor networks

Khan, Ahmad Salman; Gabidulin, E.M.; Honary, Bahram; Ahmed, Hassan

doi:10.1049/iet-wss.2011.0097

Cited by 25 publications

(12 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Khan et al proposed a symmetric key establishment scheme [20] where a symmetric matrix is used along with a generator matrix having maximum rank distance (MRD) codes. A symmetric matrix of size × , where represents number of symbols over a finite field.…”

Section: Journal Of Sensorsmentioning

confidence: 99%

See 1 more Smart Citation

Disjoint Key Establishment Protocol for Wireless Sensor and Actor Networks

et al. 2016

View full text Add to dashboard Cite

Key distribution is essential for providing secure communication between commercial and sensitive applications of wireless sensor and actor networks (WSANs). It becomes more challenging when any of the intermediate sensor nodes is compromised by the adversaries as the messages carrying secure keys will be exposed and links will be unreliable. This paper presents a Disjoint Key Establishment Protocol (DKEP) that does not require transmitting keys across the nodes. In DKEP, each node is preloaded with one row and one column from a matrix. After the deployment, indices for row and column are exchanged between the two nodes and values at intersection of row and column index will be used to calculate the key on each node. DKEP is verified by performing formal analysis using Rubin Logic and validated using simulations in NS-2. Simulation results demonstrate the effectiveness and efficiency of DKEP compared to contemporary schemes in terms of reducing storage and communication cost and improving resilience against node compromise attacks. Moreover, the proposed scheme is implemented in a group-based mobile application scenario for secure message exchange.

show abstract

Section: Journal Of Sensorsmentioning

confidence: 99%

“…During inter-WSAN communication, two ordinary nodes from different regions communicate using two actors and gateway node. Probability Pr Gateway Node to calculate the existence of an uncompromised gateway node in the path can be calculated using (20) where is the cluster size and is number of nodes captured by an attacker in the network:…”

Section: Resiliencementioning

confidence: 99%

Disjoint Key Establishment Protocol for Wireless Sensor and Actor Networks

et al. 2016

View full text Add to dashboard Cite

show abstract

“…However, the storage requirement of (k + 1) m−1 integers from G F( p) of each sensor makes this scheme to become impractical for establishing a group key but only suitable for establishing pair-wise keys. Khan et al [13] is a deterministic, interactive scheme that can only establish a pair-wise keys between 2 sensors. Matrix operation is needed for establishing a pair-wise key.…”

Section: Performance Evaluation and Comparisonmentioning

confidence: 99%

“…Their scheme provided a higher probability for non-compromised sensors to establish secure communication links than that demonstrated in previous schemes. Khan et al [13] proposed a pre-distribution scheme using a symmetric matrix and a generator matrix of maximum rank distance to establish pairwise keys for sensor nodes.…”

Section: Introductionmentioning

confidence: 99%

Predistribution Scheme for Establishing Group Keys in Wireless Sensor Networks

Harn

Hsu

2015

IEEE Sensors J.

View full text Add to dashboard Cite

Special designs are needed for cryptographic schemes in wireless sensor networks (WSNs). This is because sensor nodes are limited in memory storage and computational power. In 1992, Blundo et al. proposed a noninteractive group key establishment scheme using a multivariate polynomial. Their scheme can establish a group key of m sensors. Since each share is a polynomial involving m − 1 variables and having degree k, each sensor needs to store (k + 1) m−1 coefficients from GF( p), which is exponentially proportional to the size of group. This makes their scheme only practical when m = 2 for peer-to-peer communication. So far, most existing predistribution schemes in WSNs establish pairwise keys for sensor nodes. In this paper, we propose a novel design to propose a predistribution scheme for establishing group keys in WSNs. Our design uses a special-type multivariate polynomial in Z N , where N is a RSA modulus. The advantage of using this type of multivariate polynomial can limit the storage space of each sensor to be m(k + 1), which is linearly proportional to the size of group communication. In addition, we prove the security of the proposed scheme and show that the computational complexity of the proposed scheme is efficient.Index Terms-Wireless sensor networks, group keys, pre-distribution keys, multi-variate polynomials, RSA. He is currently investigating new ways of using secret sharing in various applications.Ching-Fang Hsu received the M.Eng. and Ph.D. degrees in information security from the

show abstract

“…Pre-shared key is the easiest kind of key establishment process, and the required key in node communication is stored in the network nodes by the Key Distribution Center prior to deployment. Because the scheme of key pre-distribution in the system is almost completed prior to the deployment, and it is generally based on a simple and efficient symmetric encryption algorithm, widely used in distributed, self-organizing wireless communication networks [1][2][3][4].…”

Section: Introductionmentioning

confidence: 99%