Desmedt, Y and Burmester, M and Kurosawa, K (2002) On perfect traitor tracing. In: ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS. (pp. 439 - 439). IEEE
Full text not available from this repository.
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.
| Type: | Proceedings paper |
|---|---|
| Title: | On perfect traitor tracing |
| Event: | IEEE International Symposium on Information Theory |
| Location: | LAUSANNE, SWITZERLAND |
| Dates: | 2002-06-30 - 2002-07-05 |
| ISBN: | 0-7803-7501-7 |
| Keywords: | SCHEMES |
| UCL classification: | UCL > School of BEAMS > Faculty of Engineering Science > Computer Science |
Archive Staff Only: edit this record