Randomized frameproof codes: Fingerprinting plus validation minus tracing
NP Anthapadmanabhan, A Barg - 2008 42nd Annual …, 2008 - ieeexplore.ieee.org
We propose randomized frameproof codes for content protection, which arise by studying a
variation of the Boneh-Shaw fingerprinting problem. In the modified system, whenever a
user tries to access his fingerprinted copy, the fingerprint is submitted to a validation
algorithm to verify that it is indeed permissible before the content can be executed. We show
an improvement in the achievable rates compared to deterministic frameproof codes and
traditional fingerprinting codes. For coalitions of an arbitrary fixed size, we construct …
variation of the Boneh-Shaw fingerprinting problem. In the modified system, whenever a
user tries to access his fingerprinted copy, the fingerprint is submitted to a validation
algorithm to verify that it is indeed permissible before the content can be executed. We show
an improvement in the achievable rates compared to deterministic frameproof codes and
traditional fingerprinting codes. For coalitions of an arbitrary fixed size, we construct …
Randomized Frameproof Codes: Fingerprinting Plus Validation Minus Tracing
N Prasanth Anthapadmanabhan, A Barg - arXiv e-prints, 2008 - ui.adsabs.harvard.edu
We propose randomized frameproof codes for content protection, which arise by studying a
variation of the Boneh-Shaw fingerprinting problem. In the modified system, whenever a
user tries to access his fingerprinted copy, the fingerprint is submitted to a validation
algorithm to verify that it is indeed permissible before the content can be executed. We show
an improvement in the achievable rates compared to deterministic frameproof codes and
traditional fingerprinting codes. For coalitions of an arbitrary fixed size, we construct …
variation of the Boneh-Shaw fingerprinting problem. In the modified system, whenever a
user tries to access his fingerprinted copy, the fingerprint is submitted to a validation
algorithm to verify that it is indeed permissible before the content can be executed. We show
an improvement in the achievable rates compared to deterministic frameproof codes and
traditional fingerprinting codes. For coalitions of an arbitrary fixed size, we construct …
Showing the best results for this search. See all results