Key management for secure lnternet multicast using Boolean function minimization techniques

Abstract

The Internet today provides no support for privacy or authentication of multicast packet. However, an increasing number of applications will require secure multicast senices in order to restrict group membership and enforce accountability of group members. A major problem associated with the deployment of secure multicast delivery services is the scalability of the key distribution protocoL This is particularly true with regard to the handling of group membership changes, such as member departures and/or expulsions, which necessitate the distribution of a new session key to all the remaining group members.As the frequency of group membership changes increases, it becomes necessary to reduce the cost of key distribution operations. This paper explores the use of batching of group membership changes to reduce the frequency, and hence the cost, of key redistribution operations. It focuses explicitly on the problem of cumulnrive member removal and present an algorithm that minimizes the number of messages required to distribute new keys to the remaining group members. The algorithmis used in conjunction with a new multicast key management scheme which uses a set of auxiliary keys in order to improve scalability. In contrast to previous schemes which generate a fixed hierarchy of keys, the proposed scheme dynamically generates the most suitable key hierarchy by composing different keys. Our cumulative member removal algorithm uses Boolean function minimization techniques, and outperforms all other schemes known to us in terms of message complexity.

Group Re-keying Protocol Based on Modular Polynomial Arithmetic Over Galois Field GF(2n)

“…[4][5][6]. Note that we use ⊕ and ⊗ to denote modular polynomial addition and multiplication over Galois Field GF(2 n ), respectively: P(X) = P(U n7 ) ⊗ P(U n8 ) ⊗ P(k c ') ⊕ P(S n3 ') P(Y) = P(S n1 ) ⊗ P(S n2 ) ⊗ P(S n3 ') ⊗ P(kc') ⊕ P(R n ') (4) P(S n3 ') = P(X) mod P(U n7 ) P(S n3 ') = P(X) mod P(U n8 )…”

“…Among them are group key approach [1][2][3] , contributory key agreement supported by Diffie Hellman algorithm [4] , and logical key tree based approach [5,6] . Among the group re-keying methods mentioned above, SKM [1] is one method that does not depend on encryption/decryption for its group re-keying process.…”

“…2 and 3). With the auxiliary key k 78 users u 7 and u 8 can recover the new session key, k [1][2][3][4][5][6][7][8] , by executing Eq. 3.…”

DYCRASEN: A Dynamic Cryptographic Asymmetric Key Management for Sensor Network using Hash Function

“…Extending this to M-ary reduces the height of the tree by reducing the number of keys at each node. In [9], two keys are maintained at every level of tree, extending the scheme to M-ary m keys will be maintained.…”

Secure Group Communication with Low Communication Overhead using Effective Multicasting

“…To reduce the cost of key redistribution batch rekeying mechanism is used. This paper focuses on "cumulative member removal" [3] algorithm which uses Boolean minimization techniques to minimize the number of messages required to distribute new keys to the existing group members in a secure manner.…”