KEY GRAPHS AND SECRET SHARING BE USED IN NETWORK MULTICAST SECURITY

被引:0
|
作者
Jin, Shangzhu [1 ]
Peng, Jun [1 ]
机构
[1] Chongqing Univ Sci & Technol, Sch Elect Informat Engn, Chongqing 401331, Peoples R China
来源
2009 INTERNATIONAL SYMPOSIUM ON COMPUTER NETWORK AND MULTIMEDIA TECHNOLOGY (CNMT 2009), VOLUMES 1 AND 2 | 2009年
关键词
multicast securty; secret sharing; reconstruction of keys;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Multicast communication is increasingly used in applications where the volume of network traffic needs to be minimized. Security of the packets delivered from a source to a large group of receivers presents one of the most challenging research problems for the network architecture. A majority of the proposals for scalable secure multicasting makes use of hierarchical key distribution trees. The Centralized Tree-Based Key Management scheme assigns a unique key to each of the nodes in a member's path to the root. The group key is used by a central server to encrypt multicast data until a member joins or leaves the group.For multicast applications such as pay-per-view where the content has very high value, the group key may need to change frequently. In this paper, we introduce a new approach based on secret sharing in which the server assigns unique secret shares to the nodes in the distribution tree. Our proposal is a prepositioned shared secret scheme that allows the reconstruction of different keys by communicating different activating shares for the same prepositioned information.
引用
收藏
页码:592 / 596
页数:5
相关论文
共 50 条
  • [21] On the Security of Secret Sharing Over a Ring and the Fast Implementation
    Cao, Hongru
    Lin, Sian-Jheng
    Zhang, Weiming
    Han, Yunghsiang S.
    IEEE SIGNAL PROCESSING LETTERS, 2019, 26 (05) : 705 - 709
  • [22] Dynamic key generations for secret sharing in access structures
    Lin, CH
    Lee, W
    Chen, CS
    AINA 2005: 19th International Conference on Advanced Information Networking and Applications, Vol 2, 2005, : 127 - 130
  • [23] More information theoretical inequalities to be used in secret sharing?
    vanDijk, M
    INFORMATION PROCESSING LETTERS, 1997, 63 (01) : 41 - 44
  • [24] Closure Solvability for Network Coding and Secret Sharing
    Gadouleau, Maximilien
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (12) : 7858 - 7869
  • [25] Multiple Secret Key Sharing based on the Network Coding Technique for an Open Cloud DRM Service Provider
    Sriborrirux, Wiroon
    Promsiri, Panuwat
    Limmanee, Apirath
    2014 IEEE 17TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING (CSE), 2014, : 953 - 959
  • [26] Applying cheating identifiable secret sharing scheme in multimedia security
    Zheng Ma
    Yan Ma
    Xiaohong Huang
    Manjun Zhang
    Yanxiao Liu
    EURASIP Journal on Image and Video Processing, 2020
  • [27] Applying cheating identifiable secret sharing scheme in multimedia security
    Ma, Zheng
    Ma, Yan
    Huang, Xiaohong
    Zhang, Manjun
    Liu, Yanxiao
    EURASIP JOURNAL ON IMAGE AND VIDEO PROCESSING, 2020, 2020 (01)
  • [28] Key Transfer Protocol Based On Secret Sharing Using Initiator
    Krishna, C. J.
    2012 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING AND COMMUNICATIONS (ICACC), 2012, : 190 - 193
  • [29] An Authenticated Group Key Transfer Protocol Based on Secret Sharing
    Sun, Yi
    Wen, Qiaoyan
    Sun, Hongxiang
    Li, Wenmin
    Jin, Zhengping
    Zhang, Hua
    2012 INTERNATIONAL WORKSHOP ON INFORMATION AND ELECTRONICS ENGINEERING, 2012, 29 : 403 - 408
  • [30] Authenticated Group Key Transfer Protocol Based on Secret Sharing
    Harn, Lein
    Lin, Changlu
    IEEE TRANSACTIONS ON COMPUTERS, 2010, 59 (06) : 842 - 846