CryptoDB
An Efficient Single-Key Pirates Tracing Scheme Using Cover-Free Families
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2006-21592, title={An Efficient Single-Key Pirates Tracing Scheme Using Cover-Free Families}, booktitle={IACR Eprint archive}, keywords={public-key cryptography / traitor tracing, cover-free family, combinatorial cryptography}, url={http://eprint.iacr.org/2006/099}, note={Full version of a paper to appear in ACNS06 dong@uow.edu.au 13235 received 13 Mar 2006, last revised 27 Mar 2006}, author={Dongvu Tonien and Reihaneh Safavi-Naini}, year=2006 }