Scalable public-key tracing and revoking

Traitor Tracing Schemes constitute a very useful tool against piracy in the context of digital content broadcast. In such multi-recipient encryption schemes, each decryption key is fingerprinted and when a pirate decoder is discovered, the authorities can trace the identities of the users that contributed in its construction (called traitors). Public-key traitor tracing schemes allow for a multitude of nontrusted content providers using the same set of keys, which makes the scheme “server-side scalable.” To make such schemes also “client-side scalable,” i.e. long lived and usable for a large population of subscribers that changes dynamically over time, it is crucial to implement efficient Add-user and Remove-user operations. Previous work on public-key traitor tracing did not address this dynamic scenario thoroughly, and there is no efficient scalable public key traitor tracing scheme that allows an increasing number of Add-user and Remove-user operations. To address these iss...

• Type: Conference
• Year: 2003
• Where: PODC
• Authors: Yevgeniy Dodis, Nelly Fazio, Aggelos Kiayias, Moti Yung
• Keywords: Distributed And Parallel Computing, PODC 2003, Public-key Traitor Tracing, Traitor Tracing, Traitor Tracing Scheme