| 一种动态叛徒追踪方案的性能分析 |
| |
| 引用本文： | 赵林森.一种动态叛徒追踪方案的性能分析[J].通信技术,2008,41(9). |
| |
| 作者姓名： | 赵林森 |
| |
| 作者单位： | 西安邮电学院,电子与信息工程系,陕西,西安,710061 |
| |
| 摘 要： | 叛徒追踪方案是在共谋密钥攻击和重放攻击中追踪及识别叛徒的有效措施.文中介绍了A.Fiat和T.Tassa提出的3个不同追踪算法,并在系统带宽要求和追踪复杂度方面对算法进行了分析比较,指出算法存在的性能缺陷.理论算法A的系统计算量虽然较低,但是追踪复杂度接近月nρ;算法B,C在系统带宽和追踪复杂度之间进行了均衡,但算法C的追踪复杂度依然很高.较高的复杂度使得方案只能适用于较小用户量系统.
|
| 关 键 词： | 动态 叛徒追踪 复杂度 |
Analysis of A Dynamic Traitor Tracing Scheme |
| |
| ZHAO Lin-sen.Analysis of A Dynamic Traitor Tracing Scheme[J].Communications Technology,2008,41(9). |
| |
| Authors: | ZHAO Lin-sen |
| |
| Affiliation: | ZHAO Lin-sen(Telecom Department,Xi\'an Institute of Post & Telecommunications,Xi\'an Shaanxi 710061,China) |
| |
| Abstract: | Traitor tracing schemes play an important role in tracing and identifying the traitors in conspiracy and replay attack.The three different algorithms proposed by A.Fiat and T.Tassa are described,and the performance of bandwidth and tracing complexity is also analyzed.Finally the disadvantages of the algorithms are presented.It is found that the algorithm A has a low computation cost while the tracing complexity is close to n p,which is too high to implement.Algorithms B and C have a trade-off between the ba... |
| |
| Keywords: | dynamic traitor tracing complexity |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
