Computer Science – Information Theory
Scientific paper
2006-12-14
Computer Science
Information Theory
final version, 12 pages, 2 figures, to appear in IEEE Trans. on Inform. Theory - Special Issue on Information-theoretic Securi
Scientific paper
We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of the attacker coalition. Lower bounds are obtained by considering typical coalitions, which represents a new idea in the area of fingerprinting and enables us to improve the previously known lower bounds for coalitions of size two and three. For upper bounds, the fingerprinting problem is modelled as a communications problem. It is shown that the maximum code rate is bounded above by the capacity of a certain class of channels, which are similar to the multiple-access channel. Converse coding theorems proved in the paper provide new upper bounds on fingerprinting capacity. It is proved that capacity for fingerprinting against coalitions of size two and three over the binary alphabet satisfies $0.25 \leq C_{2,2} \leq 0.322$ and $0.083 \leq C_{3,2} \leq 0.199$ respectively. For coalitions of an arbitrary fixed size $t,$ we derive an upper bound $(t\ln2)^{-1}$ on fingerprinting capacity in the binary case. Finally, for general alphabets, we establish upper bounds on the fingerprinting capacity involving only single-letter mutual information quantities.
Anthapadmanabhan Prasanth N.
Barg Alexander
Dumer Ilya
No associations
LandOfFree
On the Fingerprinting Capacity Under the Marking Assumption 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 On the Fingerprinting Capacity Under the Marking Assumption, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Fingerprinting Capacity Under the Marking Assumption will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-132549