[Resource Topic] 2006/099: An Efficient Single-Key Pirates Tracing Scheme Using Cover-Free Families

Welcome to the resource topic for 2006/099

Title:
An Efficient Single-Key Pirates Tracing Scheme Using Cover-Free Families

Authors: Dongvu Tonien, Reihaneh Safavi-Naini

Abstract:

A cover-free family is a well-studied combinatorial structure that has many applications in computer science and cryptography. In this paper, we propose a new public key traitor tracing scheme based on cover-free families. The new traitor tracing scheme is similar to the Boneh-Franklin scheme except that in the Boneh-Franklin scheme, decryption keys are derived from Reed-Solomon codes while in our case they are derived from a cover-free family. This results in much simpler and faster tracing algorithms for single-key pirate decoders, compared to the tracing algorithms of Boneh-Franklin scheme that use Berlekamp-Welch algorithm. Our tracing algorithms never accuse innocent users and identify all traitors with overwhelming probability.

ePrint: https://eprint.iacr.org/2006/099

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .