1 / 1

Dynamic Traitor Tracing for Arbitrary Alphabets: Divide and Conquer

This research paper introduces a novel approach for dynamic traitor tracing in arbitrary alphabets using a divide and conquer strategy. The methodology is based on cutting-edge cryptographic principles. The authors from TU/e and Irdeto present a highly innovative scheme with advanced generalized features. References provided for further exploration.

rhonda-caldwell
Download Presentation

Dynamic Traitor Tracing for Arbitrary Alphabets: Divide and Conquer

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Dynamic Traitor Tracing for Arbitrary Alphabets: Divide and Conquer Thijs Laarhoven (TU/e), Jan-Jaap Oosterwijk (TU/e), Jeroen Doumen (Irdeto) Introduction Conquer + Divide Generalization • References • A. Fiat and T. Tassa, “Dynamic Traitor Tracing”, J. Cryptology, vol. 14, no. 3, 2001. • T. Laarhoven et al., “Dynamic Tardos Traitor Tracing Schemes”, submitted for publication. Available at http://arxiv.org/abs/1111.3597 • G. Tardos, “Optimal Probabilistic Fingerprint Codes”, Proc. 35th ACM Symp. on Theory of Computing, 2003. / Department of Mathematics & Computer Science

More Related