Call for Paper - December 2021 Edition
IJCA solicits original research papers for the December 2021 Edition. Last date of manuscript submission is November 20, 2021. Read More

Computing Efficient Rekeying for Multicast Key Distribution with Least Computation Complexity

Print
PDF
IJCA Proceedings on National Conference on Recent Trends in Mobile and Cloud Computing
© 2015 by IJCA Journal
NCRMC 2015 - Number 1
Year of Publication: 2015
Authors:
Nilesh M. Shidurkar

Nilesh M.shidurkar. Article: Computing Efficient Rekeying for Multicast Key Distribution with Least Computation Complexity. IJCA Proceedings on National Conference on Recent Trends in Mobile and Cloud Computing NCRMC 2015(1):26-30, November 2015. Full text available. BibTeX

@article{key:article,
	author = {Nilesh M.shidurkar},
	title = {Article: Computing Efficient Rekeying for Multicast Key Distribution with Least Computation Complexity},
	journal = {IJCA Proceedings on National Conference on Recent Trends in Mobile and Cloud Computing},
	year = {2015},
	volume = {NCRMC 2015},
	number = {1},
	pages = {26-30},
	month = {November},
	note = {Full text available}
}

Abstract

An imperative issue for secure gathering openness is of the utmost importance dissemination. The majority of the incorporated gathering key administration plans utilize high rekeying expense. Here we present a novel methodology for calculation productive rekeying for multicast key conveyance. This methodology diminishes the rekeying expense by utilizing a mixture gathering key administration plan (including both concentrated and contributory key administration plans). The gathering controller uses the MDS Codes, a class of blunder control codes, to circulate the multicast key powerfully. Keeping in mind the end goal to maintain a strategic distance from successive rekeying as and when the client leaves, a novel methodology is presented where customers recompute the new gathering key with negligible calculation. This methodology guarantees forward mystery and additionally in reverse mystery and fundamentally lessens the rekeying expense and correspondence cost. This plan well suits remote applications where compact gadgets require low calculation.

References

  • X. S. Li, Y. R. Yang, M. G. Gouda, and S. S. Lam, "Batch Rekeying for Secure Group Communications," Proc. 10th Int'l World Wide Web Conf. (WWW '01), pp. 525-534, May 2001.
  • S. Mittra, "Iolus: A Framework for Scalable Secure Multicasting," Proc. ACM SIGCOMM '97, pp. 277-288, Sept. 1997.
  • C. Wong, M. Gouda, and S. Lam, "Secure Group Communication Using KeyGraphs," IEEE/ACM Trans. Networking, vol. 8, pp. 12-23, Feb. 2000.
  • Peter S. Kruus and Joseph P. Macker, "Techniques and issues in multicast security," MILCOM98, 1998.
  • Paul Judge and Mostafa Ammar, "Security Issues and Solutions in Multicast Content Distribution: A Survey", IEEE Network, February 2003, pp 30 – 36.
  • M. Moyer, J. Rao and P. Rohatgi, "A Survey of Security Issues in Multicast Communications", IEEE Network Magazine, Vol. 13, No. 6, March 1999, pp. 12-23.
  • Yan Sun, and K. J. Ray Liu, "Securing Dynamic Membership Information in Multicast Communications," IEEE INFO CONFERENCE 2004.
  • F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes. North- Holland Math. Library, 1977.
  • M. S. Hwang, "Dynamic participation in a secure conference scheme for mobile communications," IEEE Trans. Veh. Technol. , vol. 48, pp. 1469–1474, Sept. 1999.
  • Lihao Xu, Cheng Huang, "Computation Efficient Multicast Key Distribution," IEEE Trans. Parallel And Distributed Systems, Vol 19, No. 5, May 2008.
  • Ran Canatti, Juan Garay, Gene Itkis, Daniel Micciancio, Moni Naor, and Benny Pankus, "Multicast Security: A taxanomy and some efficient constructions", IEEE Network, March 1999, pp 122-128.
  • H. Harney and E. Harder, Logical Key Hierarchy Protocol, IETF Internet draft, work in progress, Mar. 1999.
  • T. M. Cover and J. A. Thomas, Elements of Information Theory. John Wiley & Sons, 1991.
  • A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone, Handbook of Applied Cryptography, fourth ed. CRC Press, 1999.