Secure Group Communication with Low Communication Complexity

In this paper we propose a secure group communication model with low communication complexity using multiplicative one-way functions and exclusive keys. When totally n users are in the group, it reduces the complexity of multicast message required in join or leave operation from O(log n) to O(1) keeping other complexities comparable. Therefore, it is very applicable to a wide area network environment or a low-bandwidth channel such as ad hoc network.
Publisher
Springer Verlag (Germany)
Issue Date
2004-12
Keywords

netwroking and communications; security; Secure group communication

Citation

Lecture Notes in Computer Science, Volume 3320/2005, 586-590

ISSN
0302-9743
DOI
10.1007/b103538
URI
http://hdl.handle.net/10203/3378
Appears in Collection
CS-Conference Papers(학술회의논문)
  • Hit : 337
  • Download : 2
  • Cited 0 times in thomson ci

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0