摘要
叛徒追踪方案是在共谋密钥攻击和重放攻击中追踪及识别叛徒的有效措施.文中针对A.Fiat和T.Tassa提出的3个不同追踪算法,指出其理论算法在执行过程中的局限性,并在系统带宽要求和追踪复杂度方面对3个算法进行了分析比较,指出算法存在的性能缺陷,同时指出了此类算法未来的设计方向.
Traitor tracing schemes play an important role in tracing and identifying the traitors in conspiracy and replay attack. We analyzed the three different algorithms proposed by A. Fiat and T. Tassa and showed that the academic algorithm has some localization when it was implemented. The performance of bandwidth and tracing complexity of the three algorithms were also analyzed. Finally the disadvantages of the algorithms and their limitations were presented.
出处
《微电子学与计算机》
CSCD
北大核心
2008年第12期165-168,共4页
Microelectronics & Computer
关键词
动态
叛徒追踪
复杂度
共谋
dynamic
traitor tracing
complexity
conspiracy
