Please use this identifier to cite or link to this item:
http://hdl.handle.net/11455/70014
標題: | A tree-based scheme for security of many-to-many communications | 作者: | Lin, R.H. Jan, J.K. |
關鍵字: | key management;symmetric encryption;pseudo random function;many-to-many group communication | Project: | Journal of High Speed Networks | 期刊/報告no:: | Journal of High Speed Networks, Volume 16, Issue 1, Page(s) 69-79. | 摘要: | In many-to-many group secure communications, group members may broadcast or receive messages during any session. A fast session key distribution scheme is desirable for handling highly changeable message flows among group members. In this paper, we propose a group keying scheme using tree structures for many-to-many group secure communications. The key storage and computational complexity of the proposed scheme are acceptable and practical for real-life applications. Moreover, once keys are distributed, group members will be able to freely communicate with any member in security with no need of a group controller. |
URI: | http://hdl.handle.net/11455/70014 | ISSN: | 0926-6801 |
Appears in Collections: | 期刊論文 |
Show full item record
TAIR Related Article
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.