论文部分内容阅读
随着数字化技术的发展的迅猛发展和Internet的普及,网上交易和传播的电子图书、音乐、视频和软件等数字内容越来越多.由于数字化信息极易被复制、修改和传播,盗版现象日益严重,给相关权利人造成巨大的经济损失.广播加密技术解决版权保护问题并能有效地管理密钥.但用户量巨大的时候,通信量和用户端密钥存储量都急剧增加,为了解决这一问题,本文利用子集覆盖的思想,提出一个允许免费接收者的完全子树广播加密方案,当撤销用户很多的时候,显著降低了系统的通信量.虽然一部分人可能免费接收内容,这些损失可以由减少的带宽费用得到补偿.
With the rapid development of digital technology and the popularization of Internet, more and more digital contents such as e-books, music, video and software are being traded and distributed online. Because digital information can easily be copied, modified and disseminated, Serious, to the relevant rights and interests of people causing huge economic losses.Broadcast encryption technology to solve the problem of copyright protection and can effectively manage the key.However, a huge amount of users, the volume of traffic and client key storage are sharply increased, in order to solve this In this paper, we propose a complete sub-tree broadcast encryption scheme that allows free recipients, using the idea of subset overlay, which significantly reduces system traffic when many users are revoked.Although some people may receive content for free, these losses It can be compensated by reduced bandwidth costs.