New Secure Broadcasting Scheme Realizing Information Granularity
檔案
- 000280434700022.pdf (233.0 KB, Adobe PDF)
日期
2010-07-01
類型
系所
期刊名稱
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING
卷期與頁次
第 26 卷第 4 期,頁 1509–1523
ISSN
1016-2364
語言
英文
摘要
This paper proposes a new secure broadcasting scheme to realize the property of "information granularity", wherein a receiver with a higher security clearance level has the natural capability to recover a larger amount of information from the broadcasted message block. Based on the intractability of the product of the e-weak Bilinear Diffie-Hellman Inversion problem and the n-modified Bilinear Diffie-Hellman problem, the proposed scheme achieves the following features: (i) the length of the enabling block is independent of the number of receivers and the number of security clearance levels; (ii) each receiver holds only one small fixed-size decryption key corresponding to his/her security clearance level; (iii) it is computationally feasible for any receiver to derive a session key of a lower but never a higher security clearance level, even taking into account collusion with other receivers; (iv) any receiver can dynamically join or leave the system without resolving the re-keying problem for the existing receivers.
關鍵詞
information granularitysecure broadcastingsecurity clearance levell-weak bilinear Diffie-Hellman inversion problemn-modified bilinear Diffie-Hellman problemcollusion所屬典藏
期刊論文引用此條目
Lee, C.-I., Wu, T.-C., Yang, B.-Y., & Tzeng, W.-G. (2010). New Secure Broadcasting Scheme Realizing Information Granularity. JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 26(4), 1509–1523. https://ir.lib.nycu.edu.tw/handle/11536/5207
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/5207