Cryptology ePrint Archive: Report 2006/099

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

Dongvu Tonien and 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.

Category / Keywords: public-key cryptography / traitor tracing, cover-free family, combinatorial cryptography

Publication Info: Full version of a paper to appear in ACNS06

Date: received 13 Mar 2006, last revised 27 Mar 2006

Contact author: dong at uow edu au

Available format(s): PDF | BibTeX Citation

Version: 20060328:051503 (All versions of this report)

Short URL: ia.cr/2006/099