An efficient traitor tracing scheme based on MDS code

Authors:
Yang Bo;Wang Qin
Affiliations:
South China Agricultural University, Guangzhou, P. R. China;South China Agricultural University, Guangzhou, P. R. China
Venue:
Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services
Year:
2006

Citing 4
Cited 0

Privacy against Piracy: Protecting Two-Level Revocable P-K Traitor Tracing

ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
Efficient Trace and Revoke Schemes

FC '00 Proceedings of the 4th International Conference on Financial Cryptography
Linear Code Implies Public-Key Traitor Tracing

PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Efficient Asymmetric Public-Key Traitor Tracing without Trusted Agents

CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA

Quantified Score

Hi-index	0.00

Visualization

Abstract

A traitor tracing scheme is very useful for preventing piracy in the context of digital content broadcast. The traitor tracing procedure allows the data-suppliers to reveal the identities of the subscribers that were implicated in the construction of a pirate-device that illegally receives the digital content. In this paper, a traitor tracing scheme based on MDS (Maximum Distance Separable) code is proposed. The scheme is collusion-resistant, and its main complexity overload is solving linear equations system, it is more efficient than other available schemes in terms of computation complexity.