Two-Level Fingerprinting Codes: Non-Trivial Constructions

نویسنده

  • Penying Rochanakul
چکیده

We extend the concept of two-level fingerprinting codes, introduced by Anthapadmanabhan and Barg (2009) in context of traceability (TA) codes [1], to other types of fingerprinting codes, namely identifiable parent property (IPP) codes, secure-frameproof (SFP) codes, and frameproof (FP) codes. We define and propose the first explicit non-trivial construction for two-level IPP, SFP and FP codes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Separating Codes: Constructions and Bounds

Separating codes, initially introduced to test automaton, have revived lately in the study of fingerprinting codes, which are used for copyright protection. Separating codes play their role in making the fingerprinting scheme secure agains coalitions of pirates. We provide here better bounds, constructions and generalizations for these codes.

متن کامل

Construction of Sidon spaces with applications to coding

A subspace of a finite extension field is called a Sidon space if the product of any two of its elements is unique up to a scalarmultiplier from the base field. Sidon spaces were recently introduced by Bachoc et al. as a means to characterize multiplicativeproperties of subspaces, and yet no explicit constructions were given. In this paper, several constructions of Sidon spaces arep...

متن کامل

High rate fingerprinting codes and the fingerprinting capacity

Including a unique code in each copy of a distributed document is an effective way of fighting intellectual piracy. Codes designed for this purpose that are secure against collusion attacks are called fingerprinting codes. In this paper we consider fingerprinting with the marking assumption and design codes that achieve much higher rates than previous constructions. We conjecture that these cod...

متن کامل

Equal-Weight Fingerprinting Codes

We consider binary fingerprinting codes that trace at least one of t pirates using the marking assumption. Ensembles of binary equal-weight codes are considered along with a new efficient decoding algorithm. The design substantially increases the code rates of the former fingerprinting constructions. In particular, for large t, the new tfingerprinting codes have code rate of t−2 ln 2 and identi...

متن کامل

Dynamic frameproof codes

There are many schemes in the literature for protecting digital data from piracy by the use of digital fingerprinting, such as frameproof codes, which prevent traitorous users from colluding to frame an innocent user, and traitortracing schemes, which enable the identification of users involved in piracy. The concept of traitor tracing has been applied to a digital broadcast setting in the form...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1108.6197  شماره 

صفحات  -

تاریخ انتشار 2011