Secure Group Communication with Low Communication Complexity
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kim, Heeyoul | - |
| dc.contributor.author | Lee, Jaewon | - |
| dc.contributor.author | Yoon, hyunsoo | - |
| dc.date.accessioned | 2008-03-11T03:33:51Z | - |
| dc.date.available | 2008-03-11T03:33:51Z | - |
| dc.date.issued | 2004-12 | - |
| dc.identifier.citation | Lecture Notes in Computer Science, Volume 3320/2005, 586-590 | en |
| dc.identifier.issn | 0302-9743 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/3378 | - |
| dc.description.abstract | 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. | en |
| dc.language.iso | en_US | en |
| dc.publisher | Springer Verlag (Germany) | en |
| dc.subject | netwroking and communications | en |
| dc.subject | security | en |
| dc.subject | Secure group communication | en |
| dc.title | Secure Group Communication with Low Communication Complexity | en |
| dc.type | Article | en |
| dc.identifier.doi | 10.1007/b103538 | - |
- Appears in Collection
- CS-Conference Papers(학술회의논문)
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.