DocumentCode
2062080
Title
On perfect traitor tracing
Author
Desmedt, Yvo ; Burmester, Mike ; Kurosawa, Kaoru
Author_Institution
Florida State Univ., Tallahassee, FL, USA
fYear
2002
fDate
2002
Firstpage
439
Abstract
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.
Keywords
cryptography; broadcast encryption scheme; decryption; full decryptability; innocent party; perfect accusability; perfect fairness; perfect security aspects; pirate key; traitor tracing; Broadcasting; Data security; Decoding; Error probability; Public key; Public key cryptography;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN
0-7803-7501-7
Type
conf
DOI
10.1109/ISIT.2002.1023711
Filename
1023711
Link To Document