On the Security Cost of Interval Multicast
Interval multicast was defined as to send a message to a subset of a group, rather than all of the members in the group, which is important in battlefields and other applications. A Key-Tree based approach was proposed to achieve intervalmulticast security, i.e., to securely multicast the message to the subgroup. The cost of the proposed approach is defined as the number of different keys needed to encrypt the message so that only the members within the subgroup can decrypt. In this paper, we propose another approach based on the Subset Difference scheme to achieve interval-multicast security. We formally prove that, given any subgroup, the cost of the Subset-Difference based approach is no bigger than the one of the Key-Tree based approach. Our experiment studies demonstrate that in most cases, the cost of the SD-based approach is much smaller.
Weifeng Chen Ye Sun
Department of Math & Computer Science California University of Pennsylvania California,PA 15419 Department of Curriculum & Instruction West Virginia University Morgantown,WV 26506
国际会议
2009 IEEE International Conference on Information and Automation(2009年 IEEE信息与自动化国际学术会议)
珠海、澳门
英文
101-105
2009-06-22（万方平台首次上网日期，不代表论文的发表时间）