Group Rekeying Algorithm Using Pseudo-random Functions and Modular Reduction

The grid is one of the most evident examples of cooperation between a group of network entities. If secure transactions want to be supported within this group a secret key shared by all these entities is needed. The session key should be sent to all authorized users and updated every time the grid group changes. This is the only way of achieving perfect forward and backward secrecy. Traditionally these actions are performed by a centralized trusted third party called the Key Server (KS). Different works for minimizing the storage need for KS and reducing the required bandwidth for updating keys have been presented. We present a method for group rekeying using pseudo-random functions and modular reduction. This method minimizes the number of keys to store by the KS and reduces the required bandwidth for updating the keying material.

[1]  Moni Naor,et al.  Multicast security: a taxonomy and some efficient constructions , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[2]  Celeste Campo,et al.  PTM: A Pervasive Trust Management Model for Dynamic Open Environments ⁄ , 2003 .

[3]  Ran Canetti,et al.  Efficient Communication-Storage Tradeoffs for Multicast Encryption , 1999, EUROCRYPT.

[4]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[5]  Hugh Harney,et al.  Group Key Management Protocol (GKMP) Architecture , 1997, RFC.

[6]  J. Hernandez-Serrano,et al.  GKM over large MANET , 2005, Sixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Network.

[7]  Eric Harder,et al.  Logical Key Hierarchy Protocol , 1999 .

[8]  Jacques Stern,et al.  Advances in Cryptology — EUROCRYPT ’99 , 1999, Lecture Notes in Computer Science.

[9]  Alan T. Sherman,et al.  Key Management for Large Dynamic Groups: One-Way Function Trees and Amortized Initialization , 2000 .

[10]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.