Anti-collusive Self-healing Key Distribution Scheme with Revocation Capability

Du, Chunlai; Hu, Mingzeng; Zhang, Hongli; Zhang, Weizhe

doi:10.3923/itj.2009.619.624

Cited by 16 publications

(19 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although it is efficient in term of cost due to the elegantly designed mask polynomial, a collusion attack called sandwich attack may happen here. To prevent sandwich attack, Du et al introduce a secret random number for each session in [34]. Only if the random number is not cracked, attackers still get nothing about the session key.…”

Section: Related Workmentioning

confidence: 99%

“…In the following sections, we give a detailed performance evaluation of the proposed LiSH+ scheme from the storage and communication point of view. [30] (t + 1) log q (t + 1) log q X scheme of [34] (2s 2 -2s 1 + 4) log q (t + (1 + m)/2) log q X Partial scheme3 of [37] (2m + 1) log q (2t + 1) log q X Partial LiSH (2s 2 -2s 1 + 6) log q (t + l + 1) log q X X X LiSH+ (t + s 2s 1 + 6) log q (t + l + 1) log q XDynamic X X…”

Section: Performance Evaluationmentioning

confidence: 99%

“…(t + (1 + m)/2) log q is the average communication cost because the communication cost of scheme of [34] is (t + j) log q for section j. [34] scheme3 of [37] (a) (b) Figure 6.…”

Section: Performance Evaluationmentioning

confidence: 99%

“…Assume that q is a 128-bit integer. LiSH, LiSH+(l=5) LiSH, LiSH+(l=10) LiSH, LiSH+(l=20) scheme3 of [30] scheme of [34] scheme3 of [37] Figure 7. Comparison of the size of broadcasting packet with different buffer size l. Assume that q is a 128-bit integer.…”

Section: Performance Evaluationmentioning

confidence: 99%

“…Suppose that the maximum session number m = 70. We compare the required storage in term of different s and t. With the average number of user's lifetime (s) increasing, the size of required memory in scheme of [34], LiSH, and LiSH+ rise, while scheme3 of [37] needs the same size of memory because its storage overhead only relates to the number of sessions m in the group lifetime. It is easy to see that our LiSH+ scheme needs less storage overhead than the previous schemes need for the same value of m and t. In addition, when s climes to 70, the size of required storage in our LiSH+ scheme is approximately 400 bits (t = 10), while that of other schemes is around 700 bits.…”

Section: Storage Overheadmentioning

confidence: 99%

See 4 more Smart Citations

Efficient self‐healing group key management with dynamic revocation and collusion resistance for SCADA in smart grid

Jiang

Luo

et al. 2014

Security Comm Networks

View full text Add to dashboard Cite

In this paper, in order to simultaneously resolve the transmission security and availability in Supervisory Control And Data Acquisition (SCADA) group communications, we propose a robust and efficient group key management scheme, called LiSH+, which is characterized by developing a secure self-healing mechanism with t-revocation and collusion resistance capability. A dual direction hash chain is utilized to guarantee the backward secrecy and forward secrecy of group key. A novel self-healing mechanism is constructed to ensure availability of the group member in case of devices failure and prevent the collusive users from exploiting the group key in the proposed scheme. In addition, the compromised users can be revoked from the group dynamically by broadcasting message. Detailed security analysis shows that the proposed LiSH+ scheme meets the requirements of group communication and is secure in terms of t user collusion-free. Performance evaluation also demonstrates its efficiency in terms of low storage requirement and communication overheads. Copyright its reliability. In smart grid, due to the widely used bidirectional communications, data collected from different part of power grid can be shared promptly among various departments. Many new applications, such as real-time electricity price, can be implemented to facilitate the control of power delivery and distribution. Thus, smart grid has attracted great attention not only from government but also from the industry and academia for its high fidelity powerflow control, self-healing, energy reliability, and energy security [5,6].According to the conceptual model of National Institute for Standards and Technology (NIST), four main components, that is, generation, transmission, distribution, and customer, feature two-way power and information flows in smart grid. Supervisory Control And Data Acquisition (SCADA) systems are used to monitor and control sensitive processes and physical functions in the electricity distribution, transmission, and generation environments, as shown in Figure 1. In order to monitor and control

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Performance Evaluationmentioning

confidence: 99%

“…(t + (1 + m)/2) log q is the average communication cost because the communication cost of scheme of [34] is (t + j) log q for section j. [34] scheme3 of [37] (a) (b) Figure 6.…”

Section: Performance Evaluationmentioning

confidence: 99%

Section: Performance Evaluationmentioning

confidence: 99%

Section: Storage Overheadmentioning

confidence: 99%

See 3 more Smart Citations

Efficient self‐healing group key management with dynamic revocation and collusion resistance for SCADA in smart grid

Jiang

Luo

et al. 2014

Security Comm Networks

View full text Add to dashboard Cite

show abstract

Access‐polynomial‐based self‐healing group key distribution scheme for resource‐constrained wireless networks

Wang¹,

Chen

Xie

et al. 2012

Security Comm Networks

View full text Add to dashboard Cite

The self-healing group key distribution scheme with revocation can deal with the problem of distributing session keys for secure group communication over an unreliable wireless network, with the capability to resist packet loss and collusion attack. However, existing access-polynomial-based self-healing key management schemes have some problems, such as the small number of active group members, much redundancy in the key updating broadcast packet, and limited collusion attack resistance capability. In order to increase the number of active group members and improve the performance of selfhealing group key distribution schemes, we propose a self-healing group key distribution scheme based on the access polynomial and one-way hash key chain for resource-constrained wireless networks in this paper. In our proposed scheme, by binding the time at which the user joins the group with the capability of recovering previous group session keys, some novel methods to construct the personal secret, the access polynomial, and the session key updating broadcast packet are presented. Compared with existing schemes under same conditions, analysis and simulation results show that our proposed scheme not only supports much more group members and sessions, but also provides a stronger security, considering that it can deal with more colluding users. Moreover, our proposed scheme is especially suitable to resource-constrained wireless networks in a very bad environment.

show abstract

A Self-healing Key Distribution Scheme for Mobile Ad Hoc Networks

Xiang

Lei

et al. 2018

Information and Communications Security

View full text Add to dashboard Cite

Anti-collusive Self-healing Key Distribution Scheme with Revocation Capability

Cited by 16 publications

References 4 publications

Efficient self‐healing group key management with dynamic revocation and collusion resistance for SCADA in smart grid

Efficient self‐healing group key management with dynamic revocation and collusion resistance for SCADA in smart grid

Access‐polynomial‐based self‐healing group key distribution scheme for resource‐constrained wireless networks

A Self-healing Key Distribution Scheme for Mobile Ad Hoc Networks

Contact Info

Product

Resources

About