Paper 2006/045

Fully Collusion Resistant Traitor Tracing

Dan Boneh, Amit Sahai, and Brent Waters

Abstract

We construct the first fully collusion resistant tracing traitors system with sublinear size ciphertexts and constant size private keys. More precisely, let $N$ be the total number of users. Our system generates ciphertexts of size $O(\sqrt{N})$ and private keys of size $O(1)$. We build our system by first building a simpler primitive called private linear broadcast encryption (PLBE). We then show that any PLBE gives a tracing traitors system with the same parameters. Our system uses bilinear maps in groups of composite order.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Unknown where it was published
Keywords
traitor tracing
Contact author(s)
bwaters @ csl sri com
History
2006-05-16: last of 7 revisions
2006-02-10: received
See all versions
Short URL
https://ia.cr/2006/045
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2006/045,
      author = {Dan Boneh and Amit Sahai and Brent Waters},
      title = {Fully Collusion Resistant Traitor Tracing},
      howpublished = {Cryptology ePrint Archive, Paper 2006/045},
      year = {2006},
      note = {\url{https://eprint.iacr.org/2006/045}},
      url = {https://eprint.iacr.org/2006/045}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.