Earticle

초록

영어

Key management in multicast dynamic groups, where users can leave or join at their ease is one of the most crucial and essential part of secure communication. Because communication bandwidth, storage memory, and computational power are limited resources, group key management schemes for scalable secure multicast communications have to consider these factors however, most of proposed key management schemes focus on guarantying secure distribution of keys. Even though security assurance is critical, reducing the number of update messages, number of stored keys and computational load also needs equivalent attention. Scalability, security, computation, and communication complexities are some of the tradeoffs. Here, we propose an efficient secure scheme in such a way that solves these problems and that can be implemented easily. In our scheme, we applied very simple mathematical concept with modulo and XOR operations in order to make the system simple for implementation and management. As a novel feature, the scheme is scalable with key update message of order O(1) - logM N, storage overhead of order O(1) and computational load of order O(log(N/M))- O(1).

목차

Abstract
 I. INTRODUCTION
 PROPOSED SYSTEM
 SECURITY ANALYSIS
 CONCLUSION
 REFERENCES

키워드

저자

• Fikadu B. Degefa [ College of Information and Communication Engineering, Sungkyunkwan University Suwon, South Korea ]
• Dongho Won [ College of Information and Communication Engineering, Sungkyunkwan University Suwon, South Korea ] Corresponding Author

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  JoC [Journal of Convergence]

• 간기

  계간

• pISSN

  2093-7741

• eISSN

  2093-775X

• 수록기간

  2010~2015

• 십진분류

  KDC 004 DDC 004