Title :
Capacity-achieving fingerprint decoding
Author :
Huang, Yen-Wei ; Moulin, Pierre
Author_Institution :
ECE Dept., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA
Abstract :
We study randomized fingerprinting codes that achieve the fundamental capacity limits subject to the so-called Boneh-Shaw marking assumption. Two decoding schemes are studied in particular: the joint decoder is capacity-achieving but computationally intense, while the simple decoder is suboptimal but efficient. We provide tight bounds as well as numerical results for capacities and study the difference between these two schemes. Finally, security strategies for both the fingerprint embedders and the collusive attackers are presented.
Keywords :
decoding; random codes; security of data; Boneh-Shaw marking; capacity-achieving fingerprint decoding; joint decoder; randomized fingerprinting codes; security strategy; Content management; Data security; Decoding; Fingerprint recognition; Forgery; Game theory; Joints; Mutual information; Random variables; Time sharing computer systems; Fingerprinting; capacity; game theory; saddle-point problems; traitor tracing;
Conference_Titel :
Information Forensics and Security, 2009. WIFS 2009. First IEEE International Workshop on
Conference_Location :
London
Print_ISBN :
978-1-4244-5279-8
Electronic_ISBN :
978-1-4244-5280-4
DOI :
10.1109/WIFS.2009.5386483
