Secure Group Communication with Multiplicative One-way Functions

  • Authors:
  • Heeyoul Kim;Seong-min Hong;H. Yoon;J. W. Cho

  • Affiliations:
  • Korea Advanced Institute of Science and Technology;Korea Advanced Institute of Science and Technology;Korea Advanced Institute of Science and Technology;Korea Advanced Institute of Science and Technology

  • Venue:
  • ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Secure group communication enables only the users in that group securely communicate with each other. Because the users can join or leave the group dynamically, scalability is a major concern. In this paper we propose a communication-efficient model using multiplicative oneway functions. It also has well known tree-based structure but uses exclusive keys that are held by the users not in some subtree. When totally n users are in the group, proposed model reduces the size of multicast message required in join or leave operation from O(log n) to O(1) keeping other costs comparable. The security of proposed model is based on the difficulty of finding square root modulo composite number and it also satisfies both forward and backward secrecy. Therefore, proposed model is very applicable to a wide area network environment or a low-bandwidth channel such as ad hoc network.