Welcome to the resource topic for 2020/954
Title:
New Techniques for Traitor Tracing: Size N^{1/3} and More from Pairings
Authors: Mark Zhandry
Abstract:The best existing pairing-based traitor tracing schemes have 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 tracing scheme from pairings with O(\sqrt[3]{N})-sized parameters. We additionally give schemes with a variety of parameter size trade-offs, including a scheme with constant-size ciphertexts and public keys (but linear-sized secret keys). All of our schemes make black-box use of the pairings. We obtain our schemes by developing a number of new traitor tracing techniques, giving the first significant parameter improvements in pairings-based traitor tracing in over a decade.
ePrint: https://eprint.iacr.org/2020/954
Talk: https://www.youtube.com/watch?v=L-jeL_qDohQ
Slides: https://iacr.org/submit/files/slides/2020/crypto/crypto2020/10/slides.pdf
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 .