Abstract
Secure group communication enables only authorized group members to communicate securely with each other by means of group key. Because group membership can be changed frequently due to joining or leaving of members, a scalable group key rekeying is essential to preserve security. In this paper we present a new group key scheme based on homomorphic encryption. Compared with the previous schemes, our scheme improves scalability by reducing the number of multicasted keys for rekeying.The abstract should summarize the contents of the paper.
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
Amir, Y., Kim, Y., Nita-Rotaru, C., Tsudik, G.: On the performance of group key agreement protocols. In: 22nd IEEE Conference on Distributed Computing Systems, pp. 463–464 (2002)
Kim, Y., Perrig, A., Tsudik, G.: Communication-efficient group key agreement. In: 16th International Conference on Information Security, pp. 229–244 (2001)
Wong, C.K., Gouda, M., Lam, S.S.: Secure group communications using key graphs. In: ACM SIGCOMM 1998, pp. 68–79 (1998)
Waldvogel, M., Caronni, G., Sun, D., Weiler, N., Plattner, B.: The versakey framework:Versatile group key management. IEEE J. Selected Areas in Communications 17, 1614–1631 (1999)
McGrew, D.A., Sherman, A.T.: Key establishment in large dynamic groups using oneway function trees. Technical report (1998)
Canetti, R., Garay, J., Itkis, G., Micciancio, D., Naor, M., Pinkas, B.: Multicast security:a taxonomy and some efficient constructions. In: IEEE INFOCOM, pp. 708–716 (1999)
Selcuk, A.A., Sidhu, D.P.: Probabilistic methods in multicast key management. In: 3rd International Workshop on Information Security, pp. 179–193 (2000)
Pais, A.R., Joshi, S.: A new probabilistic rekeying method for secure multicast groups. Int. J. Inf. Sec., 275–286 (2010)
Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF Formulas on Ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 325–341. Springer, Heidelberg (2005)
Rivest, R., Adleman, L., Mertouzos, M.: On data banks and privacy homomorphisms. Foundations of Secure Computation, pp. 169–180 (1978)
El Gamal, T.: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10–18. Springer, Heidelberg (1985)
Naccache, D., Stern, J.: A new public key cryptosystem based on higher residues. In: ACM CCS 1998, pp. 59–66 (1998)
Damgard, I., Jurik, M.: A Length-Flexible Threshold Cryptosystem with Applications. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol. 2727, pp. 350–356. Springer, Heidelberg (2003)
Gentry, C.: Fully homomorphic encryption using ideal lattices. In: 41st ACM STOC, pp. 169–178 (2009)
Kim, Y., Perrig, A., Tsudik, G.: Tree-based group key agreement. ACM T. Inf. Sys. Sec. 7, 60–96 (2004)
Steiner, M., Tsudik, G., Waidner, M.: Key agreement in dynamic peer groups. IEEE T. Par. Dis. Sys. 11, 769–780 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, H. (2012). A New Group Key Rekeying with Homomorphic Encryption. In: Kim, Th., Ko, Ds., Vasilakos, T., Stoica, A., Abawajy, J. (eds) Computer Applications for Communication, Networking, and Digital Contents. FGCN 2012. Communications in Computer and Information Science, vol 350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35594-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-35594-3_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35593-6
Online ISBN: 978-3-642-35594-3
eBook Packages: Computer ScienceComputer Science (R0)