节点文献

流媒体系统多数据流安全的动态选择控制模型

Selective control mechanism for multi-datastream security in streaming media system

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 肖晨; 马世龙; 吕卫峰; 王丽丰;

【Author】 Xiao Chen Ma Shilong Lü Weifeng(School of Computer Science and Technology,Beijing University of Aeronautics and Astronautics,Beijing 100191,China) Wang Lifeng(Department of Electronic and Information Engineering,Beijing Electronic Science and Technology Institute,Beijing 100070,China)

【机构】 北京航空航天大学计算机学院; 北京电子科技学院电子信息工程系;

【摘要】 部分加密等媒体数据加密算法是保护媒体数据安全的有效方法,但用其加密流媒体系统中的多路媒体数据将使系统面临效率、规模扩展与安全性问题.为此提出基于数据安全权重的多数据流加密的动态最优选择控制模型,根据各数据流的带宽、权重等参数,为不同数据动态选择不同强度的加密方法.由于化简后的数学模型是NP难的0-1背包问题,结合实际系统特点提出基于贪婪启发思想的增量式近似算法.理论分析和实验表明该算法时间复杂度低且具有良好的近似性.最终在一个实用流媒体系统———Adm ire系统中设计实现了选择控制模型的原型子系统.

【Abstract】 Partial encryption and other media encryption schemes are effective approaches to encrypt the media data which are high volume and latency sensitive.However,use one media encryption scheme to protect all the media streams in a streaming media system will induce efficiency,scalability and security problems.To solve this problem,a security weightiness based dynamic optimal selective control mechanism for multi-datastream encryption was proposed.The idea of partial encryption was generalized from encrypting a subset of one stream to multi-streams.It can determine the optimum encryption algorithm with different security levels for each stream in the system,according to stream’s bandwidth,weightiness and other parameters.Since the simplified mathematical model is 0-1 knapsack problem which is NP-hard,a greedy heuristic incremental approximate algorithm was designed.Theoretical and experimental analyses show the approximate rate and speed of the algorithm are effective enough to support real-time applications.A prototype was implemented in an actual video conferencing system: Admire.

【基金】 国家973资助项目(G1999032711,2005CB32190);中央办公厅信息安全保密重点实验室基金资助项目(KYKF200702)
  • 【文献出处】 北京航空航天大学学报 ,Journal of Beijing University of Aeronautics and Astronautics , 编辑部邮箱 ,2008年11期
  • 【分类号】TP309.2;TN919.8
  • 【下载频次】86
节点文献中: 

本文链接的文献网络图示:

本文的引文网络