English  |  正體中文  |  简体中文  |  Items with full text/Total items : 28611/40649
Visitors : 620626      Online Users : 73
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/27863

Title: Secure multicast in dynamic environments
Authors: Chun-Ying Huang;Yun-Peng Chiu;Kuan-Ta Chen;Chin-Laung Lei
Contributors: NTOU:Department of Computer Science and Engineering
Keywords: ElGamal cryptosystem;Key composition;Key management;Proxy cryptography;Secure multicast
Date: 2007-07-11
Issue Date: 2011-10-21T02:34:16Z
Publisher: Computer Networks
Abstract: Abstract:A secure multicast framework should only allow authorized members of a group to decrypt received messages; usually, one "group key" is shared by all approved members. However, this raises the problem of "one affects all", whereby the actions of one member affect the whole group. Many researchers have solved the problem by dividing a group into several subgroups, but most current solutions require key distribution centers to coordinate secure data communications between subgroups. We believe this is a constraint on network scalability. In this paper, we propose a novel framework to solve key management problems in multicast networks. Our contribution is threefold: (1) We exploit the ElGamal cryptosystem and propose a technique of key composition. (2) Using key composition with proxy cryptography, the key distribution centers used in secure multicast frameworks are eliminated. (3) For key composition, the framework is designed to resist node failures and support topology reconstruction, which makes it suitable for dynamic network environments. Without reducing the security or performance of proxy cryptography, we successfully eliminate the need for key distribution centers. Our analysis shows that the proposed framework is secure, and comparison with other similar frameworks demonstrates that it is efficient in terms of time and space complexity. In addition, the costs of most protocol operations are bounded by constants, regardless of a group's size and the number of branches of transit nodes.
Relation: 51(10), pp.2805–2817
URI: http://ntour.ntou.edu.tw/handle/987654321/27863
Appears in Collections:[資訊工程學系] 期刊論文

Files in This Item:

There are no files associated with this item.

All items in NTOUR are protected by copyright, with all rights reserved.


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback