CryptoDB
New Techniques for Traitor Tracing: Size N^{1/3} and More from Pairings
Authors: |
|
---|---|
Download: |
|
Presentation: | Slides |
Conference: | CRYPTO 2020 |
Abstract: | The best existing traitor tracing scheme from pairings achieves $O(\sqrt{N})$-sized parameters, which has stood since 2006. This intuitively seems to be consistent with the fact that pairings allow for degree-2 computations, yielding a quadratic compression. In this work, we show that this intuition is false by building a traitor tracing scheme from pairings with $O(\sqrt[3]{N})$-sized parameters. We obtain our scheme by developing a number of new traitor tracing techniques offering various trade-offs that were not possible before, giving the first significant parameter improvements in pairings-based traitor tracing in over a decade. |
Video from CRYPTO 2020
BibTeX
@inproceedings{crypto-2020-30467, title={New Techniques for Traitor Tracing: Size N^{1/3} and More from Pairings}, publisher={Springer-Verlag}, doi={10.1007/978-3-030-56784-2_22}, author={Mark Zhandry}, year=2020 }