Computer Science – Information Theory
Scientific paper
2008-02-23
Computer Science
Information Theory
5 pages, To appear in the Proceedings of Conference on Information Sciences and Systems (CISS), Princeton, NJ, Mar 2008
Scientific paper
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 randomized frameproof codes which have an $O(n^2)$ complexity validation algorithm and probability of error $\exp(-\Omega(n)),$ where $n$ denotes the length of the fingerprints. Finally, we present a connection between linear frameproof codes and minimal vectors for size-2 coalitions.
Anthapadmanabhan Prasanth N.
Barg Alexander
No associations
LandOfFree
Randomized Frameproof Codes: Fingerprinting Plus Validation Minus Tracing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Randomized Frameproof Codes: Fingerprinting Plus Validation Minus Tracing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Randomized Frameproof Codes: Fingerprinting Plus Validation Minus Tracing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-571248