2005International Journal of High Performance Computing and NetworkingRequires access

A scalable group-rekeying scheme using secret mask patterns

Y.M. Asem, Atsushi Kara

Open publisher page 0 citations

Abstract

In this paper, we propose a new group-rekeying method for changing the multicast group key matrix-mask-based group-rekeying (MMGR). The main aim of our rekeying method is to solve the rekeying problem that arises when some group members leave the group. In MMGR, the group controller constructs the rekeying message using a numerical matrix, and the group members apply secret bit masks on the matrix to get the group key. MMGR does not need computationally expensive encryption of the group key before transmission and hence eliminates the need to decrypt it after receiving the rekeying message. In MMGR, rekeying message construction and group key retrieval processes need only simple operations. The computational cost of the rekeying server is low, and the computational cost of the group members is low and constant regardless of the rekeying message size.

About this research paper

What this paper is about

In this paper, we propose a new group-rekeying method for changing the multicast group key matrix-mask-based group-rekeying (MMGR). The main aim of our rekeying method is to solve the rekeying problem that arises when some group members leave the group. In MMGR, the group controller constructs the rekeying message using a numerical matrix, and the group members apply secret bit masks on the matrix to get the group key. MMGR does not need computationally expensive encryption of the group key before transmission and hence eliminates the need to decrypt it after receiving the rekeying message. In MMGR, rekeying message construction and group key retrieval processes need only simple operations. The computational cost of the rekeying server is low, and the computational cost of the group members is low and constant regardless of the rekeying message size.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, we propose a new group-rekeying method for changing the multicast group key matrix-mask-based group-rekeying (MMGR). The main aim of our rekeying method is to solve the rekeying problem that arises when some group members leave the group. In MMGR, the group controller constructs the rekeying message using a numerical matrix, and the group members apply secret bit masks on the matrix to get the group key. MMGR does not need computationally expensive encryption of the group key before transmission and hence eliminates the need to decrypt it after receiving the rekeying message. In MMGR, rekeying message construction and group key retrieval processes need only simple operations. The computational cost of the rekeying server is low, and the computational cost of the group members is low and constant regardless of the rekeying message size.

Key concepts: Rekeying, Computer science, Group key, Multicast, Encryption, Key (lock), Computer network, Secure multicast

Related papers

Back to paper searchBrowse research topicsOriginal source
A scalable group-rekeying scheme using secret mask patterns — Research Paper | ScholarLens