Fully collusion resistant traitor tracing with short ciphertexts and private keys

213Citations
Citations of this article
67Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We construct a 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(√/N) and private keys of size O(1). We first introduce a simpler primitive we call private linear broadcast encryption (PLBE) and show that any PLBE gives a tracing traitors system with the same parameters. We then show how to build a PLBE system with O(√N) size ciphertexts. Our system uses bilinear maps in groups of composite order. © International Association for Cryptologic Research 2006.

Cite

CITATION STYLE

APA

Boneh, D., Sahai, A., & Waters, B. (2006). Fully collusion resistant traitor tracing with short ciphertexts and private keys. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4004 LNCS, pp. 573–592). Springer Verlag. https://doi.org/10.1007/11761679_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free