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

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

Title: SEMPRE: SECURE MULTICAST ARCHITECTURE USING PROXY RE-ENCRYPTION
Authors: Yun-Peng Chiu;Chun-Ying Huang;Chin-Laung Lei
Contributors: 國立臺灣海洋大學:資訊工程學系
Keywords: Secure multicast;Multicast key management;Proxy re-encryption
Date: 2012-07
Issue Date: 2013-03-15T08:02:52Z
Publisher: International Journal of Innovative Computing, Information and Control
Abstract: Abstract:The goal of a secure multicast communication environment is to ensure that only valid members belonging to the multicast group can decrypt data. A simple solution adopted by many previous studies is to use a \group key" that is shared by all group members. The sender uses the group key to encrypt the multicast data, and the receivers decrypt the data with the same key. However, the procedure may incur the so-called \1 affects n problem", whereby the action of one member affects the whole group. This is the source of scalability problems. Moreover, from an administrative perspective, it is desirable to con ne the impact of membership changes to a local area. In this paper, we propose a novel secure multicast architecture that reduces the impact of the 1 affects n problem signi cantly by exploiting a cryptographic primitive, \proxy reencryption". Therefore, we call the proposed secure multicast architecture Sempre (SEcure Multicast architecture using Proxy Re-Encryption). Proxy re-encryption allows intermediate routers to convert the ciphertext encrypted with one key to ciphertext encrypted with another key, without revealing the private key or the plaintext. If the intermediate routers are given proper keys, they can provide separation between subgroups and thereby achieve the goals of scalability and containment. Successful containment reduces the 1 affects n problem signi cantly. We also compare several related schemes, and discuss some security problems that we identi ed in them. Existing schemes that use similar techniques only use asymmetric-key algorithms, but the computational costs of the algorithms mean that the schemes are infeasible in practice. Our scheme combines asymmetric-key and symmetric-key algorithms, so it is practical for real-worldapplications.
Relation: 8(7), pp.4719-4748
URI: http://ntour.ntou.edu.tw/handle/987654321/33428
Appears in Collections:[資訊工程學系] 期刊論文

Files in This Item:

File Description SizeFormat
index.html0KbHTML274View/Open


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