Abstract
This paper proposes a novel scheme of group key management based on Jacobian Elliptic Chebyshev Rational Map, named Jacobian Group Key Management(JGKM). The scheme is more efficient than other group key managements since fewer re-keying messages are sent when group membership changes. Besides, it provides both forward and backward secrecy. Therefore, this proposal is helpful to deploy secure multicast over some networks with high latency or limited bandwidth such as wireless network. Furthermore, it fits both small-scale and large-scale groups.
Supported by NSF 60473090.
Chapter PDF
References
Ballardie, A.: Scalable multicast key distribution. RFC1949 (1996)
Hardjono, T.: Verisign. The Multicast Group Security Architecture. RFC3740 (2004)
Wallner, D., Harder, E., Agee, R.: Key Management for Multicast: Issues and Architectures RFC2627 (June 1999)
Du, F., Ni, L.M., Esfahanian, A.-H.: Toward Solving Multicast Key Management Problem. Computer Communications and Networks, 232–236 (1999)
Rafaeli, S., Hutchison, D.: A Survey of Key Management for Secure Group Communication. ACM Computing Surveys 35(3), 309–329 (2003)
Duma, C., Shahmehri, N., Lambrix, P.: A Hybrid Key Tree scheme for Multicast to Balance Security and Efficiency Requirements. In: Proceedings of the Twelfth IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, pp. 378–383 (2003)
Pegueroles, J., Rico-Novella, F.: Reducing Latency in Multicast Group Re-keying using Eulers Theorem. IEEE Communication letters 6(4), 128–133 (2003)
Canneti, R.: Efficient Communication-Storage Tradeoffs For multicast Encryption. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 456–477. Springer, Heidelberg (1999)
Li, M., Poovendran, R., Berenstein, C.: Design of Secure Multicast Key Management Schemes With Communication Budget Constraint. IEEE Communications Letters 6(3) (March 2002)
Kocarev, L., Tasev, Z.: Public-Key Encryption Based On Chebyshev Mnnaps. Circuits and Systems (ISCAS 2003) 3, 28–31 (2003)
Hong, Z., Jun, Y., Xie-Ting, L.: Design of chaotic feed forward stream cipher. Acta Electronica Sinica 26(1), 122–126 (1998)
Alvarez, G.: Security problems with a chaos-based deniable authentication scheme. arXiv:nlin. CD/0412023, 9 (December 2004)
Bergamo, P., D’Arco, P., Santis, A., Kocarev, L.: Security of Public Key Cryptosystems based on Chebyshev Polynomials. arXiv:cs.CR/0411030, vol. 10 (November 2004)
Steiner, M., Tsudik, G., Waidner, M.: Diffie-Hellman Key Distribution Extended To Group Communication. In: Proceedings of the 3rd ACM conference on Computer and communications security, New Delhi, India, pp. 31–37. ACM Press, New York (1996)
Amir, Y., Kim, Y., Nita-Rotaru, C., Tsudik, G.: On The Performance of Group Key Agreement Protocols. ACM Transactions on Information and System Security 7(3), 457–488 (2004)
Aiello, W., Bellovin, S.M., Mattblaze: Just Fast Keying: Key Agreement in a Hostile Internet. ACM Transactions on Information and System Security 7(2), 242–273 (2004)
Yang, T.: A survey of chaotic secure communication systems. International Journal of Computational Cognition 2(2), 81–130 (2004)
McGrew, D.A., Sherman, A.T.: Key Establishment in Large Dynamic Groups Using One-Way Function Trees, 29(5), 444–458. IEEE Computer Society, Los Alamitos (2003)
Ku, W.-C., Chen, S.-M.: An Improved Key Management Scheme for Large Dynamic Groups Using One-Way Function Trees. In: Proceedings of the 2003 International Conference on Parallel Processing Workshops, pp. 245–251 (2003)
Kim, Y., Perrig, A., Tsudik, G.: Simple and Fault-Tolerant Key Agreement for Dynamic Collaborative Groups. In: ACM CCS 2000. Proceedings of the 7th ACM Conference on Computer and Communications Security, pp. 235–244 (November 2000)
Abramowitz, M., Stegun, I.A.: Handbook of Mathematical Functions. Dover Publications (1970)
Wachspress, E.L.: Evaluating Elliptic Functions and Their Inverses. Computers and Mathematics with Applications (39), 230–236 (2000)
Carlson, B.C.: Jacobian elliptic functions as inverses of an integral. Journal of Computational and Applied Mathematics 174, 355–359 (2005)
Kato, A., Kohda, T.: Solvable 2-dimensional Rational Chaotic Map Defined by Jacobian Elliptic Functions. Circuits and Systems, 1477–1480 (2005)
Kohda, T., Fujisaki, H.: Jacobian elliptic Chebyshev rational maps. Physica D 148, 242–254 (2001)
Gotz, M., Kelber, K., Schwarz, W.: Discrete-Time Chaotic Encryption Systems Part I: Statistical Design Approach. IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications 44(10), 963–970 (1997)
Nam, J., Lee, J., Kim, S., Won, D.: DDH-based group key agreement in a mobile environment. The Journal of Systems and Software, 73–83 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 IFIP International Federation for Information Processing
About this paper
Cite this paper
Ke, Q., Mingtian, Z., Naiqi, L., Yujie, H., Jiandong, G. (2007). A Novel Group Key Management Based on Jacobian Elliptic Chebyshev Rational Map. In: Li, K., Jesshope, C., Jin, H., Gaudiot, JL. (eds) Network and Parallel Computing. NPC 2007. Lecture Notes in Computer Science, vol 4672. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74784-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-74784-0_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74783-3
Online ISBN: 978-3-540-74784-0
eBook Packages: Computer ScienceComputer Science (R0)