MILITARY MULTICAST KEY MANAGEMENT

Reporters: Al Ann Ibanez Jeonghwa Yoo Roh Nazcar Pine

ABSTRACT
Todays world is what we call the: Network Centric World this is very important in military operations Same group members use the same key, but the key must be dynamic KAA like the key exchange algorithm in IPSEC(Oakley). But Oakley is the protocol for P2P. KAA are used for group.

Provide security services Different from commercial use Frequent use of group communication The current circuit has difficulty with providing group communications VoIP Networks has very useful services for multicasting Multicast = Communication in group communication in Military Network is converted Problem with VoIP updating the group members dynamically.

INTRODUCTION
Multicast is a very efficient and scalable technique for group communication IPSec Architecture

Multicast Group Mapping Source Authentication Group Access Confidentiality

Group Key Administration(MIKE)

A symmetric cryptographic algorithm

Single Membership changes when a user wants to leave the group

Operation is called when user is forced to leave

Additive subgroup operation Group merge Subtractive subgroup operation Group Partition Group communication security Key Updating/Rekeying

Mode key agreement/Key distribution

Two modes in Military are needed

PROPOSED SCHEME

PROPOSED SCHEME
The key agreement part forces every member to calculate the tree by means of an iterative Diffie Hellman group key exchange. The key distribution mode a group controller constructs the key tree and spreads the group key in a secure way.

KEY TREE
Reduces the expense of group key update A Key tree is a tree with

USER LEAVES KEY NODES NULL NODES USER LEAF

KEY TREE

K1-8

Root node

KEY_NODES

k123

k456

k78

k1

k2

k3

k4

k5

k6

k7

k8

NULL_N ODE

USER_LEAVES

U1 U 2 U 3
KEY_LEAF

U4 U5 U6

U7 U8

N
NO USER

KEY TREE

From the software design point of view both modes can base on the c++ class KeyTree{} The derivate classes AgreeKeyTree{} and DistKeyTree{} implement the special mode functionality needed for key update. In order to provide an easy accessible interface to the cryptographic library the classes are derived a second time.

KEY DISTRIBUTION (1)

GC (Group Controller) - Administration of the key tree - management of users - spreading of the group key - know the structure of the key tree and all keys. User - No knowledge about the key tree - know the keys of the path to the root node

Auxiliary key - A key encypting the exchanged data - only known by the subset of the group

KEY DISTRIBUTION (2)

For example

{k18 }k13
- transmit K1-8 from the GC to the user u1-u3

{}k j
- the content of the bracket is encrypted with the kj

TREE BASED KEY DISTRIBUTION

TREE BASED KEY AGREEMENT

Within groups working with the key agreement algorithm a transaction manager (TM) exists for the observation of the next key operation. Every user can hold the TM status Only the TM can refresh the key tree and change the group key The key tree can be calculated by each user by an iterative Diffie Hellman key agreement:

Where kji = kij is the agreed Diffie Hellman value and p a prime number

TREE BASED KEY AGREEMENT

In order to explain the algorithm, the join procedure of user u8 is explained.

TREE BASED KEY AGREEMENT

A three way handshake is used to transmit the new user individual blind key BK(u8) to the current TM and authenticate the user. A new node is added to the key tree storing the users individual blind key. The tree path from the user to the root become invalid. By a p3TMDistribute message the group users and the new user are informed about the TM status of the new user u8.

TREE BASED KEY AGREEMENT

The p3TMDistribute message contains all blind keys of the tree without the invalid key path. u8 confirms the reception of the new roll and calculates the tree path by using a Diffie Hellman algorithm several times. Afterwards u8 distributes the blind key BK(k78), BK(k5-8) of the key path by a p3UpdateDistribute message. Every user can now calculate the group key - u1 calculates kG = k14 oBK(k58 ), - u5 calculates k5-8 = k56 o BK(k78 ) , kG = k58 o BK(k14 )

CONCLUSION
The usage of key trees simplifies the implementation of both modes. Utilizing information of military groups increases the efficiency of the key update procedure. The increased efficiency is obtained by means of batched rekeying and probabilistic key tree construction. The usage of key trees produces an optimization for both modes of operation