New Secure Broadcasting Scheme Realizing Information Granularity
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
1523 | en_US |
dc.citation.issue |
4 | en_US |
dc.citation.spage |
1509 | en_US |
dc.citation.volume |
26 | en_US |
dc.citation.woscount |
0 | |
dc.contributor.author |
Lee, Chin-I | en_US |
dc.contributor.author |
Wu, Tzong-Chen | en_US |
dc.contributor.author |
Yang, Bo-Yin | en_US |
dc.contributor.author |
Tzeng, Wen-Guey | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:06:39Z | |
dc.date.available |
2014-12-08T15:06:39Z | |
dc.date.issued |
2010-07-01 | en_US |
dc.description.abstract |
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. | en_US |
dc.identifier.issn |
1016-2364 | en_US |
dc.identifier.journal |
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/5207 | |
dc.identifier.wosnumber |
WOS:000280434700022 | |
dc.language.iso |
en_US | en_US |
dc.subject |
information granularity | en_US |
dc.subject |
secure broadcasting | en_US |
dc.subject |
security clearance level | en_US |
dc.subject |
l-weak bilinear Diffie-Hellman inversion problem | en_US |
dc.subject |
n-modified bilinear Diffie-Hellman problem | en_US |
dc.subject |
collusion | en_US |
dc.title |
New Secure Broadcasting Scheme Realizing Information Granularity | en_US |
dc.type |
Article | en_US |
檔案
- 000280434700022.pdf (233.0 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
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