Skip to main content
Springer Nature Link
Log in

Hierarchical approaches for multicast based on Euclid’s algorithm

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

We introduce a hierarchical approach for secure multicast where rekeying of groups of users is made through a method based on Euclid’s algorithm for computing GCD. We consider tree arrangements of users that decrease requirements on bandwidth as protocols of the same nature, but also show that computational requirements are less than in other similar approaches. We also introduce a distributed protocol by groups with group managers that not only helps to decrease size of rekeying messages with respect to a centralized approach, but also to increase the security level concerning authentication of users and distributed information.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

References

  1. Antequera N, Lopez-Ramos JA (2011) Remarks and countermeasures on a cryptanalysis of a secure multicast protocol. In: Proceedings of 7th international conference on next generation web services practices, Salamanca 2011, Salamanca (Spain), pp 201–205

    Google Scholar 

  2. Antequera N, Garcia-Rubio R, Lopez-Ramos JA (2013) Secure auditing and e-commerce. Int J Comput Inf Syst Ind Manag Appl 5:581–588. ISSN 2150-7988

    Google Scholar 

  3. Bierstaker JL, Burnaby P, Thibodeau J (2001) The impact of information technology on the audit process: an assessment of the state of the art and implications for the future. Manag Audit J 16(3):159–164

    Article  Google Scholar 

  4. Chan K-C, Chan S-HG (2003) Key management approaches to offer data confidentiality for secure multicast. IEEE Netw 17(5):30–39

    Article  Google Scholar 

  5. Chiou G, Chen W (1989) Secure broadcasting using the secure lock. IEEE Trans Softw Eng 15(8):929–934

    Article  Google Scholar 

  6. Dalci I, Tanis VN (2002) Benefits of computerized accounting information systems on the JIT production systems. Rev Soc Econ Bus Stud 2:45–64

    Google Scholar 

  7. Di Pietro R, Mancini LV, Jajodia S (2002) Efficient and secure keys management for wireless mobile communications. In: Proceedings of POMC 2002, pp 66–73

    Google Scholar 

  8. Glover S, Romney M (1998) The next generation software. Intern Aud 55(4):47–53

    Google Scholar 

  9. Janakova M (2011) Database technology analysis for the support or instant information retrieval. Int J Comput Inf Syst Ind Manag Appl 3:586–593

    Google Scholar 

  10. Kale LV, Zheng G (2009) Charm++ and AMPI: adaptive runtime strategies via migratable objects. In: Advanced computational infrastructures for parallel and distributed applications. Wiley-Interscience, New York

    Google Scholar 

  11. Kruus PS, Macker JP (1998) Techniques and issues in multicast security. In: Proceedings of military communications conference, MILCOM, pp 1028–1032

    Google Scholar 

  12. Liu B, Zhang W, Jiang T (2004) A scalable key distribution scheme for conditional access system in digital pay-TV system. IEEE Trans Consum Electron 50(2):632–637

    Article  Google Scholar 

  13. Maulik R, Chaki N (2011) A study on wormhole attacks in MANET. Int J Comput Inf Syst Ind Manag Appl 3:271–279

    Google Scholar 

  14. Mittra S (1997) Iolus: a framework for scalable secure multicasting. In: Proceedings of the ACM SIGCOMM, New York, Sept. ACM, New York, pp 277–288. 27(4)

    Chapter  Google Scholar 

  15. Naranjo JAM, Antequera N, Casado LG, Lopez-Ramos JA (2012) A suite of algorithms for key distribution and authentication in centralized secure multicast environments. J Comput Appl Math. doi:10.1016/j.cam.2011.02.015

    MathSciNet  Google Scholar 

  16. Peinado A, Ortiz A (2011) Cryptanalysis of multicast protocols with key refreshment based on the extended Euclidean algorithm. In: Proceedings of CISIS 2011. Lecture notes in computer sciences, vol 6694, pp 177–182

    Google Scholar 

  17. Rafaeli S, Hutchison D (2003) A survey of key management for secure group communication. ACM Comput Surv 35(3):309–329

    Article  Google Scholar 

  18. Scheikl O, Lane J, Boyer R, Eltoweissy M (2002) Multi-level secure multicast: the rethinking of secure locks. In: International conference on parallel processing workshops, 2002, proceedings, pp 17–24

    Google Scholar 

  19. Sherman AT, McGrew DA (2003) Key establishment in large dynamic groups using one-way function trees. IEEE Trans Softw Eng 29:444–458

    Article  Google Scholar 

  20. Ukil A (2011) Context protecting privacy preservation in ubiquitous computing. Int J Comput Inf Syst Ind Manag Appl 3:228–235

    Google Scholar 

  21. Waldvogel M, Caronni G, Sun D, Weiler N, Plattner B (1999) The VersaKey framework: versatile group key management. IEEE J Sel Areas Commun 17(9):1614–1631

    Article  Google Scholar 

  22. Wallner D, Harder E, Agee R (1999) Key management for multicast: issues and architectures. RFC 2627

  23. Zhu S, Jajodia S (2010) Scalable group key management for secure multicast: a taxonomy and new directions. In: Huang H, MacCallum D, Du D-Z (eds) Network security. Springer, New York, pp 57–75

    Chapter  Google Scholar 

Download references

Acknowledgements

This work has been supported by the Spanish Ministry of Science and Innovation (TEC2009-13763-C02-02, TIN2008-01117) and Junta de Andalucía (FQM 0211, P08-TIC-3518 and P11-TIC7176).

Author information

Authors and Affiliations

  1. Department of Informatics, University of Almería, 04120, Almería, Spain

    J. A. Álvarez-Bermejo

  2. Department of Mathematics, University of Almería, 04120, Almería, Spain

    N. Antequera & J. A. López-Ramos

Authors
  1. J. A. Álvarez-Bermejo
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. N. Antequera
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. J. A. López-Ramos
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to J. A. Álvarez-Bermejo.

About this article

Cite this article

Álvarez-Bermejo, J.A., Antequera, N. & López-Ramos, J.A. Hierarchical approaches for multicast based on Euclid’s algorithm. J Supercomput 65, 1164–1178 (2013). https://doi.org/10.1007/s11227-013-0923-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-013-0923-x

Keywords