Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/1789
Title: | Key Management Scheme for Multiple Simultaneous Secure Group Communication |
Authors: | Aparna, R. Amberker, B.B. |
Keywords: | Group Communication Group Key Pre-positioned basic share Group Specific share |
Issue Date: | 2009 |
Publisher: | 2009 IEEE International Conference on Internet Multimedia Services Architecture and Applications, IMSAA 2009 |
Citation: | 10.1109/IMSAA.2009.5439485 |
Abstract: | Secure group communication plays an important role for applications like scientific discussions, project management, teleconferencing, pay-per-view. Secure group communication involves confidential message delivery between authorized users. Applications like scientific discussion and project management may lead to a scenario in which it is necessary to set up multiple secure groups simultaneously and few members may be part of several secure groups (there may exist overlapped membership). Hence each independent group should have its own group key. Managing group keys for simultaneous secure groups is a critical issue. So far in the literature only a single group communication scenario is considered. In this paper we consider multiple simultaneous secure groups and propose a key management scheme for managing multiple groups. We use a combination of key-based and secret share-based approach for managing the keys and show that it is possible for members belonging to two or more groups to derive the group keys with less storage. We also handle membership change events and provide authentication for such multiple secure groups. |
Description: | NITW |
URI: | http://localhost:8080/xmlui/handle/123456789/1789 |
Appears in Collections: | Computer Science & Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Key_management_scheme_for_multiple_simultaneous_secure_group_communication.pdf | 293.82 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.