Abstract
We describe a fully k-resilient traitor tracing scheme that utilizes RSA as a secret-key rather than public-key cryptosystem. Traitor tracing schemes deter piracy in broadcast encryption systems by enabling the identification of authorized users known as traitors that contribute to unauthorized pirate decoders. In the proposed scheme, upon the confiscation of a pirate decoder created by a collusion of k or fewer authorized users, contributing traitors can be identified with certainty. Also, the scheme prevents innocent users from being framed as traitors. The proposed scheme improves upon the decryption efficiency of past traitor tracing proposals. Each authorized user needs to store only a single decryption key, and decryption primarily consists of a single modular exponentiation operation. In addition, unlike previous traitor tracing schemes, the proposed scheme employs the widely deployed RSA algorithm.
Original language | English (US) |
---|---|
Pages (from-to) | 56-74 |
Number of pages | 19 |
Journal | LECTURE NOTES IN COMPUTER SCIENCE |
Volume | 3531 |
DOIs | |
State | Published - 2005 |
Event | Third International Conference on Applied Cryptography and Network Security, ACNS 2005 - New York, NY, United States Duration: Jun 7 2005 → Jun 10 2005 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- General Computer Science