摘要
基于离散对数困难问题,利用随机序列提出一种公钥叛逆者追踪方案。该方案采用多项式与过滤函数来构建,当缴获盗版解码器时,只需通过一次输入输出即可确定叛逆者。若需要撤销或恢复多个叛逆者时,其能在不更新其他合法用户私钥的前提下,实现完全撤销多个叛逆者或完全恢复已撤销用户。性能分析证明,该方案不仅存储、计算和通信开销低,还具有完全抗共谋性、完全撤销性与完全恢复性以及黑盒追踪的特点。
Based on the discrete log representation problem and employing random sequence,an anonymous public key traitor tracing scheme is presented in this paper. This scheme employs the polynomial function and the filter function as the basic means of constructing the traitor tracing procedures. When a pirate decoder is confiscated,single input and output suffices to decide the traitor. If it is necessary to revoke or recover traitors,the scheme can safely revoke or recover the private keys of traitors without updating the private keys of other receivers. The performance analysis shows that the proposed scheme not only has low cost of secure storage,calculation and communication,but also is capable of full collusion resistance,full revocability,full recoverability and black-box traceability.
出处
《电子科技》
2016年第4期180-182,186,共4页
Electronic Science and Technology
基金
湖南省教育厅基金资助项目(13C394)
湖南农业大学"大学生创新性实验计划基金资助项目"(XCX1572)
关键词
离散对数问题
叛逆者追踪
完全撤销性
完全可恢复性
黑盒追踪
discrete log representation problem
traitor tracing
full revocability
full recoverability
blackbox traceability