Cycle-Based Limitation for Cryptographic Keys to Be Used in Multimedia Subscription Services

M. Dunte
{"title":"Cycle-Based Limitation for Cryptographic Keys to Be Used in Multimedia Subscription Services","authors":"M. Dunte","doi":"10.1109/MUE.2010.5575065","DOIUrl":null,"url":null,"abstract":"If the results of the latest studies of ABI Research for Internet usage are to be believed, worldwide twelve million TV consumers will be using Internet Protocol Television (IPTV) instead of the traditional TV broadcasting by the end of 2010. Furthermore, analysts of Informa Telecoms & Media are forecasting the worldwide grow in revenue of IPTV to be ten billion US dollar by 2010. The revolution that is described by these figures implies on the one hand an enormous increase in sales values but on the other hand causes problems in handling the data volume. Moreover, IPTV will be attracting criminal attacks like Pay-TV has in traditional broadcasting. Therefore, not only efficient encoding of media data has to be applied to save transmission capacity, but also security mechanisms should be established to prevent unauthorised access. Interesting and promising encryption schemes which can be seamlessly integrated have been proposed in the past. Unfortunately, most of these outstanding solutions missed to cover key generation and management. This paper will unveil methods for both qualitative and cycle-based conditional access (CA).","PeriodicalId":338911,"journal":{"name":"2010 4th International Conference on Multimedia and Ubiquitous Engineering","volume":"163 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 4th International Conference on Multimedia and Ubiquitous Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MUE.2010.5575065","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

If the results of the latest studies of ABI Research for Internet usage are to be believed, worldwide twelve million TV consumers will be using Internet Protocol Television (IPTV) instead of the traditional TV broadcasting by the end of 2010. Furthermore, analysts of Informa Telecoms & Media are forecasting the worldwide grow in revenue of IPTV to be ten billion US dollar by 2010. The revolution that is described by these figures implies on the one hand an enormous increase in sales values but on the other hand causes problems in handling the data volume. Moreover, IPTV will be attracting criminal attacks like Pay-TV has in traditional broadcasting. Therefore, not only efficient encoding of media data has to be applied to save transmission capacity, but also security mechanisms should be established to prevent unauthorised access. Interesting and promising encryption schemes which can be seamlessly integrated have been proposed in the past. Unfortunately, most of these outstanding solutions missed to cover key generation and management. This paper will unveil methods for both qualitative and cycle-based conditional access (CA).
多媒体订阅服务中加密密钥的周期限制
如果ABI Research对互联网使用情况的最新研究结果是可信的,那么到2010年底,全球将有1200万电视消费者使用互联网协议电视(IPTV)来代替传统的电视广播。此外,Informa Telecoms & Media的分析师预测,到2010年,全球IPTV的收入增长将达到100亿美元。这些数字所描述的革命一方面意味着销售额的巨大增长,但另一方面也导致了处理数据量的问题。此外,IPTV将会像传统的付费电视一样吸引犯罪分子的攻击。因此,不仅要对媒体数据进行有效的编码以节省传输容量,而且要建立安全机制以防止未经授权的访问。过去已经提出了一些有趣且有前途的可以无缝集成的加密方案。不幸的是,大多数这些杰出的解决方案都没有涵盖密钥生成和管理。本文将揭示定性和基于循环的条件访问(CA)方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信