Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Foster, I.: The Grid. Blueprint for a new computing infrastructure. Morgan Kaufmann Publishers, Inc., San Francisco (1999)
Canetti, Garay, Itkis, Micciancio, Naor, Pinkas.: Multicast Security: A Taxonomy and Efficient Constructions. In: INFOCOMM 1999 (1999)
Harney, Muckenhirn.: Group Key Management Protocol Architecture. IETF RFC2094 (1997)
Harney, Harder.: Logical Key Hierarchy Protocol (LKH). IETF I-D. Harney-spartalkhp- sec-00 (1999)
Balenson, McGrew, Sherman.: Key Management for Large Dynamic Groups: One-Way Function Trees and Amortized Initialization. IETF I-D. Irtf-smuggroupkeymgmt-oft-00 (2000)
Canetti, R., Malkin, T., Nissim, K.: Efficient Communication Storage Tradeoffs for Multicast Encryption. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, p. 459. Springer, Heidelberg (1999)
Menezes, Oorschot, Vanstone: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996) ISBN 0-8493-8523-7
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pegueroles, J., Bin, W., Soriano, M., Rico-Novella, F. (2004). Group Rekeying Algorithm Using Pseudo-random Functions and Modular Reduction. In: Li, M., Sun, XH., Deng, Qn., Ni, J. (eds) Grid and Cooperative Computing. GCC 2003. Lecture Notes in Computer Science, vol 3032. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24679-4_148
Download citation
DOI: https://doi.org/10.1007/978-3-540-24679-4_148
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21988-0
Online ISBN: 978-3-540-24679-4
eBook Packages: Springer Book Archive