Group key management with efficient rekey mechanism: A Semi-Stateful approach for out-of-Synchronized members

Chen, Yi Ruei; Tzeng, Wen-Guey

doi:10.1016/j.comcom.2016.08.001

Cited by 28 publications

(9 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Chen Y.R. et al [19] proposed KeyDer-GKM based on a semi-stateful rekey mechanism to reduce the number of decryption operations.…”

Section: Related Workmentioning

confidence: 99%

“…Scholars have proposed many lightweight protocols to balance security and efficiency. On the one hand, some protocols simplify the process of key distribution, or use dynamic routing and maximum distance separable code to distribute key update messages [15][16][17][18][19]. On the other hand, based on threshold secret sharing scheme [20,21], lightweight encryption and decryption algorithms are implemented to replace the traditional encryption algorithms used in LKH and OFT schemes [9,[22][23][24][25][26].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Computation-Efficient Group Key Distribution Protocol Based on a New Secret Sharing Scheme

Jiao

Ouyang²,

Lin

et al. 2019

Information

View full text Add to dashboard Cite

With the development of 5G and the Internet of Things (IoT), mobile terminals are widely used in various applications under multicast scenarios. However, due to the limited computation resources of mobile terminals, reducing the computation cost of members in group key distribution processes of dynamic groups has become an important issue. In this paper, we propose a computation-efficient group key distribution (CEGKD) protocol. First, an improved secret sharing scheme is proposed to construct faster encryption and decryption algorithms. Second, the tree structure of logical key hierarchy (LKH) is employed to implement a simple and effective key-numbering method. Theoretical analysis is given to prove that the proposed protocol meets forward security and backward security. In addition, the experiment results show that the computation cost of CEGKD on the member side is reduced by more than 85% compared with that of the LKH scheme.

show abstract

“…Chen Y.R. et al [19] proposed KeyDer-GKM based on a semi-stateful rekey mechanism to reduce the number of decryption operations.…”

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Computation-Efficient Group Key Distribution Protocol Based on a New Secret Sharing Scheme

Jiao

Ouyang²,

Lin

et al. 2019

Information

View full text Add to dashboard Cite

show abstract

“…An early example is the "audio teleconference system" of Steer et al [49], and the seminal academic work is perhaps Wallner et al [52] or Wong et al [54]. Later examples include [7,9,12,17,26,27,28,29,30,33,42,43,55], among many others. These protocols assign private DH keys to leaves of a binary 1 tree, defining (i) д xy as the secret key of a node whose two children have secret keys x and y, and (ii) д д xy as its public or 'blinded' key.…”

Section: Other Group Messaging Protocolsmentioning

confidence: 99%

“…We remark on two main techniques to avoid trivial denials of service, though a perfect solution is an open research question (studied e.g. by [12]) and we consider it out of scope for our work.…”

Section: Executabilitymentioning

confidence: 99%

On Ends-to-Ends Encryption

Cohn-Gordon

Cremers

Garratt

et al. 2018

Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security

View full text Add to dashboard Cite

In the past few years secure messaging has become mainstream, with over a billion active users of end-to-end encryption protocols such as Signal. The Signal Protocol provides a strong property called post-compromise security to its users. However, it turns out that many of its implementations provide, without notification, a weaker property for group messaging: an adversary who compromises a single group member can read and inject messages indefinitely. We show for the first time that post-compromise security can be achieved in realistic, asynchronous group messaging systems. We present a design called Asynchronous Ratcheting Trees (ART), which uses tree-based Diffie-Hellman key exchange to allow a group of users to derive a shared symmetric key even if no two are ever online at the same time. ART scales to groups containing thousands of members, while still providing provable security guarantees. It has seen significant interest from industry, and forms the basis for two draft IETF RFCs and a chartered working group. Our results show that strong security guarantees for group messaging are practically achievable in a modern setting. CCS CONCEPTS • Security and privacy → Security protocols; Cryptography; Formal methods and theory of security; Formal security models; Mobile and wireless security;

show abstract

“…7,8,14,16,18,19 That is, during a certain session, even if some broadcast packets get lost, users are still capable of recovering the group key, for that session, simply by using the packets they will receive at the beginning of a subsequent one, without requesting additional transmission from the GM. 12,20 This approach decreases the work load on the GM and reduces network traffic as well as the risk of user exposure through traffic analysis. 7,8,12,17 Self-healing group key distribution protocols can broadly be classified into polynomial-based, exponential arithmetic-based, vector space secret sharing scheme-based, and bilinear pairing-based schemes.…”

Section: Introductionmentioning

confidence: 99%

A novel self‐healing key distribution scheme based on vector space access structure and MDS codes

Vadlamudi

Vadlamudi²

2019

Int J Communication

View full text Add to dashboard Cite

Self-healing group key distribution protocols are useful in applications that have a dynamic group structure. These include broadcast transmission systems and multicast networks such as pay-per-view television, embedded and sensor networks, and cellular and wireless networks. To cater to the requirements of these applications, several self-healing group key distribution protocols are proposed in the literature. Many of these schemes are vulnerable to polynomial factorization or insider replay attacks. Some other schemes impose constraints on the users joining the group or revoked from the group. Motivated by these and other shortcomings of the existing schemes, we hereby propose a novel self-healing group key distribution protocol. Some of the features of this scheme include that (a) the number and the set of revoked users is not constrained, (b) the communication group can consist of any set of users, and (c) a revoked user is allowed to rejoin the group in any of the later sessions. The scheme is analyzed for its security, and it is found to provide anywise forward and backward secrecy. It is also found to resist anywise collusion attack. Communication and computation complexity of the scheme is analyzed; while doing so, various possible realizations of the scheme is discussed. In addition to the theoretical analysis, the proposed scheme is experimentally verified for its correctness using OMNET++ network simulator. KEYWORDSgroup key distribution, MDS codes, self-healing, vector space access structure Int J Commun Syst. 2019;32:e4088.wileyonlinelibrary.com/journal/dac Wireless networks, especially mobile wireless ad hoc networks, are likely to be unreliable and highly dynamic in the sense that the nodes may move in and out of range frequently and sometimes be completely separate from the network. Also, an adversary may intentionally disrupt the wireless communication using various methods. 5 A good group key mechanism should be resilient to this dynamic nature of the network as well as to the said attacks of the adversary. So, a specialized group key distribution protocols, known as self-healing group key distribution protocols, have been proposed in the literature. 7-15 These are useful in several settings such as group keys needed to be used for a short period because of frequent changes in the group structure. 12,14,16 In these protocols, group lifetime is divided into epochs called sessions, 7,8,12,17 where each session has a unique group key. At the beginning of each session, the GM transmits a broadcast message in order to provide a common key, called the session key, to each member of the group. 12,16 Every user belonging to the group computes the group key using the message and some private information.Using self-healing key distribution schemes, users, in a large and dynamic group communication over an unreliable network, can recover lost session keys on their own, even if some previous key distribution messages are lost, without requesting additional transmissions from the GM. 7,8,14,16,18,19 That is,...

show abstract

Group key management with efficient rekey mechanism: A Semi-Stateful approach for out-of-Synchronized members

Cited by 28 publications

References 31 publications

A Computation-Efficient Group Key Distribution Protocol Based on a New Secret Sharing Scheme

A Computation-Efficient Group Key Distribution Protocol Based on a New Secret Sharing Scheme

On Ends-to-Ends Encryption

A novel self‐healing key distribution scheme based on vector space access structure and MDS codes

Contact Info

Product

Resources

About