On perfect traitor tracing
暂无分享,去创建一个
We analyze the perfect security aspects of traitor tracing and show that perfect fairness (an innocent party is never accused) is impossible, except if the pirate key allows full decryptability or if nobody is ever accused. Similarly, perfect accusability (at least one traitor is always correctly accused) is impossible, except if the pirate key allows full decryptability or some innocent people will always be among the accused. We also show possibility results.
[1] Matthew K. Franklin,et al. An Efficient Public Key Traitor Tracing Scheme , 1999, CRYPTO.
[2] Yvo Desmedt,et al. Optimum Traitor Tracing and Asymmetric Schemes , 1998, EUROCRYPT.
[3] Amos Fiat,et al. Tracing traitors , 2000, IEEE Trans. Inf. Theory.
[4] Douglas R. Stinson,et al. Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes , 1998, SIAM J. Discret. Math..