Abstract
The existing key management schemes have adopted the passive adversarial model to analyze the forward secrecy and backward secrecy security requirements. However, the more realistic model is the strong active outsider adversary model wherein a legitimate group user can be compromised by the outsider adversary. In this work, we analyze the security of the Chinese remainder theorem based key management schemes under strong active outsider adversary model. We show that the schemes are insecure and we reason for their insecurity. Also, we provide a generic approach to make the schemes based on Chinese remainder theorem as secure against strong adversary. We conclude that, to make these schemes secure against strong adversary, the cost for every rekeying event requires the cost of initial group set up. That is, for rekeying upon user join or leave, it requires n secure channels for a group of n users which is costly.
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
Similar content being viewed by others
References
Aparna, R., Amberker, B.B.: A key management scheme for secure group communication using binomial key trees. Int. J. Netw. Manag. 20(6), 383–418 (2010)
Burton, D.: Elementary number theory (2011). https://books.google.co.in/books?id=3KiUCgAAQBAJ
Chen, Y.R., Tygar, J.D., Tzeng, W.G.: Secure group key management using uni-directional proxy re-encryption schemes. In: INFOCOM, pp. 1952–1960. IEEE (2011)
Chiou, G.H., Chen, W.T.: Secure broadcasting using the secure lock. IEEE Trans. Software Eng. 15(8), 929–934 (1989)
Guo, C., Chang, C.C.: An authenticated group key distribution protocol based on the generalized chinese remainder theorem. Int. J. Commun. Syst. 27(1), 126–134 (2014)
Jho, N.-S., Hwang, J.Y., Cheon, J.H., Kim, M.-H., Lee, D.H., Yoo, E.S.: One-way chain based broadcast encryption schemes. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 559–574. Springer, Heidelberg (2005). https://doi.org/10.1007/11426639_33
Joshi, M.Y., Bichkar, R.S.: Scalable key transport protocol using chinese remainder theorem. In: Thampi, S.M., Atrey, P.K., Fan, C.-I., Perez, G.M. (eds.) SSCC 2013. CCIS, vol. 377, pp. 397–402. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40576-1_39
Naor, D., Naor, M., Lotspiech, J.: Revocation and tracing schemes for stateless receivers. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 41–62. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-44647-8_3
Rafaeli, S., Hutchison, D.: A survey of key management for secure group communication. ACM Comput. Surv. 35(3), 309–329 (2003)
Sherman, A.T., McGrew, D.A.: Key establishment in large dynamic groups using one-way function trees. IEEE Trans. Software Eng. 29(5), 444–458 (2003)
Vijayakumar, P., Bose, S., Kannan, A.: Chinese remainder theorem based centralised group key management for secure multicast communication. IET Inf. Secur. 8(3), 179–187 (2014)
Wong, C.K., Gouda, M., Lam, S.S.: Secure group communications using key graphs. IEEE/ACM Trans. Networking 8(1), 16–30 (2000)
Xu, S.: On the security of group communication schemes based on symmetric key cryptosystems. In: Proceedings of the 3rd ACM Workshop on Security of Ad Hoc and Sensor Networks, New York, USA, pp. 22–31 (2005)
Xu, S.: On the security of group communication schemes. J. Comput. Secur. 15(1), 129–169 (2007)
Zheng, X., Huang, C.T., Matthews, M.: Chinese remainder theorem based group key management. In: Proceedings of the 45th Annual Southeast Regional Conference, ACM-SE 45, pp. 266–271. ACM, New York (2007)
Zhou, J., Ou, Y.: Key tree and Chinese remainder theorem based group key distribution scheme. In: Hua, A., Chang, S.-L. (eds.) ICA3PP 2009. LNCS, vol. 5574, pp. 254–265. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-03095-6_26
Zhou, J., Ou, Y.: Key tree and chinese remainder theorem based group key distrubution scheme. J. Chin. Inst. Eng. 32(7), 967–974 (2009)
Zou, X., Dai, Y.S., Bertino, E.: A practical and flexible key management mechanism for trusted collaborative computing. In: INFOCOM, pp. 538–546. IEEE (2008)
Acknowledgement
This work is supported by the Science and Engineering Research Board (SERB), Department of Science & Technology (DST), Government of India.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Purushothama, B.R., Verma, A.P., Kumar, A. (2017). Security Analysis of Key Management Schemes Based on Chinese Remainder Theorem Under Strong Active Outsider Adversary Model. In: Thampi, S., MartÃnez Pérez, G., Westphall, C., Hu, J., Fan, C., Gómez Mármol, F. (eds) Security in Computing and Communications. SSCC 2017. Communications in Computer and Information Science, vol 746. Springer, Singapore. https://doi.org/10.1007/978-981-10-6898-0_18
Download citation
DOI: https://doi.org/10.1007/978-981-10-6898-0_18
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-6897-3
Online ISBN: 978-981-10-6898-0
eBook Packages: Computer ScienceComputer Science (R0)