[Resource Topic] 2023/256: Traitor Tracing with N^(1/3)-size Ciphertexts and O(1)-size Keys from k-Lin

Welcome to the resource topic for 2023/256

Title:
Traitor Tracing with N^(1/3)-size Ciphertexts and O(1)-size Keys from k-Lin

Authors: Junqing Gong, Ji Luo, Hoeteck Wee

Abstract:

We present a pairing-based traitor tracing scheme for N users with$$
|\mathsf{pk}| = |\mathsf{ct}| = O(N^{1/3}), \quad |\mathsf{sk}| = O(1).
$$This is the first pairing-based scheme to achieve {|\mathsf{pk}|\cdot|\mathsf{sk}|\cdot|\mathsf{ct}|=o(N)}. Our construction relies on the (bilateral) k-Lin assumption, and achieves private tracing and full collusion resistance. Our result simultaneously improves upon the sizes of \mathsf{pk},\mathsf{ct} in Boneh–Sahai–Waters [Eurocrypt '06] and the size of \mathsf{sk} in Zhandry [Crypto '20], while further eliminating the reliance on the generic group model in the latter work.

ePrint: https://eprint.iacr.org/2023/256

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 .