Long-Lived Self-Healing Group Key Distribution Scheme with Backward Secrecy

Rams, Tomasz; Pacyna, Piotr

doi:10.1109/netsys.2013.19

Cited by 5 publications

(27 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hybrid group key management schemes [29][30][31][32] are about the best use of both schemes: a centralized distribution scheme and a distributed key agreement scheme. Lastly, a self-healing group key distribution scheme (SGKD) is for wireless networks including sensor networks [33][34][35][36][37][38][39][40][41][42][43][44][45][46][47][48][49][50]. In this paper, we focus on SGKD schemes because SISS's application includes both networks of wired and wireless and SISS has more relations with SGKD schemes than other schemes.…”

Section: Related Work and Applicationmentioning

confidence: 99%

“…The main point of self-healing schemes is that group members can recover the missing session keys without retransmission of the missing messages from the GM (group manager). A SGKD scheme is largely divided into four categories again: polynomial based SGKD (P-SGKD) schemes [33][34][35][36][37], vector space secret sharing based SGKD schemes [38][39][40][41], bilinear pairings based SGKD schemes [42,43], and exponential arithmetic based SGKD (E-SGKD) schemes [44][45][46][47][48][49][50][51]. P-SGKD and vector space secret sharing based SGKD schemes are generally known as "not efficient".…”

Section: Related Work and Applicationmentioning

confidence: 99%

“…P-SGKD schemes can be divided into two types based on using Lagrange Interpolation or not. In [33,[45][46][47]] E-SGKD schemes are constructed from P-SGKD schemes with Lagrange Interpolation. The other P-SGKD schemes without Lagrange Interpolation can be classified into two types again based on using hash chains or not.…”

Section: Related Work and Applicationmentioning

confidence: 99%

See 2 more Smart Citations

Secure Information Sharing System for Online Patient Networks

Park

2019

Security and Communication Networks

View full text Add to dashboard Cite

Recently, privacy emerged as a hot issue again, as the General Data Protection Regulation (GDPR) of EU has become enforceable since May 25, 2018. This paper deals with the problem of health information sharing on a website securely and with preserving privacy. In the context of patient networks (such as ‘PatientsLikeMe’ or ‘CureTogether’), we propose the model Secure Information Sharing System (SISS) with the main method of group key cryptosystem. SISS addresses important problems of group key systems. (1) The new developed equations for encryption and decryption can eliminate the rekeying and redistribution process for every membership-change of the group, keeping the security requirements. (2) The new 3D Stereoscopic Image Mobile Security Technology with AR (augmented reality) solves the problem of conspiracy by group members. (3) SISS uses the reversed one-way hash chain to guarantee forward secrecy and backward accessibility (security requirements for information sharing in a group). We conduct a security analysis of SISS according to group information sharing secrecy and an experiment on its performance. Consequently, although current IT paradigm is changing to be more and more ‘complicated’, ‘overlapped’, and ‘virtualized’, SISS makes it possible to securely share sensitive information from collaborative work.

show abstract

Section: Related Work and Applicationmentioning

confidence: 99%

Section: Related Work and Applicationmentioning

confidence: 99%

See 1 more Smart Citation

Secure Information Sharing System for Online Patient Networks

Park

2019

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…After Staddon’s first self-healing group key distribution (SGKD) scheme, many SGKD schemes were proposed. Up to now, four kinds of SGKD schemes exist: polynomial based SGKD (P-SGKD) schemes [ 2 , 3 , 4 , 5 , 6 ], vector space secret sharing based SGKD schemes [ 7 , 8 , 9 , 10 ], bilinear pairings based SGKD schemes [ 11 , 12 , 13 ] and exponential arithmetic based SGKD (E-SGKD) schemes [ 1 , 2 , 14 , 15 ]. Among them, vector space secret sharing based SGKD schemes and the bilinear pairings based SGKD schemes are inefficient compared with the other two in terms of the storage overhead and the communication cost.…”

Section: Introductionmentioning

confidence: 99%

Exponential Arithmetic Based Self-Healing Group Key Distribution Scheme with Backward Secrecy under the Resource-Constrained Wireless Networks

Guo

Zheng

Zhang³

et al. 2016

Sensors

View full text Add to dashboard Cite

In resource-constrained wireless networks, resources such as storage space and communication bandwidth are limited. To guarantee secure communication in resource-constrained wireless networks, group keys should be distributed to users. The self-healing group key distribution (SGKD) scheme is a promising cryptographic tool, which can be used to distribute and update the group key for the secure group communication over unreliable wireless networks. Among all known SGKD schemes, exponential arithmetic based SGKD (E-SGKD) schemes reduce the storage overhead to constant, thus is suitable for the the resource-constrained wireless networks. In this paper, we provide a new mechanism to achieve E-SGKD schemes with backward secrecy. We first propose a basic E-SGKD scheme based on a known polynomial-based SGKD, where it has optimal storage overhead while having no backward secrecy. To obtain the backward secrecy and reduce the communication overhead, we introduce a novel approach for message broadcasting and self-healing. Compared with other E-SGKD schemes, our new E-SGKD scheme has the optimal storage overhead, high communication efficiency and satisfactory security. The simulation results in Zigbee-based networks show that the proposed scheme is suitable for the resource-restrained wireless networks. Finally, we show the application of our proposed scheme.

show abstract

“…Other techniques, such as subset difference re-keying [ 21 ], bilinear pairings [ 22 , 23 ], vector space secret sharing [ 24 , 25 ] and the exponential arithmetic [ 26 ], are also used to design SGKD schemes.…”

Section: Introductionmentioning

confidence: 99%

Improved One-Way Hash Chain and Revocation Polynomial-Based Self-Healing Group Key Distribution Schemes in Resource-Constrained Wireless Networks

Chen

Xie

2014

Sensors

View full text Add to dashboard Cite

Self-healing group key distribution (SGKD) aims to deal with the key distribution problem over an unreliable wireless network. In this paper, we investigate the SGKD issue in resource-constrained wireless networks. We propose two improved SGKD schemes using the one-way hash chain (OHC) and the revocation polynomial (RP), the OHC&RP-SGKD schemes. In the proposed OHC&RP-SGKD schemes, by introducing the unique session identifier and binding the joining time with the capability of recovering previous session keys, the problem of the collusion attack between revoked users and new joined users in existing hash chain-based SGKD schemes is resolved. Moreover, novel methods for utilizing the one-way hash chain and constructing the personal secret, the revocation polynomial and the key updating broadcast packet are presented. Hence, the proposed OHC&RP-SGKD schemes eliminate the limitation of the maximum allowed number of revoked users on the maximum allowed number of sessions, increase the maximum allowed number of revoked/colluding users, and reduce the redundancy in the key updating broadcast packet. Performance analysis and simulation results show that the proposed OHC&RP-SGKD schemes are practical for resource-constrained wireless networks in bad environments, where a strong collusion attack resistance is required and many users could be revoked.

show abstract

Long-Lived Self-Healing Group Key Distribution Scheme with Backward Secrecy

Cited by 5 publications

References 23 publications

Secure Information Sharing System for Online Patient Networks

Secure Information Sharing System for Online Patient Networks

Exponential Arithmetic Based Self-Healing Group Key Distribution Scheme with Backward Secrecy under the Resource-Constrained Wireless Networks

Improved One-Way Hash Chain and Revocation Polynomial-Based Self-Healing Group Key Distribution Schemes in Resource-Constrained Wireless Networks

Contact Info

Product

Resources

About