Randomized frameproof codes: Fingerprinting plus validation minus tracing
Prasanth Anthapadmanabhan, N.
Barg, A.
Dept. of Electr. & Comput. Eng., Univ. of Maryland, College Park, MD;
This paper appears in: Information Sciences and Systems, 2008. CISS 2008. 42nd Annual Conference on
Publication Date: 19-21 March 2008
On page(s): 365-369
Location: Princeton, NJ,
ISBN: 978-1-4244-2246-3
INSPEC Accession Number: 10073645
Digital Object Identifier: 10.1109/CISS.2008.4558553
Current Version Published: 2008-07-09
Abstract
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(n2) 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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
